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.r169-tall-167838856200662.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 ltsminxred
Input is FunctionPointer-PT-b002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856200662
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 11:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 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-b002-ReachabilityCardinality-00
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-01
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-02
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-03
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-04
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-05
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-06
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-07
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-08
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-09
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-10
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-11
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-12
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-13
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-14
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678606668011

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 07:37:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 07:37:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:37:49] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2023-03-12 07:37:49] [INFO ] Transformed 306 places.
[2023-03-12 07:37:49] [INFO ] Transformed 840 transitions.
[2023-03-12 07:37:49] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 16 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 12) seen :7
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 07:37:50] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-12 07:37:50] [INFO ] Computed 4 place invariants in 17 ms
[2023-03-12 07:37:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 07:37:50] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 07:37:50] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-12 07:37:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 07:37:50] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 07:37:51] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-12 07:37:51] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 07:37:51] [INFO ] After 108ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-12 07:37:51] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-12 07:37:51] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 48 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 200 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 200 transition count 623
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 46 place count 180 transition count 509
Iterating global reduction 1 with 20 rules applied. Total rules applied 66 place count 180 transition count 509
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 94 place count 180 transition count 481
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 103 place count 171 transition count 463
Iterating global reduction 2 with 9 rules applied. Total rules applied 112 place count 171 transition count 463
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 171 transition count 457
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 121 place count 168 transition count 451
Iterating global reduction 3 with 3 rules applied. Total rules applied 124 place count 168 transition count 451
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 166 transition count 443
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 166 transition count 443
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 165 transition count 441
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 165 transition count 441
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 146 place count 165 transition count 425
Applied a total of 146 rules in 133 ms. Remains 165 /222 variables (removed 57) and now considering 425/648 (removed 223) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 165/222 places, 425/648 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) 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 3) seen :1
FORMULA FunctionPointer-PT-b002-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 07:37:51] [INFO ] Flow matrix only has 280 transitions (discarded 145 similar events)
// Phase 1: matrix 280 rows 165 cols
[2023-03-12 07:37:51] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 07:37:51] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 07:37:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 07:37:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 07:37:52] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 07:37:52] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-12 07:37:52] [INFO ] After 55ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 07:37:52] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-12 07:37:52] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 45 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 425/425 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 423
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 164 transition count 417
Applied a total of 8 rules in 24 ms. Remains 164 /165 variables (removed 1) and now considering 417/425 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 164/165 places, 417/425 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 500286 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 500286 steps, saw 311423 distinct states, run finished after 3004 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 07:37:55] [INFO ] Flow matrix only has 276 transitions (discarded 141 similar events)
// Phase 1: matrix 276 rows 164 cols
[2023-03-12 07:37:55] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 07:37:55] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 07:37:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 07:37:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 07:37:55] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 07:37:55] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-12 07:37:55] [INFO ] After 59ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 07:37:55] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-12 07:37:55] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 45 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 417/417 transitions.
Applied a total of 0 rules in 15 ms. Remains 164 /164 variables (removed 0) and now considering 417/417 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 164/164 places, 417/417 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 417/417 transitions.
Applied a total of 0 rules in 11 ms. Remains 164 /164 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-12 07:37:55] [INFO ] Flow matrix only has 276 transitions (discarded 141 similar events)
[2023-03-12 07:37:55] [INFO ] Invariant cache hit.
[2023-03-12 07:37:56] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-12 07:37:56] [INFO ] Flow matrix only has 276 transitions (discarded 141 similar events)
[2023-03-12 07:37:56] [INFO ] Invariant cache hit.
[2023-03-12 07:37:56] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-12 07:37:56] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-12 07:37:56] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-12 07:37:56] [INFO ] Flow matrix only has 276 transitions (discarded 141 similar events)
[2023-03-12 07:37:56] [INFO ] Invariant cache hit.
[2023-03-12 07:37:56] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 634 ms. Remains : 164/164 places, 417/417 transitions.
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 164 transition count 271
Reduce places removed 5 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 11 rules applied. Total rules applied 157 place count 159 transition count 265
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 163 place count 153 transition count 265
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 163 place count 153 transition count 250
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 193 place count 138 transition count 250
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 6 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 229 place count 120 transition count 232
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 236 place count 113 transition count 218
Iterating global reduction 3 with 7 rules applied. Total rules applied 243 place count 113 transition count 218
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 250 place count 106 transition count 204
Iterating global reduction 3 with 7 rules applied. Total rules applied 257 place count 106 transition count 204
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 264 place count 99 transition count 190
Iterating global reduction 3 with 7 rules applied. Total rules applied 271 place count 99 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 276 place count 99 transition count 185
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 284 place count 99 transition count 177
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 285 place count 99 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 286 place count 98 transition count 176
Applied a total of 286 rules in 41 ms. Remains 98 /164 variables (removed 66) and now considering 176/417 (removed 241) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 176 rows 98 cols
[2023-03-12 07:37:56] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 07:37:56] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 07:37:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 07:37:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 07:37:56] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 07:37:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 07:37:56] [INFO ] After 33ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 07:37:56] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-12 07:37:56] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 07:37:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-12 07:37:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 164 places, 417 transitions and 1684 arcs took 4 ms.
[2023-03-12 07:37:57] [INFO ] Flatten gal took : 59 ms
Total runtime 7511 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/488/inv_0_ --invariant=/tmp/488/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 14841576 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098412 kB
Could not compute solution for formula : FunctionPointer-PT-b002-ReachabilityCardinality-05
Could not compute solution for formula : FunctionPointer-PT-b002-ReachabilityCardinality-09

BK_STOP 1678610249406

--------------------
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:
++ 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
++ sed s/.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
mcc2023
rfs formula name FunctionPointer-PT-b002-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/488/inv_0_
rfs formula name FunctionPointer-PT-b002-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/488/inv_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 164 places, 417 transitions and 1684 arcs
pnml2lts-sym: Petri net FuncPointer_2 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 417->376 groups
pnml2lts-sym: Regrouping took 0.110 real 0.100 user 0.000 sys
pnml2lts-sym: state vector length is 164; there are 376 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 494
Killing (9) : 494

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-b002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FunctionPointer-PT-b002, 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 r169-tall-167838856200662"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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