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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 11:53 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.5K 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 5.0K Feb 25 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:59 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-c004-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678623460964

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-c004
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 12:17:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 12:17:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:17:42] [INFO ] Load time of PNML (sax parser for PT used): 326 ms
[2023-03-12 12:17:42] [INFO ] Transformed 2826 places.
[2023-03-12 12:17:42] [INFO ] Transformed 8960 transitions.
[2023-03-12 12:17:42] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 505 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 37 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 10) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) 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 30 ms. (steps per millisecond=333 ) 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 :1
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 12:17:44] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 12:17:44] [INFO ] Computed 4 place invariants in 75 ms
[2023-03-12 12:17:44] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 12:17:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 107 ms returned sat
[2023-03-12 12:17:45] [INFO ] After 777ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 12:17:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 12:17:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 12:17:47] [INFO ] After 1453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 12:17:47] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 12:17:47] [INFO ] After 652ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-03-12 12:17:48] [INFO ] Deduced a trap composed of 135 places in 791 ms of which 7 ms to minimize.
[2023-03-12 12:17:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 960 ms
[2023-03-12 12:17:49] [INFO ] After 2475ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 611 ms.
[2023-03-12 12:17:50] [INFO ] After 5169ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 126 ms.
Support contains 7 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 1419 are kept as prefixes of interest. Removing 209 places using SCC suffix rule.11 ms
Discarding 209 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 1419 transition count 5578
Discarding 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 683 place count 1121 transition count 3306
Iterating global reduction 1 with 298 rules applied. Total rules applied 981 place count 1121 transition count 3306
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 1343 place count 1121 transition count 2944
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1499 place count 965 transition count 2632
Iterating global reduction 2 with 156 rules applied. Total rules applied 1655 place count 965 transition count 2632
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1723 place count 965 transition count 2564
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1737 place count 951 transition count 2536
Iterating global reduction 3 with 14 rules applied. Total rules applied 1751 place count 951 transition count 2536
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1765 place count 937 transition count 2508
Iterating global reduction 3 with 14 rules applied. Total rules applied 1779 place count 937 transition count 2508
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1793 place count 923 transition count 2480
Iterating global reduction 3 with 14 rules applied. Total rules applied 1807 place count 923 transition count 2480
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1821 place count 909 transition count 2452
Iterating global reduction 3 with 14 rules applied. Total rules applied 1835 place count 909 transition count 2452
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1849 place count 895 transition count 2424
Iterating global reduction 3 with 14 rules applied. Total rules applied 1863 place count 895 transition count 2424
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1875 place count 883 transition count 2400
Iterating global reduction 3 with 12 rules applied. Total rules applied 1887 place count 883 transition count 2400
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1898 place count 872 transition count 2378
Iterating global reduction 3 with 11 rules applied. Total rules applied 1909 place count 872 transition count 2378
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 1953 place count 828 transition count 2214
Iterating global reduction 3 with 44 rules applied. Total rules applied 1997 place count 828 transition count 2214
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2053 place count 772 transition count 1990
Iterating global reduction 3 with 56 rules applied. Total rules applied 2109 place count 772 transition count 1990
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2165 place count 716 transition count 1842
Iterating global reduction 3 with 56 rules applied. Total rules applied 2221 place count 716 transition count 1842
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2277 place count 660 transition count 1730
Iterating global reduction 3 with 56 rules applied. Total rules applied 2333 place count 660 transition count 1730
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2389 place count 604 transition count 1618
Iterating global reduction 3 with 56 rules applied. Total rules applied 2445 place count 604 transition count 1618
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2501 place count 548 transition count 1506
Iterating global reduction 3 with 56 rules applied. Total rules applied 2557 place count 548 transition count 1506
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2613 place count 492 transition count 1394
Iterating global reduction 3 with 56 rules applied. Total rules applied 2669 place count 492 transition count 1394
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2687 place count 474 transition count 1358
Iterating global reduction 3 with 18 rules applied. Total rules applied 2705 place count 474 transition count 1358
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 2721 place count 474 transition count 1342
Applied a total of 2721 rules in 1197 ms. Remains 474 /1628 variables (removed 1154) and now considering 1342/5962 (removed 4620) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1198 ms. Remains : 474/1628 places, 1342/5962 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
[2023-03-12 12:17:51] [INFO ] Flow matrix only has 774 transitions (discarded 568 similar events)
// Phase 1: matrix 774 rows 474 cols
[2023-03-12 12:17:51] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-12 12:17:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 12:17:51] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 12:17:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 12:17:52] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 12:17:52] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-12 12:17:52] [INFO ] After 121ms SMT Verify possible using 93 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 12:17:52] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 2 ms to minimize.
[2023-03-12 12:17:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-12 12:17:52] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-12 12:17:52] [INFO ] After 884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1342/1342 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 472 transition count 1338
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 472 transition count 1338
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 472 transition count 1334
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 470 transition count 1330
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 470 transition count 1330
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 468 transition count 1326
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 468 transition count 1326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 464 transition count 1310
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 464 transition count 1310
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 460 transition count 1302
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 460 transition count 1302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 456 transition count 1294
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 456 transition count 1294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 452 transition count 1286
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 452 transition count 1286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 448 transition count 1278
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 448 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 444 transition count 1270
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 444 transition count 1270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 440 transition count 1262
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 440 transition count 1262
Applied a total of 72 rules in 154 ms. Remains 440 /474 variables (removed 34) and now considering 1262/1342 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 440/474 places, 1262/1342 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 273871 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273871 steps, saw 167948 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 12:17:56] [INFO ] Flow matrix only has 718 transitions (discarded 544 similar events)
// Phase 1: matrix 718 rows 440 cols
[2023-03-12 12:17:56] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-12 12:17:56] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 12:17:56] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 12:17:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 12:17:56] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 12:17:56] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-12 12:17:56] [INFO ] After 144ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 12:17:56] [INFO ] Deduced a trap composed of 131 places in 181 ms of which 1 ms to minimize.
[2023-03-12 12:17:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-12 12:17:57] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-12 12:17:57] [INFO ] After 874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1262/1262 transitions.
Applied a total of 0 rules in 53 ms. Remains 440 /440 variables (removed 0) and now considering 1262/1262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 440/440 places, 1262/1262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 1262/1262 transitions.
Applied a total of 0 rules in 45 ms. Remains 440 /440 variables (removed 0) and now considering 1262/1262 (removed 0) transitions.
[2023-03-12 12:17:57] [INFO ] Flow matrix only has 718 transitions (discarded 544 similar events)
[2023-03-12 12:17:57] [INFO ] Invariant cache hit.
[2023-03-12 12:17:57] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-12 12:17:57] [INFO ] Flow matrix only has 718 transitions (discarded 544 similar events)
[2023-03-12 12:17:57] [INFO ] Invariant cache hit.
[2023-03-12 12:17:57] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-12 12:17:58] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
[2023-03-12 12:17:58] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-12 12:17:58] [INFO ] Flow matrix only has 718 transitions (discarded 544 similar events)
[2023-03-12 12:17:58] [INFO ] Invariant cache hit.
[2023-03-12 12:17:59] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1896 ms. Remains : 440/440 places, 1262/1262 transitions.
Ensure Unique test removed 544 transitions
Reduce isomorphic transitions removed 544 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 553 rules applied. Total rules applied 553 place count 440 transition count 709
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 562 place count 431 transition count 709
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 562 place count 431 transition count 632
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 716 place count 354 transition count 632
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 976 place count 224 transition count 502
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1039 place count 161 transition count 376
Iterating global reduction 2 with 63 rules applied. Total rules applied 1102 place count 161 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1103 place count 161 transition count 375
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1165 place count 99 transition count 251
Iterating global reduction 3 with 62 rules applied. Total rules applied 1227 place count 99 transition count 251
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1289 place count 37 transition count 127
Iterating global reduction 3 with 62 rules applied. Total rules applied 1351 place count 37 transition count 127
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1413 place count 37 transition count 65
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 4 with 2 rules applied. Total rules applied 1415 place count 36 transition count 64
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1421 place count 33 transition count 65
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1425 place count 33 transition count 61
Applied a total of 1425 rules in 50 ms. Remains 33 /440 variables (removed 407) and now considering 61/1262 (removed 1201) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 61 rows 33 cols
[2023-03-12 12:17:59] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 12:17:59] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 12:17:59] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 12:17:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 12:17:59] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 12:17:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 12:17:59] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 12:17:59] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 12:17:59] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 12:17:59] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-12 12:17:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 440 places, 1262 transitions and 5174 arcs took 7 ms.
[2023-03-12 12:17:59] [INFO ] Flatten gal took : 104 ms
Total runtime 17147 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_3
(NrP: 440 NrTr: 1262 NrArc: 5174)

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

net check time: 0m 0.000sec

init dd package: 0m 2.734sec

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

11434 40469 83330 110404 171416 174606 221180

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

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