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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 16K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K 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-c008-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-c008-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679505127941

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-c008
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 17:12:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 17:12:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:12:09] [INFO ] Load time of PNML (sax parser for PT used): 355 ms
[2023-03-22 17:12:09] [INFO ] Transformed 2826 places.
[2023-03-22 17:12:09] [INFO ] Transformed 8960 transitions.
[2023-03-22 17:12:09] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 524 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 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-c008-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 17:12:10] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-22 17:12:10] [INFO ] Computed 4 place invariants in 80 ms
[2023-03-22 17:12:11] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-22 17:12:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 17:12:13] [INFO ] After 1545ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2023-03-22 17:12:13] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-22 17:12:13] [INFO ] After 298ms SMT Verify possible using 479 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 17:12:13] [INFO ] After 2590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 17:12:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-22 17:12:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:12:16] [INFO ] After 1929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 17:12:17] [INFO ] After 1288ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 17:12:18] [INFO ] Deduced a trap composed of 139 places in 537 ms of which 5 ms to minimize.
[2023-03-22 17:12:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 694 ms
[2023-03-22 17:12:19] [INFO ] After 3383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1165 ms.
[2023-03-22 17:12:20] [INFO ] After 7016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 49 ms.
Support contains 49 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 278 places :
Symmetric choice reduction at 0 with 278 rule applications. Total rules 279 place count 1333 transition count 3890
Iterating global reduction 0 with 278 rules applied. Total rules applied 557 place count 1333 transition count 3890
Ensure Unique test removed 460 transitions
Reduce isomorphic transitions removed 460 transitions.
Iterating post reduction 0 with 460 rules applied. Total rules applied 1017 place count 1333 transition count 3430
Discarding 142 places :
Symmetric choice reduction at 1 with 142 rule applications. Total rules 1159 place count 1191 transition count 3146
Iterating global reduction 1 with 142 rules applied. Total rules applied 1301 place count 1191 transition count 3146
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 1405 place count 1191 transition count 3042
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1418 place count 1178 transition count 3016
Iterating global reduction 2 with 13 rules applied. Total rules applied 1431 place count 1178 transition count 3016
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1444 place count 1165 transition count 2990
Iterating global reduction 2 with 13 rules applied. Total rules applied 1457 place count 1165 transition count 2990
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1470 place count 1152 transition count 2964
Iterating global reduction 2 with 13 rules applied. Total rules applied 1483 place count 1152 transition count 2964
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1496 place count 1139 transition count 2938
Iterating global reduction 2 with 13 rules applied. Total rules applied 1509 place count 1139 transition count 2938
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1522 place count 1126 transition count 2912
Iterating global reduction 2 with 13 rules applied. Total rules applied 1535 place count 1126 transition count 2912
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1545 place count 1116 transition count 2892
Iterating global reduction 2 with 10 rules applied. Total rules applied 1555 place count 1116 transition count 2892
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1561 place count 1110 transition count 2880
Iterating global reduction 2 with 6 rules applied. Total rules applied 1567 place count 1110 transition count 2880
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1585 place count 1092 transition count 2814
Iterating global reduction 2 with 18 rules applied. Total rules applied 1603 place count 1092 transition count 2814
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 1629 place count 1066 transition count 2710
Iterating global reduction 2 with 26 rules applied. Total rules applied 1655 place count 1066 transition count 2710
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 1680 place count 1041 transition count 2640
Iterating global reduction 2 with 25 rules applied. Total rules applied 1705 place count 1041 transition count 2640
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 1730 place count 1016 transition count 2590
Iterating global reduction 2 with 25 rules applied. Total rules applied 1755 place count 1016 transition count 2590
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 1780 place count 991 transition count 2540
Iterating global reduction 2 with 25 rules applied. Total rules applied 1805 place count 991 transition count 2540
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 1830 place count 966 transition count 2490
Iterating global reduction 2 with 25 rules applied. Total rules applied 1855 place count 966 transition count 2490
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1877 place count 944 transition count 2446
Iterating global reduction 2 with 22 rules applied. Total rules applied 1899 place count 944 transition count 2446
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1908 place count 935 transition count 2428
Iterating global reduction 2 with 9 rules applied. Total rules applied 1917 place count 935 transition count 2428
Drop transitions removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 1995 place count 935 transition count 2350
Applied a total of 1995 rules in 1670 ms. Remains 935 /1628 variables (removed 693) and now considering 2350/5962 (removed 3612) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1671 ms. Remains : 935/1628 places, 2350/5962 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-c008-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 17:12:22] [INFO ] Flow matrix only has 1603 transitions (discarded 747 similar events)
// Phase 1: matrix 1603 rows 935 cols
[2023-03-22 17:12:22] [INFO ] Computed 2 place invariants in 26 ms
[2023-03-22 17:12:23] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-22 17:12:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:12:23] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 17:12:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-22 17:12:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:12:25] [INFO ] After 1850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 17:12:25] [INFO ] State equation strengthened by 386 read => feed constraints.
[2023-03-22 17:12:26] [INFO ] After 1598ms SMT Verify possible using 386 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 17:12:28] [INFO ] After 3101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 997 ms.
[2023-03-22 17:12:29] [INFO ] After 6254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 18 ms.
Support contains 48 out of 935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 935/935 places, 2350/2350 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 934 transition count 2348
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 934 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 933 transition count 2346
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 933 transition count 2346
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 932 transition count 2342
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 932 transition count 2342
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 931 transition count 2340
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 931 transition count 2340
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 930 transition count 2338
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 930 transition count 2338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 929 transition count 2336
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 929 transition count 2336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 928 transition count 2334
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 928 transition count 2334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 927 transition count 2332
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 927 transition count 2332
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 926 transition count 2330
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 926 transition count 2330
Applied a total of 18 rules in 377 ms. Remains 926 /935 variables (removed 9) and now considering 2330/2350 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 926/935 places, 2330/2350 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 165531 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 165531 steps, saw 107459 distinct states, run finished after 3003 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 17:12:33] [INFO ] Flow matrix only has 1589 transitions (discarded 741 similar events)
// Phase 1: matrix 1589 rows 926 cols
[2023-03-22 17:12:33] [INFO ] Computed 2 place invariants in 22 ms
[2023-03-22 17:12:33] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-22 17:12:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:12:33] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 17:12:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-22 17:12:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:12:35] [INFO ] After 1843ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 17:12:35] [INFO ] State equation strengthened by 383 read => feed constraints.
[2023-03-22 17:12:37] [INFO ] After 1647ms SMT Verify possible using 383 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 17:12:38] [INFO ] After 3136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1134 ms.
[2023-03-22 17:12:39] [INFO ] After 6391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 39 ms.
Support contains 48 out of 926 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 926/926 places, 2330/2330 transitions.
Applied a total of 0 rules in 157 ms. Remains 926 /926 variables (removed 0) and now considering 2330/2330 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 926/926 places, 2330/2330 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 926/926 places, 2330/2330 transitions.
Applied a total of 0 rules in 152 ms. Remains 926 /926 variables (removed 0) and now considering 2330/2330 (removed 0) transitions.
[2023-03-22 17:12:40] [INFO ] Flow matrix only has 1589 transitions (discarded 741 similar events)
[2023-03-22 17:12:40] [INFO ] Invariant cache hit.
[2023-03-22 17:12:40] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-22 17:12:40] [INFO ] Flow matrix only has 1589 transitions (discarded 741 similar events)
[2023-03-22 17:12:40] [INFO ] Invariant cache hit.
[2023-03-22 17:12:41] [INFO ] State equation strengthened by 383 read => feed constraints.
[2023-03-22 17:12:43] [INFO ] Implicit Places using invariants and state equation in 2443 ms returned []
Implicit Place search using SMT with State Equation took 2836 ms to find 0 implicit places.
[2023-03-22 17:12:43] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-22 17:12:43] [INFO ] Flow matrix only has 1589 transitions (discarded 741 similar events)
[2023-03-22 17:12:43] [INFO ] Invariant cache hit.
[2023-03-22 17:12:43] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3904 ms. Remains : 926/926 places, 2330/2330 transitions.
Graph (trivial) has 1373 edges and 926 vertex of which 183 / 926 are part of one of the 61 SCC in 7 ms
Free SCC test removed 122 places
Drop transitions removed 305 transitions
Ensure Unique test removed 619 transitions
Reduce isomorphic transitions removed 924 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 804 transition count 1367
Reduce places removed 39 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 42 rules applied. Total rules applied 82 place count 765 transition count 1364
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 762 transition count 1364
Performed 176 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 176 Pre rules applied. Total rules applied 85 place count 762 transition count 1188
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 352 rules applied. Total rules applied 437 place count 586 transition count 1188
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 497 place count 526 transition count 1128
Iterating global reduction 3 with 60 rules applied. Total rules applied 557 place count 526 transition count 1128
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 3 with 120 rules applied. Total rules applied 677 place count 526 transition count 1008
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 0 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 4 with 270 rules applied. Total rules applied 947 place count 391 transition count 873
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 1005 place count 333 transition count 757
Iterating global reduction 4 with 58 rules applied. Total rules applied 1063 place count 333 transition count 757
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1064 place count 333 transition count 756
Discarding 54 places :
Symmetric choice reduction at 5 with 54 rule applications. Total rules 1118 place count 279 transition count 648
Iterating global reduction 5 with 54 rules applied. Total rules applied 1172 place count 279 transition count 648
Discarding 53 places :
Symmetric choice reduction at 5 with 53 rule applications. Total rules 1225 place count 226 transition count 542
Iterating global reduction 5 with 53 rules applied. Total rules applied 1278 place count 226 transition count 542
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 5 with 50 rules applied. Total rules applied 1328 place count 226 transition count 492
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1330 place count 225 transition count 491
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 1402 place count 189 transition count 525
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1404 place count 189 transition count 523
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 7 with 46 rules applied. Total rules applied 1450 place count 189 transition count 477
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1451 place count 188 transition count 476
Iterating global reduction 7 with 1 rules applied. Total rules applied 1452 place count 188 transition count 476
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1463 place count 188 transition count 465
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1466 place count 188 transition count 462
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1469 place count 185 transition count 462
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1470 place count 185 transition count 461
Applied a total of 1470 rules in 166 ms. Remains 185 /926 variables (removed 741) and now considering 461/2330 (removed 1869) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 461 rows 185 cols
[2023-03-22 17:12:44] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-22 17:12:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 17:12:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:12:44] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 17:12:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 17:12:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 17:12:44] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 17:12:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 17:12:44] [INFO ] After 257ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 17:12:45] [INFO ] After 565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-22 17:12:45] [INFO ] After 1214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-22 17:12:45] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-22 17:12:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 926 places, 2330 transitions and 9444 arcs took 12 ms.
[2023-03-22 17:12:45] [INFO ] Flatten gal took : 194 ms
Total runtime 36431 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FunctionPointer (PT), instance c008
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: 926 places, 2330 transitions, 9444 arcs.
Final Score: 228152.878
Took : 115 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679505282328

--------------------
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 12708:
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-c008"
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-c008, 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-167838859000735"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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