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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 7.7K Feb 25 11:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 391K 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-b032-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678609261959

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-b032
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 08:21:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 08:21:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:21:03] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-12 08:21:03] [INFO ] Transformed 306 places.
[2023-03-12 08:21:03] [INFO ] Transformed 840 transitions.
[2023-03-12 08:21:03] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10001 steps, including 9 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 11) seen :5
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 08:21:04] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-12 08:21:04] [INFO ] Computed 4 place invariants in 22 ms
[2023-03-12 08:21:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 08:21:04] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 08:21:04] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-12 08:21:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 08:21:04] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 08:21:04] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-12 08:21:04] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 08:21:04] [INFO ] After 123ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-12 08:21:04] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-12 08:21:04] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 10 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 212 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 186 transition count 532
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 186 transition count 532
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 113 place count 186 transition count 472
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 126 place count 173 transition count 446
Iterating global reduction 1 with 13 rules applied. Total rules applied 139 place count 173 transition count 446
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 155 place count 173 transition count 430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 168 transition count 420
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 168 transition count 420
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 170 place count 163 transition count 400
Iterating global reduction 2 with 5 rules applied. Total rules applied 175 place count 163 transition count 400
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 180 place count 158 transition count 390
Iterating global reduction 2 with 5 rules applied. Total rules applied 185 place count 158 transition count 390
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 188 place count 155 transition count 378
Iterating global reduction 2 with 3 rules applied. Total rules applied 191 place count 155 transition count 378
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 193 place count 153 transition count 370
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 153 transition count 370
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 197 place count 151 transition count 366
Iterating global reduction 2 with 2 rules applied. Total rules applied 199 place count 151 transition count 366
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 201 place count 149 transition count 362
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 149 transition count 362
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 205 place count 147 transition count 358
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 147 transition count 358
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 209 place count 145 transition count 354
Iterating global reduction 2 with 2 rules applied. Total rules applied 211 place count 145 transition count 354
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 213 place count 143 transition count 350
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 143 transition count 350
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 227 place count 143 transition count 338
Applied a total of 227 rules in 137 ms. Remains 143 /222 variables (removed 79) and now considering 338/648 (removed 310) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 143/222 places, 338/648 transitions.
Incomplete random walk after 10003 steps, including 12 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :1
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 08:21:05] [INFO ] Flow matrix only has 234 transitions (discarded 104 similar events)
// Phase 1: matrix 234 rows 143 cols
[2023-03-12 08:21:05] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-12 08:21:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 08:21:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 08:21:05] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:21:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 08:21:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 08:21:05] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 08:21:05] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-12 08:21:05] [INFO ] After 50ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 08:21:05] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-12 08:21:05] [INFO ] After 328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 35 ms.
Support contains 10 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 338/338 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 338/338 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :2
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 08:21:05] [INFO ] Flow matrix only has 234 transitions (discarded 104 similar events)
[2023-03-12 08:21:05] [INFO ] Invariant cache hit.
[2023-03-12 08:21:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 08:21:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 08:21:05] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 08:21:05] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-12 08:21:05] [INFO ] After 21ms SMT Verify possible using 52 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:21:05] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:21:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 08:21:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 08:21:06] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:21:06] [INFO ] After 16ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 08:21:06] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-12 08:21:06] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 338/338 transitions.
Graph (complete) has 567 edges and 143 vertex of which 119 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 119 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 114 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 114 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 109 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 109 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 105 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 105 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 101 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 101 transition count 242
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 97 transition count 234
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 97 transition count 234
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 93 transition count 226
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 93 transition count 226
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 105 place count 89 transition count 218
Iterating global reduction 1 with 4 rules applied. Total rules applied 109 place count 89 transition count 218
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 113 place count 85 transition count 210
Iterating global reduction 1 with 4 rules applied. Total rules applied 117 place count 85 transition count 210
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 81 transition count 202
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 81 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 79 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 79 transition count 198
Applied a total of 129 rules in 33 ms. Remains 79 /143 variables (removed 64) and now considering 198/338 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 79/143 places, 198/338 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1541778 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :{}
Probabilistic random walk after 1541778 steps, saw 959577 distinct states, run finished after 3002 ms. (steps per millisecond=513 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 08:21:09] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
// Phase 1: matrix 122 rows 79 cols
[2023-03-12 08:21:09] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-12 08:21:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 08:21:09] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 08:21:09] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-12 08:21:09] [INFO ] After 16ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:21:09] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 08:21:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 08:21:09] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:21:09] [INFO ] After 9ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 08:21:09] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 08:21:09] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 79/79 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-12 08:21:09] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2023-03-12 08:21:09] [INFO ] Invariant cache hit.
[2023-03-12 08:21:09] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 08:21:09] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2023-03-12 08:21:09] [INFO ] Invariant cache hit.
[2023-03-12 08:21:09] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-12 08:21:09] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-12 08:21:09] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-12 08:21:09] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2023-03-12 08:21:09] [INFO ] Invariant cache hit.
[2023-03-12 08:21:09] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 79/79 places, 198/198 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 79 transition count 114
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 92 place count 71 transition count 114
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 92 place count 71 transition count 101
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 118 place count 58 transition count 101
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 148 place count 43 transition count 86
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 155 place count 36 transition count 72
Iterating global reduction 2 with 7 rules applied. Total rules applied 162 place count 36 transition count 72
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 169 place count 29 transition count 58
Iterating global reduction 2 with 7 rules applied. Total rules applied 176 place count 29 transition count 58
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 183 place count 22 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 190 place count 22 transition count 44
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 196 place count 22 transition count 38
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 3 with 2 rules applied. Total rules applied 198 place count 21 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 21 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 200 place count 21 transition count 38
Applied a total of 200 rules in 30 ms. Remains 21 /79 variables (removed 58) and now considering 38/198 (removed 160) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 21 cols
[2023-03-12 08:21:09] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 08:21:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 08:21:09] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 08:21:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 08:21:09] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-12 08:21:09] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 08:21:09] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2023-03-12 08:21:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-12 08:21:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 198 transitions and 806 arcs took 2 ms.
[2023-03-12 08:21:09] [INFO ] Flatten gal took : 43 ms
Total runtime 6643 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_2
(NrP: 79 NrTr: 198 NrArc: 806)

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

net check time: 0m 0.000sec

init dd package: 0m 2.793sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8270020 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103008 kB

BK_TIME_CONFINEMENT_REACHED

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

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

265653

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

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