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

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678609193025

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-b032
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 08:19:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 08:19:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:19:54] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-12 08:19:54] [INFO ] Transformed 306 places.
[2023-03-12 08:19:54] [INFO ] Transformed 840 transitions.
[2023-03-12 08:19:54] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 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-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 8 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 11) seen :3
FORMULA FunctionPointer-PT-b032-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b032-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b032-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-b032-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-b032-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 08:19:55] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-12 08:19:55] [INFO ] Computed 4 place invariants in 17 ms
[2023-03-12 08:19:55] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 08:19:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 08:19:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 08:19:56] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-12 08:19:56] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 08:19:56] [INFO ] After 91ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-12 08:19:56] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-12 08:19:56] [INFO ] After 660ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA FunctionPointer-PT-b032-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 111 ms.
Support contains 27 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 194 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 194 transition count 610
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 60 place count 173 transition count 478
Iterating global reduction 1 with 21 rules applied. Total rules applied 81 place count 173 transition count 478
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 111 place count 173 transition count 448
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 120 place count 164 transition count 430
Iterating global reduction 2 with 9 rules applied. Total rules applied 129 place count 164 transition count 430
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 161 transition count 424
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 161 transition count 424
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 159 transition count 416
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 159 transition count 416
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 157 transition count 412
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 157 transition count 412
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 156 transition count 408
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 156 transition count 408
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 155 transition count 404
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 155 transition count 404
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 161 place count 155 transition count 390
Applied a total of 161 rules in 111 ms. Remains 155 /222 variables (removed 67) and now considering 390/648 (removed 258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 155/222 places, 390/648 transitions.
Incomplete random walk after 10018 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=115 ) properties (out of 5) seen :1
FORMULA FunctionPointer-PT-b032-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 08:19:56] [INFO ] Flow matrix only has 257 transitions (discarded 133 similar events)
// Phase 1: matrix 257 rows 155 cols
[2023-03-12 08:19:56] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 08:19:56] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 08:19:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 08:19:57] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 08:19:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 08:19:57] [INFO ] After 51ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 08:19:57] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-12 08:19:57] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 26 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 390/390 transitions.
Applied a total of 0 rules in 11 ms. Remains 155 /155 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 155/155 places, 390/390 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :1
FORMULA FunctionPointer-PT-b032-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 08:19:57] [INFO ] Flow matrix only has 257 transitions (discarded 133 similar events)
[2023-03-12 08:19:57] [INFO ] Invariant cache hit.
[2023-03-12 08:19:57] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:19:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 08:19:57] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 08:19:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 08:19:57] [INFO ] After 39ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 08:19:57] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-12 08:19:57] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 43 ms.
Support contains 25 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 390/390 transitions.
Applied a total of 0 rules in 11 ms. Remains 155 /155 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 155/155 places, 390/390 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 394594 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 394594 steps, saw 251353 distinct states, run finished after 3005 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 08:20:00] [INFO ] Flow matrix only has 257 transitions (discarded 133 similar events)
[2023-03-12 08:20:00] [INFO ] Invariant cache hit.
[2023-03-12 08:20:01] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:20:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 08:20:01] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 08:20:01] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 08:20:01] [INFO ] After 42ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 08:20:01] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-12 08:20:01] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 44 ms.
Support contains 25 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 390/390 transitions.
Applied a total of 0 rules in 10 ms. Remains 155 /155 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 155/155 places, 390/390 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 390/390 transitions.
Applied a total of 0 rules in 13 ms. Remains 155 /155 variables (removed 0) and now considering 390/390 (removed 0) transitions.
[2023-03-12 08:20:01] [INFO ] Flow matrix only has 257 transitions (discarded 133 similar events)
[2023-03-12 08:20:01] [INFO ] Invariant cache hit.
[2023-03-12 08:20:01] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-12 08:20:01] [INFO ] Flow matrix only has 257 transitions (discarded 133 similar events)
[2023-03-12 08:20:01] [INFO ] Invariant cache hit.
[2023-03-12 08:20:01] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-12 08:20:01] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-12 08:20:01] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 08:20:01] [INFO ] Flow matrix only has 257 transitions (discarded 133 similar events)
[2023-03-12 08:20:01] [INFO ] Invariant cache hit.
[2023-03-12 08:20:01] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 505 ms. Remains : 155/155 places, 390/390 transitions.
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 155 transition count 246
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 157 place count 144 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 159 place count 142 transition count 244
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 159 place count 142 transition count 220
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 207 place count 118 transition count 220
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 239 place count 102 transition count 204
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 243 place count 98 transition count 196
Iterating global reduction 3 with 4 rules applied. Total rules applied 247 place count 98 transition count 196
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 250 place count 95 transition count 190
Iterating global reduction 3 with 3 rules applied. Total rules applied 253 place count 95 transition count 190
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 256 place count 92 transition count 184
Iterating global reduction 3 with 3 rules applied. Total rules applied 259 place count 92 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 261 place count 92 transition count 182
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 271 place count 87 transition count 184
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 280 place count 87 transition count 175
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 281 place count 86 transition count 174
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 86 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 284 place count 86 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 286 place count 85 transition count 171
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 289 place count 85 transition count 168
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 292 place count 82 transition count 168
Applied a total of 292 rules in 66 ms. Remains 82 /155 variables (removed 73) and now considering 168/390 (removed 222) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 168 rows 82 cols
[2023-03-12 08:20:01] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 08:20:01] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:20:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 08:20:02] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 08:20:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 08:20:02] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 08:20:02] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-12 08:20:02] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 08:20:02] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-12 08:20:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 155 places, 390 transitions and 1576 arcs took 3 ms.
[2023-03-12 08:20:02] [INFO ] Flatten gal took : 55 ms
Total runtime 7800 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: 155 NrTr: 390 NrArc: 1576)

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

net check time: 0m 0.000sec

init dd package: 0m 2.786sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9022028 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101348 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.003sec

72166 109497 150032 157781

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="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-b032, 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-167838857600694"
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 [ "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 ;