fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r171-tall-167838859100758
Last Updated
May 14, 2023

About the Execution of Smart+red for FunctionPointer-PT-c064

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4733.607 3600000.00 3659307.00 8659.20 T?TTTF??FT?F?F?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r171-tall-167838859100758.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-c064, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838859100758
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679508341626

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c064
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 18:05:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 18:05:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:05:43] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2023-03-22 18:05:43] [INFO ] Transformed 2826 places.
[2023-03-22 18:05:44] [INFO ] Transformed 8960 transitions.
[2023-03-22 18:05:44] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 465 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 33 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10054 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) 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 10) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 9 properties.
[2023-03-22 18:05:44] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-22 18:05:45] [INFO ] Computed 4 place invariants in 87 ms
[2023-03-22 18:05:45] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-22 18:05:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 18:05:45] [INFO ] After 657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 18:05:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 18:05:46] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 18:05:47] [INFO ] After 1591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 18:05:47] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-22 18:05:48] [INFO ] After 900ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 18:05:50] [INFO ] After 2283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 758 ms.
[2023-03-22 18:05:50] [INFO ] After 5277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 1460 ms.
Support contains 52 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 1431 are kept as prefixes of interest. Removing 197 places using SCC suffix rule.11 ms
Discarding 197 places :
Also discarding 0 output transitions
Drop transitions removed 364 transitions
Reduce isomorphic transitions removed 364 transitions.
Iterating post reduction 0 with 364 rules applied. Total rules applied 365 place count 1431 transition count 5598
Discarding 285 places :
Symmetric choice reduction at 1 with 285 rule applications. Total rules 650 place count 1146 transition count 3382
Iterating global reduction 1 with 285 rules applied. Total rules applied 935 place count 1146 transition count 3382
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 1297 place count 1146 transition count 3020
Discarding 143 places :
Symmetric choice reduction at 2 with 143 rule applications. Total rules 1440 place count 1003 transition count 2734
Iterating global reduction 2 with 143 rules applied. Total rules applied 1583 place count 1003 transition count 2734
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1647 place count 1003 transition count 2670
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1660 place count 990 transition count 2644
Iterating global reduction 3 with 13 rules applied. Total rules applied 1673 place count 990 transition count 2644
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1686 place count 977 transition count 2618
Iterating global reduction 3 with 13 rules applied. Total rules applied 1699 place count 977 transition count 2618
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1711 place count 965 transition count 2594
Iterating global reduction 3 with 12 rules applied. Total rules applied 1723 place count 965 transition count 2594
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1733 place count 955 transition count 2574
Iterating global reduction 3 with 10 rules applied. Total rules applied 1743 place count 955 transition count 2574
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1751 place count 947 transition count 2558
Iterating global reduction 3 with 8 rules applied. Total rules applied 1759 place count 947 transition count 2558
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1764 place count 942 transition count 2548
Iterating global reduction 3 with 5 rules applied. Total rules applied 1769 place count 942 transition count 2548
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1773 place count 938 transition count 2540
Iterating global reduction 3 with 4 rules applied. Total rules applied 1777 place count 938 transition count 2540
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1794 place count 921 transition count 2476
Iterating global reduction 3 with 17 rules applied. Total rules applied 1811 place count 921 transition count 2476
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1833 place count 899 transition count 2388
Iterating global reduction 3 with 22 rules applied. Total rules applied 1855 place count 899 transition count 2388
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1874 place count 880 transition count 2336
Iterating global reduction 3 with 19 rules applied. Total rules applied 1893 place count 880 transition count 2336
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1912 place count 861 transition count 2298
Iterating global reduction 3 with 19 rules applied. Total rules applied 1931 place count 861 transition count 2298
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1948 place count 844 transition count 2264
Iterating global reduction 3 with 17 rules applied. Total rules applied 1965 place count 844 transition count 2264
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1982 place count 827 transition count 2230
Iterating global reduction 3 with 17 rules applied. Total rules applied 1999 place count 827 transition count 2230
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 2015 place count 811 transition count 2198
Iterating global reduction 3 with 16 rules applied. Total rules applied 2031 place count 811 transition count 2198
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2037 place count 805 transition count 2186
Iterating global reduction 3 with 6 rules applied. Total rules applied 2043 place count 805 transition count 2186
Drop transitions removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 3 with 84 rules applied. Total rules applied 2127 place count 805 transition count 2102
Applied a total of 2127 rules in 1335 ms. Remains 805 /1628 variables (removed 823) and now considering 2102/5962 (removed 3860) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1335 ms. Remains : 805/1628 places, 2102/5962 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) 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 9) 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 9) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-22 18:05:54] [INFO ] Flow matrix only has 1326 transitions (discarded 776 similar events)
// Phase 1: matrix 1326 rows 805 cols
[2023-03-22 18:05:54] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-22 18:05:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 18:05:54] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 18:05:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 18:05:55] [INFO ] After 640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 18:05:55] [INFO ] State equation strengthened by 227 read => feed constraints.
[2023-03-22 18:05:55] [INFO ] After 399ms SMT Verify possible using 227 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 18:05:56] [INFO ] After 963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 347 ms.
[2023-03-22 18:05:56] [INFO ] After 2223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 588 ms.
Support contains 46 out of 805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 805/805 places, 2102/2102 transitions.
Graph (complete) has 3494 edges and 805 vertex of which 802 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 802 transition count 2097
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 800 transition count 2093
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 800 transition count 2093
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 800 transition count 2091
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 798 transition count 2087
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 798 transition count 2087
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 798 transition count 2083
Applied a total of 20 rules in 193 ms. Remains 798 /805 variables (removed 7) and now considering 2083/2102 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 798/805 places, 2083/2102 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) 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 7) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityCardinality-04 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 18:05:57] [INFO ] Flow matrix only has 1314 transitions (discarded 769 similar events)
// Phase 1: matrix 1314 rows 798 cols
[2023-03-22 18:05:57] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-22 18:05:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 18:05:57] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 18:05:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-22 18:05:58] [INFO ] After 535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 18:05:58] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-22 18:05:58] [INFO ] After 278ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 18:05:59] [INFO ] After 697ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 255 ms.
[2023-03-22 18:05:59] [INFO ] After 1711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 637 ms.
Support contains 36 out of 798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 798/798 places, 2083/2083 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 791 transition count 2067
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 791 transition count 2067
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 791 transition count 2063
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 785 transition count 2051
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 785 transition count 2051
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 779 transition count 2037
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 779 transition count 2037
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 774 transition count 2027
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 774 transition count 2027
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 769 transition count 2017
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 769 transition count 2017
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 74 place count 757 transition count 1971
Iterating global reduction 1 with 12 rules applied. Total rules applied 86 place count 757 transition count 1971
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 98 place count 745 transition count 1947
Iterating global reduction 1 with 12 rules applied. Total rules applied 110 place count 745 transition count 1947
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 122 place count 733 transition count 1923
Iterating global reduction 1 with 12 rules applied. Total rules applied 134 place count 733 transition count 1923
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 145 place count 722 transition count 1901
Iterating global reduction 1 with 11 rules applied. Total rules applied 156 place count 722 transition count 1901
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 167 place count 711 transition count 1879
Iterating global reduction 1 with 11 rules applied. Total rules applied 178 place count 711 transition count 1879
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 189 place count 700 transition count 1857
Iterating global reduction 1 with 11 rules applied. Total rules applied 200 place count 700 transition count 1857
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 210 place count 690 transition count 1837
Iterating global reduction 1 with 10 rules applied. Total rules applied 220 place count 690 transition count 1837
Applied a total of 220 rules in 319 ms. Remains 690 /798 variables (removed 108) and now considering 1837/2083 (removed 246) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 690/798 places, 1837/2083 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) 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 21 ms. (steps per millisecond=476 ) properties (out of 6) 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 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 16 ms. (steps per millisecond=625 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 180383 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180383 steps, saw 111631 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 18:06:03] [INFO ] Flow matrix only has 1136 transitions (discarded 701 similar events)
// Phase 1: matrix 1136 rows 690 cols
[2023-03-22 18:06:03] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-22 18:06:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 18:06:03] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 18:06:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 18:06:04] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 18:06:04] [INFO ] State equation strengthened by 184 read => feed constraints.
[2023-03-22 18:06:04] [INFO ] After 255ms SMT Verify possible using 184 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 18:06:05] [INFO ] After 617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 221 ms.
[2023-03-22 18:06:05] [INFO ] After 1465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 509 ms.
Support contains 36 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1837/1837 transitions.
Applied a total of 0 rules in 82 ms. Remains 690 /690 variables (removed 0) and now considering 1837/1837 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 690/690 places, 1837/1837 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1837/1837 transitions.
Applied a total of 0 rules in 81 ms. Remains 690 /690 variables (removed 0) and now considering 1837/1837 (removed 0) transitions.
[2023-03-22 18:06:06] [INFO ] Flow matrix only has 1136 transitions (discarded 701 similar events)
[2023-03-22 18:06:06] [INFO ] Invariant cache hit.
[2023-03-22 18:06:06] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-22 18:06:06] [INFO ] Flow matrix only has 1136 transitions (discarded 701 similar events)
[2023-03-22 18:06:06] [INFO ] Invariant cache hit.
[2023-03-22 18:06:06] [INFO ] State equation strengthened by 184 read => feed constraints.
[2023-03-22 18:06:09] [INFO ] Implicit Places using invariants and state equation in 2851 ms returned []
Implicit Place search using SMT with State Equation took 3317 ms to find 0 implicit places.
[2023-03-22 18:06:09] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-22 18:06:09] [INFO ] Flow matrix only has 1136 transitions (discarded 701 similar events)
[2023-03-22 18:06:09] [INFO ] Invariant cache hit.
[2023-03-22 18:06:10] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4097 ms. Remains : 690/690 places, 1837/1837 transitions.
Ensure Unique test removed 701 transitions
Reduce isomorphic transitions removed 701 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 738 rules applied. Total rules applied 738 place count 690 transition count 1099
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 777 place count 653 transition count 1097
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 779 place count 651 transition count 1097
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 779 place count 651 transition count 939
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 1095 place count 493 transition count 939
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 1373 place count 354 transition count 800
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1434 place count 293 transition count 678
Iterating global reduction 3 with 61 rules applied. Total rules applied 1495 place count 293 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1497 place count 293 transition count 676
Discarding 59 places :
Symmetric choice reduction at 4 with 59 rule applications. Total rules 1556 place count 234 transition count 558
Iterating global reduction 4 with 59 rules applied. Total rules applied 1615 place count 234 transition count 558
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 1673 place count 176 transition count 442
Iterating global reduction 4 with 58 rules applied. Total rules applied 1731 place count 176 transition count 442
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 4 with 55 rules applied. Total rules applied 1786 place count 176 transition count 387
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 1788 place count 175 transition count 386
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 1836 place count 151 transition count 425
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1841 place count 151 transition count 420
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 6 with 41 rules applied. Total rules applied 1882 place count 151 transition count 379
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1884 place count 149 transition count 377
Iterating global reduction 6 with 2 rules applied. Total rules applied 1886 place count 149 transition count 377
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1903 place count 149 transition count 360
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1904 place count 149 transition count 359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1905 place count 148 transition count 359
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1907 place count 148 transition count 359
Applied a total of 1907 rules in 139 ms. Remains 148 /690 variables (removed 542) and now considering 359/1837 (removed 1478) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 359 rows 148 cols
[2023-03-22 18:06:10] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 18:06:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 18:06:10] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 18:06:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 18:06:10] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 18:06:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 18:06:10] [INFO ] After 61ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 18:06:10] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-22 18:06:10] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-22 18:06:10] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-22 18:06:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 690 places, 1837 transitions and 7478 arcs took 10 ms.
[2023-03-22 18:06:11] [INFO ] Flatten gal took : 139 ms
Total runtime 27506 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FunctionPointer (PT), instance c064
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 690 places, 1837 transitions, 7478 arcs.
Final Score: 130719.283
Took : 92 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FunctionPointer-PT-c064-ReachabilityCardinality-01 (reachable & potential(( (! ( (tk(P564)) <= ( 58 ) )) | ( ( ( 14 ) <= (tk(P24)) ) & ( (! ( (tk(P545)) <= ( 0 ) )) | (! ( (tk(P106)) <= ( 63 ) )) ) ) )))
PROPERTY: FunctionPointer-PT-c064-ReachabilityCardinality-06 (reachable &!potential( ( ( ( (! ( (tk(P596)) <= ( 0 ) )) | ( ( 26 ) <= (tk(P603)) ) ) | ( (! ( (tk(P200)) <= (tk(P618)) )) | ( ( 60 ) <= (tk(P606)) ) ) ) | ( ( ( (tk(P396)) <= ( 0 ) ) | ( ( (! ( ( 3 ) <= (tk(P431)) )) & ( ( 45 ) <= (tk(P595)) ) ) & ( (! ( ( 1 ) <= (tk(P597)) )) & (! ( (tk(P626)) <= (tk(P688)) )) ) ) ) | ( ( ( (tk(P144)) <= (tk(P614)) ) & ( (! ( (tk(P573)) <= (tk(P577)) )) | ( ( (tk(P544)) <= ( 0 ) ) | (! ( (tk(P585)) <= (tk(P273)) )) ) ) ) | ( ( (! ( (tk(P426)) <= ( 0 ) )) & (! ( (tk(P201)) <= ( 9 ) )) ) | ( (! ( ( 58 ) <= (tk(P418)) )) & ( (! ( (tk(P406)) <= ( 0 ) )) & (! ( (tk(P385)) <= ( 51 ) )) ) ) ) ) ) )))
PROPERTY: FunctionPointer-PT-c064-ReachabilityCardinality-07 (reachable & potential(( (! ( (tk(P205)) <= ( 51 ) )) & ( (! ( (tk(P313)) <= ( 0 ) )) & ( ( (tk(P487)) <= ( 17 ) ) | (! ( ( 22 ) <= (tk(P587)) )) ) ) )))
PROPERTY: FunctionPointer-PT-c064-ReachabilityCardinality-10 (reachable & potential(( ( 48 ) <= (tk(P568)) )))
PROPERTY: FunctionPointer-PT-c064-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P613)) <= ( 56 ) )))
PROPERTY: FunctionPointer-PT-c064-ReachabilityCardinality-14 (reachable &!potential( ( ( (tk(P350)) <= (tk(P530)) ) | ( (tk(P556)) <= ( 0 ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11412736 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099580 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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="ReachabilityCardinality"
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-c064, examination is ReachabilityCardinality"
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-167838859100758"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;