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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 6.3K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 11K Feb 25 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 25 11:55 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-b064-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678612763939

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b064
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 09:19:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 09:19:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:19:25] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-12 09:19:25] [INFO ] Transformed 306 places.
[2023-03-12 09:19:25] [INFO ] Transformed 840 transitions.
[2023-03-12 09:19:25] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 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-b064-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10024 steps, including 6 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 9) seen :4
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 09:19:26] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-12 09:19:26] [INFO ] Computed 4 place invariants in 24 ms
[2023-03-12 09:19:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 09:19:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 09:19:26] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-12 09:19:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 09:19:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 09:19:26] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-12 09:19:26] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 09:19:26] [INFO ] After 107ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-12 09:19:26] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-12 09:19:26] [INFO ] After 630ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 233 ms.
Support contains 29 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 198 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 198 transition count 617
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 55 place count 175 transition count 483
Iterating global reduction 1 with 23 rules applied. Total rules applied 78 place count 175 transition count 483
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 112 place count 175 transition count 449
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 120 place count 167 transition count 433
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 167 transition count 433
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 132 place count 163 transition count 425
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 163 transition count 425
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 140 place count 159 transition count 409
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 159 transition count 409
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 148 place count 155 transition count 401
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 155 transition count 401
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 154 place count 153 transition count 393
Iterating global reduction 2 with 2 rules applied. Total rules applied 156 place count 153 transition count 393
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 151 transition count 385
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 151 transition count 385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 150 transition count 383
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 150 transition count 383
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 163 place count 149 transition count 381
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 149 transition count 381
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 148 transition count 379
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 148 transition count 379
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 147 transition count 377
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 147 transition count 377
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 146 transition count 375
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 146 transition count 375
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 182 place count 146 transition count 363
Applied a total of 182 rules in 130 ms. Remains 146 /222 variables (removed 76) and now considering 363/648 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 146/222 places, 363/648 transitions.
Incomplete random walk after 10045 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=122 ) properties (out of 4) seen :1
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:19:27] [INFO ] Flow matrix only has 241 transitions (discarded 122 similar events)
// Phase 1: matrix 241 rows 146 cols
[2023-03-12 09:19:27] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 09:19:27] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:19:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 09:19:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 09:19:27] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:19:27] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 09:19:27] [INFO ] After 28ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:19:27] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-12 09:19:27] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 64 ms.
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 363/363 transitions.
Graph (complete) has 596 edges and 146 vertex of which 142 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 142 transition count 357
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 15 place count 134 transition count 333
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 134 transition count 333
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 29 place count 134 transition count 327
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 35 place count 128 transition count 315
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 128 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 128 transition count 311
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 125 transition count 301
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 125 transition count 301
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 54 place count 122 transition count 295
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 122 transition count 295
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 60 place count 119 transition count 287
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 119 transition count 287
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 65 place count 117 transition count 283
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 117 transition count 283
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 115 transition count 279
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 115 transition count 279
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 113 transition count 275
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 113 transition count 275
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 111 transition count 271
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 111 transition count 271
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 110 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 110 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 109 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 109 transition count 267
Applied a total of 83 rules in 39 ms. Remains 109 /146 variables (removed 37) and now considering 267/363 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 109/146 places, 267/363 transitions.
Incomplete random walk after 10016 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :1
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 09:19:27] [INFO ] Flow matrix only has 175 transitions (discarded 92 similar events)
// Phase 1: matrix 175 rows 109 cols
[2023-03-12 09:19:27] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 09:19:27] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 09:19:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 09:19:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 09:19:28] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:19:28] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-12 09:19:28] [INFO ] After 18ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 09:19:28] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-12 09:19:28] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 267/267 transitions.
Graph (complete) has 457 edges and 109 vertex of which 106 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 106 transition count 262
Applied a total of 6 rules in 6 ms. Remains 106 /109 variables (removed 3) and now considering 262/267 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 106/109 places, 262/267 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 493223 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 493223 steps, saw 307025 distinct states, run finished after 3002 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 09:19:31] [INFO ] Flow matrix only has 170 transitions (discarded 92 similar events)
// Phase 1: matrix 170 rows 106 cols
[2023-03-12 09:19:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 09:19:31] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 09:19:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 09:19:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:19:31] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:19:31] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-12 09:19:31] [INFO ] After 26ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 09:19:31] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 09:19:31] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 262/262 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 106/106 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 262/262 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-12 09:19:31] [INFO ] Flow matrix only has 170 transitions (discarded 92 similar events)
[2023-03-12 09:19:31] [INFO ] Invariant cache hit.
[2023-03-12 09:19:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-12 09:19:31] [INFO ] Flow matrix only has 170 transitions (discarded 92 similar events)
[2023-03-12 09:19:31] [INFO ] Invariant cache hit.
[2023-03-12 09:19:31] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-12 09:19:31] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-12 09:19:31] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-12 09:19:31] [INFO ] Flow matrix only has 170 transitions (discarded 92 similar events)
[2023-03-12 09:19:31] [INFO ] Invariant cache hit.
[2023-03-12 09:19:31] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 106/106 places, 262/262 transitions.
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 106 transition count 161
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 111 place count 97 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 96 transition count 160
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 112 place count 96 transition count 137
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 158 place count 73 transition count 137
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 190 place count 57 transition count 121
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 197 place count 50 transition count 107
Iterating global reduction 3 with 7 rules applied. Total rules applied 204 place count 50 transition count 107
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 211 place count 43 transition count 93
Iterating global reduction 3 with 7 rules applied. Total rules applied 218 place count 43 transition count 93
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 225 place count 36 transition count 79
Iterating global reduction 3 with 7 rules applied. Total rules applied 232 place count 36 transition count 79
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 239 place count 36 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 239 place count 36 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 35 transition count 71
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 247 place count 32 transition count 71
Applied a total of 247 rules in 17 ms. Remains 32 /106 variables (removed 74) and now considering 71/262 (removed 191) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 71 rows 32 cols
[2023-03-12 09:19:31] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 09:19:31] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 09:19:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 09:19:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:19:31] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:19:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 09:19:31] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 09:19:31] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-12 09:19:31] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 09:19:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-12 09:19:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 262 transitions and 1060 arcs took 2 ms.
[2023-03-12 09:19:32] [INFO ] Flatten gal took : 62 ms
Total runtime 6713 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FuncPointer_2
(NrP: 106 NrTr: 262 NrArc: 1060)

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

net check time: 0m 0.000sec

init dd package: 0m 2.715sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7707760 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099796 kB

BK_TIME_CONFINEMENT_REACHED

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

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

7586 197299 236369 244165 253073 542848 432606 424567 435536 675326 568505

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-b064"
export BK_EXAMINATION="ReachabilityCardinality"
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-b064, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857600702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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