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

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

=== Now, execution of the tool begins

BK_START 1678612833958

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b064
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 09:20:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 09:20:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:20:35] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-12 09:20:35] [INFO ] Transformed 306 places.
[2023-03-12 09:20:35] [INFO ] Transformed 840 transitions.
[2023-03-12 09:20:35] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10052 steps, including 5 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 10) seen :2
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-12 09:20:36] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-12 09:20:36] [INFO ] Computed 4 place invariants in 19 ms
[2023-03-12 09:20:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 09:20:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:20:36] [INFO ] After 334ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2023-03-12 09:20:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 09:20:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:20:36] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2023-03-12 09:20:36] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 09:20:37] [INFO ] After 143ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :4 sat :4
[2023-03-12 09:20:37] [INFO ] After 348ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-12 09:20:37] [INFO ] After 811ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 38 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 212 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 25 place count 188 transition count 526
Iterating global reduction 0 with 24 rules applied. Total rules applied 49 place count 188 transition count 526
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 89 place count 188 transition count 486
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 102 place count 175 transition count 460
Iterating global reduction 1 with 13 rules applied. Total rules applied 115 place count 175 transition count 460
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 127 place count 175 transition count 448
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 131 place count 171 transition count 440
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 171 transition count 440
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 169 transition count 432
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 169 transition count 432
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 167 transition count 428
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 167 transition count 428
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 159 place count 167 transition count 412
Applied a total of 159 rules in 114 ms. Remains 167 /222 variables (removed 55) and now considering 412/648 (removed 236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 167/222 places, 412/648 transitions.
Incomplete random walk after 10001 steps, including 8 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :3
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:20:37] [INFO ] Flow matrix only has 283 transitions (discarded 129 similar events)
// Phase 1: matrix 283 rows 167 cols
[2023-03-12 09:20:37] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 09:20:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 09:20:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:20:37] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:20:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 09:20:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:20:38] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:20:38] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 09:20:38] [INFO ] After 94ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:20:38] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-12 09:20:38] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 35 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 412/412 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 166 transition count 410
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 166 transition count 410
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 166 transition count 404
Applied a total of 8 rules in 19 ms. Remains 166 /167 variables (removed 1) and now considering 404/412 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 166/167 places, 404/412 transitions.
Incomplete random walk after 10001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 1313656 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :{}
Probabilistic random walk after 1313656 steps, saw 863620 distinct states, run finished after 3002 ms. (steps per millisecond=437 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:20:41] [INFO ] Flow matrix only has 279 transitions (discarded 125 similar events)
// Phase 1: matrix 279 rows 166 cols
[2023-03-12 09:20:41] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 09:20:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 09:20:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 09:20:41] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:20:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 09:20:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:20:41] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:20:41] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 09:20:41] [INFO ] After 70ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:20:41] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-12 09:20:41] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 35 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 404/404 transitions.
Applied a total of 0 rules in 18 ms. Remains 166 /166 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 166/166 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 404/404 transitions.
Applied a total of 0 rules in 12 ms. Remains 166 /166 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2023-03-12 09:20:41] [INFO ] Flow matrix only has 279 transitions (discarded 125 similar events)
[2023-03-12 09:20:41] [INFO ] Invariant cache hit.
[2023-03-12 09:20:41] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-12 09:20:41] [INFO ] Flow matrix only has 279 transitions (discarded 125 similar events)
[2023-03-12 09:20:41] [INFO ] Invariant cache hit.
[2023-03-12 09:20:42] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 09:20:42] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-12 09:20:42] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-12 09:20:42] [INFO ] Flow matrix only has 279 transitions (discarded 125 similar events)
[2023-03-12 09:20:42] [INFO ] Invariant cache hit.
[2023-03-12 09:20:42] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 166/166 places, 404/404 transitions.
Graph (trivial) has 166 edges and 166 vertex of which 12 / 166 are part of one of the 4 SCC in 2 ms
Free SCC test removed 8 places
Drop transitions removed 20 transitions
Ensure Unique test removed 117 transitions
Reduce isomorphic transitions removed 137 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 9 rules applied. Total rules applied 10 place count 158 transition count 258
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 149 transition count 256
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 147 transition count 256
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 23 place count 147 transition count 229
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 77 place count 120 transition count 229
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 117 transition count 226
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 117 transition count 226
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 89 place count 117 transition count 220
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 115 place count 104 transition count 207
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 120 place count 99 transition count 197
Iterating global reduction 4 with 5 rules applied. Total rules applied 125 place count 99 transition count 197
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 128 place count 96 transition count 191
Iterating global reduction 4 with 3 rules applied. Total rules applied 131 place count 96 transition count 191
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 93 transition count 185
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 93 transition count 185
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 145 place count 89 transition count 185
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 150 place count 89 transition count 180
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 154 place count 89 transition count 176
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 158 place count 85 transition count 176
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 159 place count 85 transition count 175
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 85 transition count 175
Applied a total of 160 rules in 38 ms. Remains 85 /166 variables (removed 81) and now considering 175/404 (removed 229) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 175 rows 85 cols
[2023-03-12 09:20:42] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 09:20:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 09:20:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 09:20:42] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:20:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 09:20:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 09:20:42] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:20:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 09:20:42] [INFO ] After 47ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:20:42] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-12 09:20:42] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:20:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-12 09:20:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 166 places, 404 transitions and 1630 arcs took 6 ms.
[2023-03-12 09:20:43] [INFO ] Flatten gal took : 54 ms
Total runtime 7649 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: FuncPointer_2
(NrP: 166 NrTr: 404 NrArc: 1630)

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

net check time: 0m 0.000sec

init dd package: 0m 2.723sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8498156 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102024 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec

1726545

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="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is FunctionPointer-PT-b064, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857600703"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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