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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
693.016 155909.00 184712.00 654.70 ??T??F???T?T???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-167838859100751.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-c032, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838859100751
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.5K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 12:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-c032-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679507597959

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c032
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 17:53:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 17:53:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:53:19] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2023-03-22 17:53:19] [INFO ] Transformed 2826 places.
[2023-03-22 17:53:19] [INFO ] Transformed 8960 transitions.
[2023-03-22 17:53:19] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 27 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :1
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) 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 12) 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 12) seen :0
Interrupted probabilistic random walk after 96291 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96291 steps, saw 78604 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-22 17:53:23] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-22 17:53:23] [INFO ] Computed 4 place invariants in 79 ms
[2023-03-22 17:53:24] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-22 17:53:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 17:53:24] [INFO ] After 934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 17:53:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-22 17:53:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:53:29] [INFO ] After 3542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-22 17:53:29] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-22 17:53:32] [INFO ] After 2681ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-22 17:53:34] [INFO ] After 5284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 2002 ms.
[2023-03-22 17:53:36] [INFO ] After 11659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 134 ms.
Support contains 58 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.12 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 266 places :
Symmetric choice reduction at 0 with 266 rule applications. Total rules 267 place count 1345 transition count 4144
Iterating global reduction 0 with 266 rules applied. Total rules applied 533 place count 1345 transition count 4144
Ensure Unique test removed 616 transitions
Reduce isomorphic transitions removed 616 transitions.
Iterating post reduction 0 with 616 rules applied. Total rules applied 1149 place count 1345 transition count 3528
Discarding 125 places :
Symmetric choice reduction at 1 with 125 rule applications. Total rules 1274 place count 1220 transition count 3278
Iterating global reduction 1 with 125 rules applied. Total rules applied 1399 place count 1220 transition count 3278
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Iterating post reduction 1 with 180 rules applied. Total rules applied 1579 place count 1220 transition count 3098
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1593 place count 1206 transition count 3070
Iterating global reduction 2 with 14 rules applied. Total rules applied 1607 place count 1206 transition count 3070
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1621 place count 1192 transition count 3042
Iterating global reduction 2 with 14 rules applied. Total rules applied 1635 place count 1192 transition count 3042
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1649 place count 1178 transition count 3014
Iterating global reduction 2 with 14 rules applied. Total rules applied 1663 place count 1178 transition count 3014
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1676 place count 1165 transition count 2988
Iterating global reduction 2 with 13 rules applied. Total rules applied 1689 place count 1165 transition count 2988
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1702 place count 1152 transition count 2962
Iterating global reduction 2 with 13 rules applied. Total rules applied 1715 place count 1152 transition count 2962
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1727 place count 1140 transition count 2938
Iterating global reduction 2 with 12 rules applied. Total rules applied 1739 place count 1140 transition count 2938
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1750 place count 1129 transition count 2916
Iterating global reduction 2 with 11 rules applied. Total rules applied 1761 place count 1129 transition count 2916
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1783 place count 1107 transition count 2840
Iterating global reduction 2 with 22 rules applied. Total rules applied 1805 place count 1107 transition count 2840
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1833 place count 1079 transition count 2728
Iterating global reduction 2 with 28 rules applied. Total rules applied 1861 place count 1079 transition count 2728
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1889 place count 1051 transition count 2648
Iterating global reduction 2 with 28 rules applied. Total rules applied 1917 place count 1051 transition count 2648
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1945 place count 1023 transition count 2592
Iterating global reduction 2 with 28 rules applied. Total rules applied 1973 place count 1023 transition count 2592
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 2001 place count 995 transition count 2536
Iterating global reduction 2 with 28 rules applied. Total rules applied 2029 place count 995 transition count 2536
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 2057 place count 967 transition count 2480
Iterating global reduction 2 with 28 rules applied. Total rules applied 2085 place count 967 transition count 2480
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 2111 place count 941 transition count 2428
Iterating global reduction 2 with 26 rules applied. Total rules applied 2137 place count 941 transition count 2428
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2149 place count 929 transition count 2404
Iterating global reduction 2 with 12 rules applied. Total rules applied 2161 place count 929 transition count 2404
Drop transitions removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 2 with 72 rules applied. Total rules applied 2233 place count 929 transition count 2332
Applied a total of 2233 rules in 1614 ms. Remains 929 /1628 variables (removed 699) and now considering 2332/5962 (removed 3630) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1616 ms. Remains : 929/1628 places, 2332/5962 transitions.
Incomplete random walk after 10024 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Interrupted probabilistic random walk after 124489 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{8=1}
Probabilistic random walk after 124489 steps, saw 81106 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :1
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 11 properties.
[2023-03-22 17:53:41] [INFO ] Flow matrix only has 1575 transitions (discarded 757 similar events)
// Phase 1: matrix 1575 rows 929 cols
[2023-03-22 17:53:41] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-22 17:53:42] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-22 17:53:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:53:42] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 17:53:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-22 17:53:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:53:45] [INFO ] After 2910ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 17:53:45] [INFO ] State equation strengthened by 371 read => feed constraints.
[2023-03-22 17:53:47] [INFO ] After 1919ms SMT Verify possible using 371 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 17:53:49] [INFO ] After 3480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1404 ms.
[2023-03-22 17:53:50] [INFO ] After 8197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 251 ms.
Support contains 57 out of 929 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 929/929 places, 2332/2332 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 928 transition count 2330
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 928 transition count 2330
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 928 transition count 2328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 927 transition count 2326
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 927 transition count 2326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 926 transition count 2324
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 926 transition count 2324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 925 transition count 2322
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 925 transition count 2322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 924 transition count 2320
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 924 transition count 2320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 923 transition count 2316
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 923 transition count 2316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 922 transition count 2314
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 922 transition count 2314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 921 transition count 2312
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 921 transition count 2312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 920 transition count 2310
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 920 transition count 2310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 919 transition count 2308
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 919 transition count 2308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 918 transition count 2306
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 918 transition count 2306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 917 transition count 2304
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 917 transition count 2304
Applied a total of 26 rules in 495 ms. Remains 917 /929 variables (removed 12) and now considering 2304/2332 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 917/929 places, 2304/2332 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) 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 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 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Interrupted probabilistic random walk after 150874 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150874 steps, saw 97947 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-22 17:53:54] [INFO ] Flow matrix only has 1557 transitions (discarded 747 similar events)
// Phase 1: matrix 1557 rows 917 cols
[2023-03-22 17:53:54] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-22 17:53:54] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-22 17:53:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-22 17:53:54] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 17:53:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-22 17:53:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:53:57] [INFO ] After 2653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 17:53:57] [INFO ] State equation strengthened by 368 read => feed constraints.
[2023-03-22 17:53:59] [INFO ] After 1871ms SMT Verify possible using 368 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 17:54:01] [INFO ] After 3580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1340 ms.
[2023-03-22 17:54:02] [INFO ] After 7946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 175 ms.
Support contains 57 out of 917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 917/917 places, 2304/2304 transitions.
Applied a total of 0 rules in 149 ms. Remains 917 /917 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 917/917 places, 2304/2304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 917/917 places, 2304/2304 transitions.
Applied a total of 0 rules in 145 ms. Remains 917 /917 variables (removed 0) and now considering 2304/2304 (removed 0) transitions.
[2023-03-22 17:54:03] [INFO ] Flow matrix only has 1557 transitions (discarded 747 similar events)
[2023-03-22 17:54:03] [INFO ] Invariant cache hit.
[2023-03-22 17:54:03] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-22 17:54:03] [INFO ] Flow matrix only has 1557 transitions (discarded 747 similar events)
[2023-03-22 17:54:03] [INFO ] Invariant cache hit.
[2023-03-22 17:54:04] [INFO ] State equation strengthened by 368 read => feed constraints.
[2023-03-22 17:54:06] [INFO ] Implicit Places using invariants and state equation in 2386 ms returned []
Implicit Place search using SMT with State Equation took 2804 ms to find 0 implicit places.
[2023-03-22 17:54:06] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-22 17:54:06] [INFO ] Flow matrix only has 1557 transitions (discarded 747 similar events)
[2023-03-22 17:54:06] [INFO ] Invariant cache hit.
[2023-03-22 17:54:06] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3807 ms. Remains : 917/917 places, 2304/2304 transitions.
Graph (trivial) has 1298 edges and 917 vertex of which 183 / 917 are part of one of the 61 SCC in 8 ms
Free SCC test removed 122 places
Drop transitions removed 305 transitions
Ensure Unique test removed 625 transitions
Reduce isomorphic transitions removed 930 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 795 transition count 1340
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 761 transition count 1338
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 759 transition count 1338
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 165 Pre rules applied. Total rules applied 73 place count 759 transition count 1173
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 330 rules applied. Total rules applied 403 place count 594 transition count 1173
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 463 place count 534 transition count 1113
Iterating global reduction 3 with 60 rules applied. Total rules applied 523 place count 534 transition count 1113
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 3 with 120 rules applied. Total rules applied 643 place count 534 transition count 993
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 1 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 4 with 270 rules applied. Total rules applied 913 place count 399 transition count 858
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 973 place count 339 transition count 738
Iterating global reduction 4 with 60 rules applied. Total rules applied 1033 place count 339 transition count 738
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1035 place count 339 transition count 736
Discarding 59 places :
Symmetric choice reduction at 5 with 59 rule applications. Total rules 1094 place count 280 transition count 618
Iterating global reduction 5 with 59 rules applied. Total rules applied 1153 place count 280 transition count 618
Discarding 58 places :
Symmetric choice reduction at 5 with 58 rule applications. Total rules 1211 place count 222 transition count 502
Iterating global reduction 5 with 58 rules applied. Total rules applied 1269 place count 222 transition count 502
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 5 with 57 rules applied. Total rules applied 1326 place count 222 transition count 445
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1328 place count 221 transition count 444
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 1382 place count 194 transition count 453
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 1403 place count 194 transition count 432
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1404 place count 194 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1405 place count 193 transition count 431
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1406 place count 193 transition count 430
Applied a total of 1406 rules in 151 ms. Remains 193 /917 variables (removed 724) and now considering 430/2304 (removed 1874) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 430 rows 193 cols
[2023-03-22 17:54:07] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-22 17:54:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 17:54:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:54:07] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 17:54:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 17:54:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:54:07] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 17:54:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 17:54:08] [INFO ] After 333ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 17:54:08] [INFO ] After 743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-22 17:54:08] [INFO ] After 1562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2023-03-22 17:54:08] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-22 17:54:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 917 places, 2304 transitions and 9342 arcs took 11 ms.
[2023-03-22 17:54:09] [INFO ] Flatten gal took : 167 ms
Total runtime 49902 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FunctionPointer (PT), instance c032
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 917 places, 2304 transitions, 9342 arcs.
Final Score: 253793.32
Took : 103 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679507753868

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 12571:
syntax error

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c032"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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