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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K 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-b128-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678616271037

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-b128
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 10:17:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 10:17:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:17:52] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-12 10:17:52] [INFO ] Transformed 306 places.
[2023-03-12 10:17:52] [INFO ] Transformed 840 transitions.
[2023-03-12 10:17:52] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.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-b128-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10023 steps, including 5 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 12) seen :2
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 10:17:53] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-12 10:17:53] [INFO ] Computed 4 place invariants in 22 ms
[2023-03-12 10:17:53] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 10:17:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 10:17:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 10:17:53] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-12 10:17:53] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 10:17:53] [INFO ] After 135ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-12 10:17:54] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-12 10:17:54] [INFO ] After 895ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1315 ms.
Support contains 43 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 193 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.2 ms
Discarding 29 places :
Also discarding 0 output transitions
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 193 transition count 605
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 65 place count 172 transition count 475
Iterating global reduction 1 with 21 rules applied. Total rules applied 86 place count 172 transition count 475
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 116 place count 172 transition count 445
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 124 place count 164 transition count 429
Iterating global reduction 2 with 8 rules applied. Total rules applied 132 place count 164 transition count 429
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 160 transition count 421
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 160 transition count 421
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 157 transition count 409
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 157 transition count 409
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 162 place count 157 transition count 393
Applied a total of 162 rules in 91 ms. Remains 157 /222 variables (removed 65) and now considering 393/648 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 157/222 places, 393/648 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 10:17:56] [INFO ] Flow matrix only has 256 transitions (discarded 137 similar events)
// Phase 1: matrix 256 rows 157 cols
[2023-03-12 10:17:56] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-12 10:17:56] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 10:17:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 10:17:56] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 10:17:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:17:56] [INFO ] After 76ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 10:17:56] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-12 10:17:56] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 93 ms.
Support contains 34 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 393/393 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 155 transition count 387
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 155 transition count 387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 154 transition count 385
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 154 transition count 385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 153 transition count 381
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 153 transition count 381
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 152 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 152 transition count 379
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 151 transition count 377
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 151 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 150 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 150 transition count 375
Applied a total of 14 rules in 41 ms. Remains 150 /157 variables (removed 7) and now considering 375/393 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 150/157 places, 375/393 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 262241 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262241 steps, saw 190334 distinct states, run finished after 3002 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 10:17:59] [INFO ] Flow matrix only has 245 transitions (discarded 130 similar events)
// Phase 1: matrix 245 rows 150 cols
[2023-03-12 10:17:59] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-12 10:17:59] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 10:17:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 10:18:00] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 10:18:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-12 10:18:00] [INFO ] After 75ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 10:18:00] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-12 10:18:00] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 618 ms.
Support contains 34 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 375/375 transitions.
Applied a total of 0 rules in 15 ms. Remains 150 /150 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 150/150 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 375/375 transitions.
Applied a total of 0 rules in 12 ms. Remains 150 /150 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2023-03-12 10:18:00] [INFO ] Flow matrix only has 245 transitions (discarded 130 similar events)
[2023-03-12 10:18:00] [INFO ] Invariant cache hit.
[2023-03-12 10:18:01] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 10:18:01] [INFO ] Flow matrix only has 245 transitions (discarded 130 similar events)
[2023-03-12 10:18:01] [INFO ] Invariant cache hit.
[2023-03-12 10:18:01] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-12 10:18:01] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-12 10:18:01] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-12 10:18:01] [INFO ] Flow matrix only has 245 transitions (discarded 130 similar events)
[2023-03-12 10:18:01] [INFO ] Invariant cache hit.
[2023-03-12 10:18:01] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 465 ms. Remains : 150/150 places, 375/375 transitions.
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 150 transition count 235
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 150 place count 140 transition count 235
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 150 place count 140 transition count 209
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 202 place count 114 transition count 209
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 224 place count 103 transition count 198
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 229 place count 98 transition count 188
Iterating global reduction 2 with 5 rules applied. Total rules applied 234 place count 98 transition count 188
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 239 place count 93 transition count 178
Iterating global reduction 2 with 5 rules applied. Total rules applied 244 place count 93 transition count 178
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 247 place count 90 transition count 172
Iterating global reduction 2 with 3 rules applied. Total rules applied 250 place count 90 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 258 place count 86 transition count 175
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 263 place count 86 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 264 place count 85 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 85 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 267 place count 85 transition count 167
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 268 place count 85 transition count 167
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 269 place count 85 transition count 166
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 270 place count 85 transition count 166
Applied a total of 270 rules in 43 ms. Remains 85 /150 variables (removed 65) and now considering 166/375 (removed 209) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 166 rows 85 cols
[2023-03-12 10:18:01] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-12 10:18:01] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 10:18:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 10:18:01] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 10:18:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:18:01] [INFO ] After 40ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 10:18:01] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-12 10:18:01] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-12 10:18:01] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-12 10:18:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 150 places, 375 transitions and 1514 arcs took 3 ms.
[2023-03-12 10:18:01] [INFO ] Flatten gal took : 54 ms
Total runtime 9538 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: 150 NrTr: 375 NrArc: 1514)

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

net check time: 0m 0.000sec

init dd package: 0m 2.706sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4031476 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101616 kB

BK_TIME_CONFINEMENT_REACHED

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

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

26695 41783 69099 84158 89628 101402

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

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