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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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.4K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 12:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4.2M 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-c002-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-c002-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678619885963

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-c002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 11:18:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 11:18:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:18:07] [INFO ] Load time of PNML (sax parser for PT used): 350 ms
[2023-03-12 11:18:07] [INFO ] Transformed 2826 places.
[2023-03-12 11:18:07] [INFO ] Transformed 8960 transitions.
[2023-03-12 11:18:08] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 629 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 29 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10003 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=16 ) properties (out of 13) seen :2
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :1
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :1
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-12 11:18:09] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 11:18:09] [INFO ] Computed 4 place invariants in 98 ms
[2023-03-12 11:18:10] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-12 11:18:10] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 11:18:11] [INFO ] After 2370ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-12 11:18:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 11:18:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 11:18:14] [INFO ] After 2240ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-12 11:18:14] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 11:18:16] [INFO ] After 1922ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-12 11:18:17] [INFO ] Deduced a trap composed of 131 places in 891 ms of which 8 ms to minimize.
[2023-03-12 11:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1079 ms
[2023-03-12 11:18:19] [INFO ] After 4507ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 874 ms.
[2023-03-12 11:18:20] [INFO ] After 8243ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA FunctionPointer-PT-c002-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 41 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.14 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 284 places :
Symmetric choice reduction at 0 with 284 rule applications. Total rules 285 place count 1327 transition count 3842
Iterating global reduction 0 with 284 rules applied. Total rules applied 569 place count 1327 transition count 3842
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Iterating post reduction 0 with 432 rules applied. Total rules applied 1001 place count 1327 transition count 3410
Discarding 142 places :
Symmetric choice reduction at 1 with 142 rule applications. Total rules 1143 place count 1185 transition count 3126
Iterating global reduction 1 with 142 rules applied. Total rules applied 1285 place count 1185 transition count 3126
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 1381 place count 1185 transition count 3030
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1393 place count 1173 transition count 3006
Iterating global reduction 2 with 12 rules applied. Total rules applied 1405 place count 1173 transition count 3006
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1416 place count 1162 transition count 2984
Iterating global reduction 2 with 11 rules applied. Total rules applied 1427 place count 1162 transition count 2984
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1438 place count 1151 transition count 2962
Iterating global reduction 2 with 11 rules applied. Total rules applied 1449 place count 1151 transition count 2962
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1460 place count 1140 transition count 2940
Iterating global reduction 2 with 11 rules applied. Total rules applied 1471 place count 1140 transition count 2940
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1482 place count 1129 transition count 2918
Iterating global reduction 2 with 11 rules applied. Total rules applied 1493 place count 1129 transition count 2918
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1504 place count 1118 transition count 2896
Iterating global reduction 2 with 11 rules applied. Total rules applied 1515 place count 1118 transition count 2896
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1523 place count 1110 transition count 2880
Iterating global reduction 2 with 8 rules applied. Total rules applied 1531 place count 1110 transition count 2880
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 1562 place count 1079 transition count 2762
Iterating global reduction 2 with 31 rules applied. Total rules applied 1593 place count 1079 transition count 2762
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 1627 place count 1045 transition count 2626
Iterating global reduction 2 with 34 rules applied. Total rules applied 1661 place count 1045 transition count 2626
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 1695 place count 1011 transition count 2544
Iterating global reduction 2 with 34 rules applied. Total rules applied 1729 place count 1011 transition count 2544
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 1762 place count 978 transition count 2478
Iterating global reduction 2 with 33 rules applied. Total rules applied 1795 place count 978 transition count 2478
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 1828 place count 945 transition count 2412
Iterating global reduction 2 with 33 rules applied. Total rules applied 1861 place count 945 transition count 2412
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 1894 place count 912 transition count 2346
Iterating global reduction 2 with 33 rules applied. Total rules applied 1927 place count 912 transition count 2346
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 1959 place count 880 transition count 2282
Iterating global reduction 2 with 32 rules applied. Total rules applied 1991 place count 880 transition count 2282
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1998 place count 873 transition count 2268
Iterating global reduction 2 with 7 rules applied. Total rules applied 2005 place count 873 transition count 2268
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 2 with 60 rules applied. Total rules applied 2065 place count 873 transition count 2208
Applied a total of 2065 rules in 1615 ms. Remains 873 /1628 variables (removed 755) and now considering 2208/5962 (removed 3754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1616 ms. Remains : 873/1628 places, 2208/5962 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 179121 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179121 steps, saw 116279 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-12 11:18:25] [INFO ] Flow matrix only has 1495 transitions (discarded 713 similar events)
// Phase 1: matrix 1495 rows 873 cols
[2023-03-12 11:18:25] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-12 11:18:25] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 11:18:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:18:26] [INFO ] After 1255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 11:18:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 11:18:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-12 11:18:28] [INFO ] After 1861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 11:18:28] [INFO ] State equation strengthened by 358 read => feed constraints.
[2023-03-12 11:18:30] [INFO ] After 1432ms SMT Verify possible using 358 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-12 11:18:30] [INFO ] Deduced a trap composed of 131 places in 202 ms of which 2 ms to minimize.
[2023-03-12 11:18:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-12 11:18:32] [INFO ] After 3257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1227 ms.
[2023-03-12 11:18:33] [INFO ] After 6680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 28 ms.
Support contains 41 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 2208/2208 transitions.
Applied a total of 0 rules in 146 ms. Remains 873 /873 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 873/873 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 2208/2208 transitions.
Applied a total of 0 rules in 139 ms. Remains 873 /873 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2023-03-12 11:18:33] [INFO ] Flow matrix only has 1495 transitions (discarded 713 similar events)
[2023-03-12 11:18:33] [INFO ] Invariant cache hit.
[2023-03-12 11:18:34] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-12 11:18:34] [INFO ] Flow matrix only has 1495 transitions (discarded 713 similar events)
[2023-03-12 11:18:34] [INFO ] Invariant cache hit.
[2023-03-12 11:18:34] [INFO ] State equation strengthened by 358 read => feed constraints.
[2023-03-12 11:18:36] [INFO ] Implicit Places using invariants and state equation in 2419 ms returned []
Implicit Place search using SMT with State Equation took 2858 ms to find 0 implicit places.
[2023-03-12 11:18:36] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-12 11:18:36] [INFO ] Flow matrix only has 1495 transitions (discarded 713 similar events)
[2023-03-12 11:18:36] [INFO ] Invariant cache hit.
[2023-03-12 11:18:37] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3883 ms. Remains : 873/873 places, 2208/2208 transitions.
Graph (trivial) has 1282 edges and 873 vertex of which 177 / 873 are part of one of the 59 SCC in 4 ms
Free SCC test removed 118 places
Drop transitions removed 295 transitions
Ensure Unique test removed 595 transitions
Reduce isomorphic transitions removed 890 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 755 transition count 1278
Reduce places removed 40 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 715 transition count 1276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 713 transition count 1276
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 85 place count 713 transition count 1121
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 395 place count 558 transition count 1121
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 453 place count 500 transition count 1063
Iterating global reduction 3 with 58 rules applied. Total rules applied 511 place count 500 transition count 1063
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 3 with 116 rules applied. Total rules applied 627 place count 500 transition count 947
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 4 with 276 rules applied. Total rules applied 903 place count 362 transition count 809
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 965 place count 300 transition count 685
Iterating global reduction 4 with 62 rules applied. Total rules applied 1027 place count 300 transition count 685
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1029 place count 300 transition count 683
Discarding 59 places :
Symmetric choice reduction at 5 with 59 rule applications. Total rules 1088 place count 241 transition count 565
Iterating global reduction 5 with 59 rules applied. Total rules applied 1147 place count 241 transition count 565
Discarding 59 places :
Symmetric choice reduction at 5 with 59 rule applications. Total rules 1206 place count 182 transition count 447
Iterating global reduction 5 with 59 rules applied. Total rules applied 1265 place count 182 transition count 447
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 5 with 57 rules applied. Total rules applied 1322 place count 182 transition count 390
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1324 place count 181 transition count 389
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 1372 place count 157 transition count 398
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 1396 place count 157 transition count 374
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1397 place count 156 transition count 373
Iterating global reduction 6 with 1 rules applied. Total rules applied 1398 place count 156 transition count 373
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1400 place count 156 transition count 371
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1402 place count 156 transition count 369
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1404 place count 154 transition count 369
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1406 place count 154 transition count 369
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1408 place count 154 transition count 367
Applied a total of 1408 rules in 148 ms. Remains 154 /873 variables (removed 719) and now considering 367/2208 (removed 1841) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 367 rows 154 cols
[2023-03-12 11:18:37] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 11:18:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 11:18:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 11:18:37] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 11:18:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 11:18:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 11:18:38] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 11:18:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 11:18:38] [INFO ] After 203ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-12 11:18:38] [INFO ] After 468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-12 11:18:38] [INFO ] After 1043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-12 11:18:38] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-12 11:18:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 873 places, 2208 transitions and 8958 arcs took 12 ms.
[2023-03-12 11:18:39] [INFO ] Flatten gal took : 171 ms
Total runtime 31979 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_3
(NrP: 873 NrTr: 2208 NrArc: 8958)

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

net check time: 0m 0.006sec

init dd package: 0m 2.781sec

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

5729 12451 19623 32195 41017 49839 58661 67483 76305 85127 76886 102771 111593 120415 129237 138059 146881 155703 133772 140911 148050 155189 162326 169465 216921

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

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