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.r170-tall-167838857700751.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 marciexred
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 r170-tall-167838857700751
=====================================================================

--------------------
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 1678631354796

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c032
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 14:29:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 14:29:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:29:16] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2023-03-12 14:29:16] [INFO ] Transformed 2826 places.
[2023-03-12 14:29:16] [INFO ] Transformed 8960 transitions.
[2023-03-12 14:29:16] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 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 323 ms. (steps per millisecond=30 ) properties (out of 13) seen :2
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) 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 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 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 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2023-03-12 14:29:17] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 14:29:17] [INFO ] Computed 4 place invariants in 78 ms
[2023-03-12 14:29:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:29:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:29:18] [INFO ] After 820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 14:29:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 14:29:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:29:23] [INFO ] After 3564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-12 14:29:23] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 14:29:25] [INFO ] After 2687ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-12 14:29:28] [INFO ] After 5489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1977 ms.
[2023-03-12 14:29:30] [INFO ] After 11819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 271 ms.
Support contains 34 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.13 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 283 places :
Symmetric choice reduction at 0 with 283 rule applications. Total rules 284 place count 1328 transition count 3898
Iterating global reduction 0 with 283 rules applied. Total rules applied 567 place count 1328 transition count 3898
Ensure Unique test removed 482 transitions
Reduce isomorphic transitions removed 482 transitions.
Iterating post reduction 0 with 482 rules applied. Total rules applied 1049 place count 1328 transition count 3416
Discarding 142 places :
Symmetric choice reduction at 1 with 142 rule applications. Total rules 1191 place count 1186 transition count 3132
Iterating global reduction 1 with 142 rules applied. Total rules applied 1333 place count 1186 transition count 3132
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 1453 place count 1186 transition count 3012
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1467 place count 1172 transition count 2984
Iterating global reduction 2 with 14 rules applied. Total rules applied 1481 place count 1172 transition count 2984
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1495 place count 1158 transition count 2956
Iterating global reduction 2 with 14 rules applied. Total rules applied 1509 place count 1158 transition count 2956
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1523 place count 1144 transition count 2928
Iterating global reduction 2 with 14 rules applied. Total rules applied 1537 place count 1144 transition count 2928
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1550 place count 1131 transition count 2902
Iterating global reduction 2 with 13 rules applied. Total rules applied 1563 place count 1131 transition count 2902
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1576 place count 1118 transition count 2876
Iterating global reduction 2 with 13 rules applied. Total rules applied 1589 place count 1118 transition count 2876
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1602 place count 1105 transition count 2850
Iterating global reduction 2 with 13 rules applied. Total rules applied 1615 place count 1105 transition count 2850
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1627 place count 1093 transition count 2826
Iterating global reduction 2 with 12 rules applied. Total rules applied 1639 place count 1093 transition count 2826
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1679 place count 1053 transition count 2678
Iterating global reduction 2 with 40 rules applied. Total rules applied 1719 place count 1053 transition count 2678
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 1762 place count 1010 transition count 2506
Iterating global reduction 2 with 43 rules applied. Total rules applied 1805 place count 1010 transition count 2506
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 1848 place count 967 transition count 2400
Iterating global reduction 2 with 43 rules applied. Total rules applied 1891 place count 967 transition count 2400
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 1934 place count 924 transition count 2314
Iterating global reduction 2 with 43 rules applied. Total rules applied 1977 place count 924 transition count 2314
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 2020 place count 881 transition count 2228
Iterating global reduction 2 with 43 rules applied. Total rules applied 2063 place count 881 transition count 2228
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 2106 place count 838 transition count 2142
Iterating global reduction 2 with 43 rules applied. Total rules applied 2149 place count 838 transition count 2142
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 2189 place count 798 transition count 2062
Iterating global reduction 2 with 40 rules applied. Total rules applied 2229 place count 798 transition count 2062
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2239 place count 788 transition count 2042
Iterating global reduction 2 with 10 rules applied. Total rules applied 2249 place count 788 transition count 2042
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 2291 place count 788 transition count 2000
Applied a total of 2291 rules in 1452 ms. Remains 788 /1628 variables (removed 840) and now considering 2000/5962 (removed 3962) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1454 ms. Remains : 788/1628 places, 2000/5962 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) 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 14 ms. (steps per millisecond=714 ) 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 10000 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 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 14 ms. (steps per millisecond=714 ) properties (out of 11) 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 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 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 187173 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{7=1}
Probabilistic random walk after 187173 steps, saw 121937 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :1
FORMULA FunctionPointer-PT-c032-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
[2023-03-12 14:29:35] [INFO ] Flow matrix only has 1351 transitions (discarded 649 similar events)
// Phase 1: matrix 1351 rows 788 cols
[2023-03-12 14:29:35] [INFO ] Computed 2 place invariants in 15 ms
[2023-03-12 14:29:35] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 14:29:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:29:35] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 14:29:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 14:29:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 14:29:38] [INFO ] After 2074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 14:29:38] [INFO ] State equation strengthened by 328 read => feed constraints.
[2023-03-12 14:29:40] [INFO ] After 1708ms SMT Verify possible using 328 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 14:29:41] [INFO ] After 3046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1024 ms.
[2023-03-12 14:29:42] [INFO ] After 6450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 183 ms.
Support contains 33 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 2000/2000 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 787 transition count 1998
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 787 transition count 1998
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 787 transition count 1996
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 786 transition count 1994
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 786 transition count 1994
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 785 transition count 1992
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 785 transition count 1992
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 784 transition count 1990
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 784 transition count 1990
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 783 transition count 1988
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 783 transition count 1988
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 781 transition count 1980
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 781 transition count 1980
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 779 transition count 1976
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 779 transition count 1976
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 777 transition count 1972
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 777 transition count 1972
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 775 transition count 1968
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 775 transition count 1968
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 773 transition count 1964
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 773 transition count 1964
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 771 transition count 1960
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 771 transition count 1960
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 769 transition count 1956
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 769 transition count 1956
Applied a total of 40 rules in 341 ms. Remains 769 /788 variables (removed 19) and now considering 1956/2000 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 769/788 places, 1956/2000 transitions.
Incomplete random walk after 10016 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=154 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 173297 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 173297 steps, saw 112501 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-12 14:29:46] [INFO ] Flow matrix only has 1321 transitions (discarded 635 similar events)
// Phase 1: matrix 1321 rows 769 cols
[2023-03-12 14:29:46] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-12 14:29:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 14:29:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:29:46] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 14:29:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 14:29:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:29:48] [INFO ] After 1778ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 14:29:48] [INFO ] State equation strengthened by 322 read => feed constraints.
[2023-03-12 14:29:49] [INFO ] After 1421ms SMT Verify possible using 322 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 14:29:51] [INFO ] After 2551ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 851 ms.
[2023-03-12 14:29:51] [INFO ] After 5489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 173 ms.
Support contains 33 out of 769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1956/1956 transitions.
Applied a total of 0 rules in 111 ms. Remains 769 /769 variables (removed 0) and now considering 1956/1956 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 769/769 places, 1956/1956 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1956/1956 transitions.
Applied a total of 0 rules in 112 ms. Remains 769 /769 variables (removed 0) and now considering 1956/1956 (removed 0) transitions.
[2023-03-12 14:29:52] [INFO ] Flow matrix only has 1321 transitions (discarded 635 similar events)
[2023-03-12 14:29:52] [INFO ] Invariant cache hit.
[2023-03-12 14:29:52] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-12 14:29:52] [INFO ] Flow matrix only has 1321 transitions (discarded 635 similar events)
[2023-03-12 14:29:52] [INFO ] Invariant cache hit.
[2023-03-12 14:29:53] [INFO ] State equation strengthened by 322 read => feed constraints.
[2023-03-12 14:29:54] [INFO ] Implicit Places using invariants and state equation in 1849 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
[2023-03-12 14:29:54] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-12 14:29:54] [INFO ] Flow matrix only has 1321 transitions (discarded 635 similar events)
[2023-03-12 14:29:54] [INFO ] Invariant cache hit.
[2023-03-12 14:29:55] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3020 ms. Remains : 769/769 places, 1956/1956 transitions.
Graph (trivial) has 1117 edges and 769 vertex of which 189 / 769 are part of one of the 63 SCC in 6 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 509 transitions
Reduce isomorphic transitions removed 824 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 643 transition count 1110
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 621 transition count 1110
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 45 place count 621 transition count 994
Deduced a syphon composed of 116 places in 0 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 277 place count 505 transition count 994
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 339 place count 443 transition count 932
Iterating global reduction 2 with 62 rules applied. Total rules applied 401 place count 443 transition count 932
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 525 place count 443 transition count 808
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 268 rules applied. Total rules applied 793 place count 309 transition count 674
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 854 place count 248 transition count 552
Iterating global reduction 3 with 61 rules applied. Total rules applied 915 place count 248 transition count 552
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 917 place count 248 transition count 550
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 977 place count 188 transition count 430
Iterating global reduction 4 with 60 rules applied. Total rules applied 1037 place count 188 transition count 430
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 1097 place count 128 transition count 310
Iterating global reduction 4 with 60 rules applied. Total rules applied 1157 place count 128 transition count 310
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 4 with 60 rules applied. Total rules applied 1217 place count 128 transition count 250
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 1219 place count 127 transition count 249
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1245 place count 114 transition count 254
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1255 place count 114 transition count 244
Applied a total of 1255 rules in 95 ms. Remains 114 /769 variables (removed 655) and now considering 244/1956 (removed 1712) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 244 rows 114 cols
[2023-03-12 14:29:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 14:29:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 14:29:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:29:55] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 14:29:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 14:29:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:29:55] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 14:29:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:29:55] [INFO ] After 141ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 14:29:56] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-12 14:29:56] [INFO ] After 741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2023-03-12 14:29:56] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-12 14:29:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 769 places, 1956 transitions and 7950 arcs took 11 ms.
[2023-03-12 14:29:56] [INFO ] Flatten gal took : 158 ms
Total runtime 40407 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FuncPointer_3
(NrP: 769 NrTr: 1956 NrArc: 7950)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.102sec

net check time: 0m 0.000sec

init dd package: 0m 2.704sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9470100 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093692 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

3905 8094 13042 21997 29534 31910 37881 53326 60332 56749 62720 85365 91130 81583 87559 128245 101840 128598 112398 162913 152726 159101 138149 187255 183524

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="marciexred"
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 marciexred"
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 r170-tall-167838857700751"
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 ;