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-167838859000742.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838859000742
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1679505899963

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-c016
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 17:25:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 17:25:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:25:02] [INFO ] Load time of PNML (sax parser for PT used): 335 ms
[2023-03-22 17:25:02] [INFO ] Transformed 2826 places.
[2023-03-22 17:25:02] [INFO ] Transformed 8960 transitions.
[2023-03-22 17:25:02] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 28 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :1
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 108919 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108919 steps, saw 88915 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-22 17:25:06] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-22 17:25:06] [INFO ] Computed 4 place invariants in 79 ms
[2023-03-22 17:25:07] [INFO ] After 762ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 17:25:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-22 17:25:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-22 17:25:09] [INFO ] After 1612ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-22 17:25:09] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-22 17:25:10] [INFO ] After 984ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :2 sat :9
[2023-03-22 17:25:11] [INFO ] After 2391ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 851 ms.
[2023-03-22 17:25:12] [INFO ] After 5612ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 487 ms.
Support contains 75 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 1444 are kept as prefixes of interest. Removing 184 places using SCC suffix rule.15 ms
Discarding 184 places :
Also discarding 0 output transitions
Drop transitions removed 340 transitions
Reduce isomorphic transitions removed 340 transitions.
Iterating post reduction 0 with 340 rules applied. Total rules applied 341 place count 1444 transition count 5622
Discarding 281 places :
Symmetric choice reduction at 1 with 281 rule applications. Total rules 622 place count 1163 transition count 3446
Iterating global reduction 1 with 281 rules applied. Total rules applied 903 place count 1163 transition count 3446
Ensure Unique test removed 382 transitions
Reduce isomorphic transitions removed 382 transitions.
Iterating post reduction 1 with 382 rules applied. Total rules applied 1285 place count 1163 transition count 3064
Discarding 142 places :
Symmetric choice reduction at 2 with 142 rule applications. Total rules 1427 place count 1021 transition count 2780
Iterating global reduction 2 with 142 rules applied. Total rules applied 1569 place count 1021 transition count 2780
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1641 place count 1021 transition count 2708
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1652 place count 1010 transition count 2686
Iterating global reduction 3 with 11 rules applied. Total rules applied 1663 place count 1010 transition count 2686
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1673 place count 1000 transition count 2666
Iterating global reduction 3 with 10 rules applied. Total rules applied 1683 place count 1000 transition count 2666
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1693 place count 990 transition count 2646
Iterating global reduction 3 with 10 rules applied. Total rules applied 1703 place count 990 transition count 2646
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1713 place count 980 transition count 2626
Iterating global reduction 3 with 10 rules applied. Total rules applied 1723 place count 980 transition count 2626
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1732 place count 971 transition count 2608
Iterating global reduction 3 with 9 rules applied. Total rules applied 1741 place count 971 transition count 2608
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1747 place count 965 transition count 2596
Iterating global reduction 3 with 6 rules applied. Total rules applied 1753 place count 965 transition count 2596
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1757 place count 961 transition count 2588
Iterating global reduction 3 with 4 rules applied. Total rules applied 1761 place count 961 transition count 2588
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1776 place count 946 transition count 2532
Iterating global reduction 3 with 15 rules applied. Total rules applied 1791 place count 946 transition count 2532
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1812 place count 925 transition count 2448
Iterating global reduction 3 with 21 rules applied. Total rules applied 1833 place count 925 transition count 2448
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1852 place count 906 transition count 2392
Iterating global reduction 3 with 19 rules applied. Total rules applied 1871 place count 906 transition count 2392
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1890 place count 887 transition count 2354
Iterating global reduction 3 with 19 rules applied. Total rules applied 1909 place count 887 transition count 2354
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1928 place count 868 transition count 2316
Iterating global reduction 3 with 19 rules applied. Total rules applied 1947 place count 868 transition count 2316
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1966 place count 849 transition count 2278
Iterating global reduction 3 with 19 rules applied. Total rules applied 1985 place count 849 transition count 2278
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 2001 place count 833 transition count 2246
Iterating global reduction 3 with 16 rules applied. Total rules applied 2017 place count 833 transition count 2246
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2025 place count 825 transition count 2230
Iterating global reduction 3 with 8 rules applied. Total rules applied 2033 place count 825 transition count 2230
Drop transitions removed 86 transitions
Redundant transition composition rules discarded 86 transitions
Iterating global reduction 3 with 86 rules applied. Total rules applied 2119 place count 825 transition count 2144
Applied a total of 2119 rules in 1487 ms. Remains 825 /1628 variables (removed 803) and now considering 2144/5962 (removed 3818) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1488 ms. Remains : 825/1628 places, 2144/5962 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) 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 9) 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 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 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :1
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 17:25:14] [INFO ] Flow matrix only has 1362 transitions (discarded 782 similar events)
// Phase 1: matrix 1362 rows 825 cols
[2023-03-22 17:25:15] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-22 17:25:15] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-22 17:25:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 17:25:15] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 17:25:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-22 17:25:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 17:25:16] [INFO ] After 641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 17:25:16] [INFO ] State equation strengthened by 242 read => feed constraints.
[2023-03-22 17:25:16] [INFO ] After 452ms SMT Verify possible using 242 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 17:25:17] [INFO ] After 1054ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 398 ms.
[2023-03-22 17:25:17] [INFO ] After 2395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA FunctionPointer-PT-c016-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 239 ms.
Support contains 57 out of 825 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 825/825 places, 2144/2144 transitions.
Graph (complete) has 3559 edges and 825 vertex of which 819 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 819 transition count 2133
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 814 transition count 2123
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 814 transition count 2123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 26 place count 814 transition count 2119
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 811 transition count 2113
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 811 transition count 2113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 808 transition count 2103
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 808 transition count 2103
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 45 place count 801 transition count 2079
Iterating global reduction 2 with 7 rules applied. Total rules applied 52 place count 801 transition count 2079
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 59 place count 794 transition count 2065
Iterating global reduction 2 with 7 rules applied. Total rules applied 66 place count 794 transition count 2065
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 787 transition count 2051
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 787 transition count 2051
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 86 place count 781 transition count 2039
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 781 transition count 2039
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 98 place count 775 transition count 2027
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 775 transition count 2027
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 770 transition count 2017
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 770 transition count 2017
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 117 place count 767 transition count 2011
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 767 transition count 2011
Applied a total of 120 rules in 319 ms. Remains 767 /825 variables (removed 58) and now considering 2011/2144 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 767/825 places, 2011/2144 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) 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 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 212043 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212043 steps, saw 131220 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-22 17:25:21] [INFO ] Flow matrix only has 1267 transitions (discarded 744 similar events)
// Phase 1: matrix 1267 rows 767 cols
[2023-03-22 17:25:21] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-22 17:25:21] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 17:25:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-22 17:25:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-22 17:25:22] [INFO ] After 546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 17:25:22] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-03-22 17:25:22] [INFO ] After 331ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 17:25:23] [INFO ] After 824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-03-22 17:25:23] [INFO ] After 1907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 136 ms.
Support contains 57 out of 767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 767/767 places, 2011/2011 transitions.
Applied a total of 0 rules in 110 ms. Remains 767 /767 variables (removed 0) and now considering 2011/2011 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 767/767 places, 2011/2011 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 767/767 places, 2011/2011 transitions.
Applied a total of 0 rules in 106 ms. Remains 767 /767 variables (removed 0) and now considering 2011/2011 (removed 0) transitions.
[2023-03-22 17:25:23] [INFO ] Flow matrix only has 1267 transitions (discarded 744 similar events)
[2023-03-22 17:25:23] [INFO ] Invariant cache hit.
[2023-03-22 17:25:24] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-03-22 17:25:24] [INFO ] Flow matrix only has 1267 transitions (discarded 744 similar events)
[2023-03-22 17:25:24] [INFO ] Invariant cache hit.
[2023-03-22 17:25:24] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-03-22 17:25:26] [INFO ] Implicit Places using invariants and state equation in 2145 ms returned []
Implicit Place search using SMT with State Equation took 2640 ms to find 0 implicit places.
[2023-03-22 17:25:26] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-22 17:25:26] [INFO ] Flow matrix only has 1267 transitions (discarded 744 similar events)
[2023-03-22 17:25:26] [INFO ] Invariant cache hit.
[2023-03-22 17:25:27] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3485 ms. Remains : 767/767 places, 2011/2011 transitions.
Ensure Unique test removed 744 transitions
Reduce isomorphic transitions removed 744 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 788 rules applied. Total rules applied 788 place count 767 transition count 1223
Reduce places removed 44 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 48 rules applied. Total rules applied 836 place count 723 transition count 1219
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 840 place count 719 transition count 1219
Performed 175 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 175 Pre rules applied. Total rules applied 840 place count 719 transition count 1044
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 350 rules applied. Total rules applied 1190 place count 544 transition count 1044
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 1454 place count 412 transition count 912
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1512 place count 354 transition count 796
Iterating global reduction 3 with 58 rules applied. Total rules applied 1570 place count 354 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1571 place count 354 transition count 795
Discarding 55 places :
Symmetric choice reduction at 4 with 55 rule applications. Total rules 1626 place count 299 transition count 685
Iterating global reduction 4 with 55 rules applied. Total rules applied 1681 place count 299 transition count 685
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 1733 place count 247 transition count 581
Iterating global reduction 4 with 52 rules applied. Total rules applied 1785 place count 247 transition count 581
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 1826 place count 247 transition count 540
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 1828 place count 246 transition count 539
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1892 place count 214 transition count 568
Drop transitions removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 5 with 53 rules applied. Total rules applied 1945 place count 214 transition count 515
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1948 place count 211 transition count 512
Iterating global reduction 5 with 3 rules applied. Total rules applied 1951 place count 211 transition count 512
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1963 place count 211 transition count 500
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1967 place count 209 transition count 521
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1969 place count 209 transition count 519
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 1976 place count 209 transition count 512
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1984 place count 202 transition count 511
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1987 place count 202 transition count 508
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1988 place count 202 transition count 508
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1989 place count 202 transition count 508
Applied a total of 1989 rules in 154 ms. Remains 202 /767 variables (removed 565) and now considering 508/2011 (removed 1503) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 508 rows 202 cols
[2023-03-22 17:25:27] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-22 17:25:27] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 17:25:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 17:25:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:25:27] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 17:25:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 17:25:27] [INFO ] After 99ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 17:25:28] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-22 17:25:28] [INFO ] After 642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-22 17:25:28] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-22 17:25:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 767 places, 2011 transitions and 8174 arcs took 9 ms.
[2023-03-22 17:25:28] [INFO ] Flatten gal took : 179 ms
Total runtime 26913 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 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: 767 places, 2011 transitions, 8174 arcs.
Final Score: 254520.566
Took : 75 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FunctionPointer-PT-c016-ReachabilityCardinality-03 (reachable & potential(( (! ( (tk(P642)) <= (tk(P645)) )) & ( (! ( (tk(P275)) <= ( 0 ) )) | (! ( (tk(P29)) <= ( 14 ) )) ) )))
PROPERTY: FunctionPointer-PT-c016-ReachabilityCardinality-05 (reachable &!potential( ( (! ( ( 4 ) <= (tk(P132)) )) | ( (! ( ( 5 ) <= (tk(P684)) )) & ( ( (tk(P382)) <= ( 0 ) ) | ( (tk(P233)) <= (tk(P296)) ) ) ) )))
PROPERTY: FunctionPointer-PT-c016-ReachabilityCardinality-07 (reachable &!potential( ( ( ( (tk(P648)) <= ( 11 ) ) | ( ( (tk(P13)) <= ( 3 ) ) & ( ( ( ( 15 ) <= (tk(P360)) ) | ( ( (tk(P210)) <= ( 12 ) ) | ( ( 5 ) <= (tk(P430)) ) ) ) | ( ( ( 10 ) <= (tk(P669)) ) | ( ( ( 2 ) <= (tk(P122)) ) | ( ( (tk(P520)) <= ( 1 ) ) & ( (tk(P340)) <= ( 14 ) ) ) ) ) ) ) ) & ( ( (! ( ( 8 ) <= (tk(P326)) )) | ( ( (tk(P212)) <= ( 0 ) ) & ( (tk(P471)) <= ( 0 ) ) ) ) & ( (! ( (tk(P464)) <= (tk(P515)) )) | ( (tk(P674)) <= ( 3 ) ) ) ) )))
PROPERTY: FunctionPointer-PT-c016-ReachabilityCardinality-11 (reachable & potential((! ( (tk(P211)) <= ( 9 ) ))))
PROPERTY: FunctionPointer-PT-c016-ReachabilityCardinality-12 (reachable &!potential( ( ( (! ( (tk(P429)) <= ( 9 ) )) | ( (tk(P703)) <= (tk(P689)) ) ) | ( ( (tk(P444)) <= ( 2 ) ) | ( ( (tk(P383)) <= ( 0 ) ) | ( ( ( ( 8 ) <= (tk(P611)) ) | ( (! ( ( 11 ) <= (tk(P502)) )) | (! ( (tk(P652)) <= ( 10 ) )) ) ) & ( ( (tk(P703)) <= ( 6 ) ) | ( (! ( (tk(P186)) <= (tk(P662)) )) & (! ( (tk(P209)) <= ( 12 ) )) ) ) ) ) ) )))
PROPERTY: FunctionPointer-PT-c016-ReachabilityCardinality-13 (reachable & potential(( (! ( (tk(P100)) <= ( 14 ) )) & ( ( (! ( (tk(P680)) <= ( 9 ) )) | (! ( ( 14 ) <= (tk(P34)) )) ) & ( ( ( (tk(P70)) <= (tk(P752)) ) & ( ( (tk(P371)) <= ( 8 ) ) | ( (! ( (tk(P357)) <= ( 11 ) )) | (! ( (tk(P676)) <= (tk(P428)) )) ) ) ) | ( (! ( (tk(P665)) <= ( 10 ) )) & ( (tk(P214)) <= ( 7 ) ) ) ) ) )))
PROPERTY: FunctionPointer-PT-c016-ReachabilityCardinality-14 (reachable &!potential( ( ( (tk(P641)) <= ( 8 ) ) | ( ( (tk(P696)) <= ( 2 ) ) & ( ( ( (tk(P632)) <= ( 15 ) ) | (! ( ( 7 ) <= (tk(P555)) )) ) | ( (! ( ( 11 ) <= (tk(P154)) )) | ( ( (tk(P105)) <= (tk(P207)) ) | ( ( (tk(P382)) <= (tk(P491)) ) & (! ( (tk(P702)) <= (tk(P624)) )) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 887292 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16100484 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-c016"
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-c016, 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-167838859000742"
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 [ "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 ;