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.r167-tall-167838853500695.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 lolaxred
Input is FunctionPointer-PT-b032, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853500695
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 7.6K Feb 25 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-b032-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678505623847

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=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b032
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:33:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:33:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:33:45] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-11 03:33:45] [INFO ] Transformed 306 places.
[2023-03-11 03:33:45] [INFO ] Transformed 840 transitions.
[2023-03-11 03:33:45] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 9 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 11) seen :3
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 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 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) 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 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 03:33:46] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-11 03:33:46] [INFO ] Computed 4 place invariants in 22 ms
[2023-03-11 03:33:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-11 03:33:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:33:46] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-11 03:33:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:33:46] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 03:33:46] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-11 03:33:46] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-11 03:33:46] [INFO ] After 135ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2023-03-11 03:33:46] [INFO ] After 311ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-11 03:33:47] [INFO ] After 800ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 205 ms.
Support contains 13 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 212 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 187 transition count 524
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 187 transition count 524
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 93 place count 187 transition count 482
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 107 place count 173 transition count 454
Iterating global reduction 1 with 14 rules applied. Total rules applied 121 place count 173 transition count 454
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 133 place count 173 transition count 442
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 140 place count 166 transition count 428
Iterating global reduction 2 with 7 rules applied. Total rules applied 147 place count 166 transition count 428
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 154 place count 159 transition count 400
Iterating global reduction 2 with 7 rules applied. Total rules applied 161 place count 159 transition count 400
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 168 place count 152 transition count 386
Iterating global reduction 2 with 7 rules applied. Total rules applied 175 place count 152 transition count 386
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 180 place count 147 transition count 366
Iterating global reduction 2 with 5 rules applied. Total rules applied 185 place count 147 transition count 366
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 189 place count 143 transition count 350
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 143 transition count 350
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 197 place count 139 transition count 342
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 139 transition count 342
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 135 transition count 334
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 135 transition count 334
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 212 place count 132 transition count 328
Iterating global reduction 2 with 3 rules applied. Total rules applied 215 place count 132 transition count 328
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 218 place count 129 transition count 322
Iterating global reduction 2 with 3 rules applied. Total rules applied 221 place count 129 transition count 322
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 224 place count 126 transition count 316
Iterating global reduction 2 with 3 rules applied. Total rules applied 227 place count 126 transition count 316
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 235 place count 126 transition count 308
Applied a total of 235 rules in 126 ms. Remains 126 /222 variables (removed 96) and now considering 308/648 (removed 340) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 126/222 places, 308/648 transitions.
Incomplete random walk after 10007 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :1
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 03:33:47] [INFO ] Flow matrix only has 210 transitions (discarded 98 similar events)
// Phase 1: matrix 210 rows 126 cols
[2023-03-11 03:33:47] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 03:33:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:33:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:33:47] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-11 03:33:47] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-11 03:33:47] [INFO ] After 16ms SMT Verify possible using 48 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 03:33:47] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 03:33:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:33:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:33:47] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 03:33:47] [INFO ] After 67ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 03:33:47] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-11 03:33:48] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 22 ms.
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 308/308 transitions.
Applied a total of 0 rules in 11 ms. Remains 126 /126 variables (removed 0) and now considering 308/308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 126/126 places, 308/308 transitions.
Incomplete random walk after 10022 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :2
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:33:48] [INFO ] Flow matrix only has 210 transitions (discarded 98 similar events)
[2023-03-11 03:33:48] [INFO ] Invariant cache hit.
[2023-03-11 03:33:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:33:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:33:48] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 03:33:48] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-11 03:33:48] [INFO ] After 17ms SMT Verify possible using 48 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:33:48] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:33:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:33:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:33:48] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:33:48] [INFO ] After 46ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:33:48] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-11 03:33:48] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 10 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 308/308 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 304
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 10 place count 124 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 294
Applied a total of 14 rules in 21 ms. Remains 122 /126 variables (removed 4) and now considering 294/308 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 122/126 places, 294/308 transitions.
Incomplete random walk after 10002 steps, including 10 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
FORMULA FunctionPointer-PT-b032-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:33:48] [INFO ] Flow matrix only has 200 transitions (discarded 94 similar events)
// Phase 1: matrix 200 rows 122 cols
[2023-03-11 03:33:48] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:33:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:33:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 03:33:48] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 03:33:48] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 03:33:48] [INFO ] After 27ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:33:48] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:33:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:33:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:33:48] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:33:48] [INFO ] After 22ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:33:48] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-11 03:33:48] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 294/294 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 288
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 288
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 120 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 119 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 119 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 118 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 118 transition count 278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 117 transition count 276
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 117 transition count 276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 274
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 274
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 266
Applied a total of 24 rules in 28 ms. Remains 112 /122 variables (removed 10) and now considering 266/294 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 112/122 places, 266/294 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 585721 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 585721 steps, saw 385076 distinct states, run finished after 3008 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:33:52] [INFO ] Flow matrix only has 182 transitions (discarded 84 similar events)
// Phase 1: matrix 182 rows 112 cols
[2023-03-11 03:33:52] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-11 03:33:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:33:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:33:52] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-11 03:33:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:33:52] [INFO ] After 16ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:33:52] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:33:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:33:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:33:52] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:33:52] [INFO ] After 21ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:33:52] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-11 03:33:52] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 112/112 places, 266/266 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 266/266 transitions.
Applied a total of 0 rules in 10 ms. Remains 112 /112 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2023-03-11 03:33:52] [INFO ] Flow matrix only has 182 transitions (discarded 84 similar events)
[2023-03-11 03:33:52] [INFO ] Invariant cache hit.
[2023-03-11 03:33:52] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 03:33:52] [INFO ] Flow matrix only has 182 transitions (discarded 84 similar events)
[2023-03-11 03:33:52] [INFO ] Invariant cache hit.
[2023-03-11 03:33:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 03:33:52] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-11 03:33:52] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-11 03:33:52] [INFO ] Flow matrix only has 182 transitions (discarded 84 similar events)
[2023-03-11 03:33:52] [INFO ] Invariant cache hit.
[2023-03-11 03:33:52] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 112/112 places, 266/266 transitions.
Graph (trivial) has 153 edges and 112 vertex of which 24 / 112 are part of one of the 8 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions removed 40 transitions
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 108 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 96 transition count 151
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 89 transition count 151
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 15 place count 89 transition count 133
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 51 place count 71 transition count 133
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 64 transition count 126
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 64 transition count 126
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 79 place count 64 transition count 112
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 109 place count 49 transition count 97
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 116 place count 42 transition count 83
Iterating global reduction 3 with 7 rules applied. Total rules applied 123 place count 42 transition count 83
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 130 place count 35 transition count 69
Iterating global reduction 3 with 7 rules applied. Total rules applied 137 place count 35 transition count 69
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 144 place count 28 transition count 55
Iterating global reduction 3 with 7 rules applied. Total rules applied 151 place count 28 transition count 55
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 157 place count 28 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 161 place count 26 transition count 50
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 26 transition count 49
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 26 transition count 49
Applied a total of 163 rules in 19 ms. Remains 26 /112 variables (removed 86) and now considering 49/266 (removed 217) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 49 rows 26 cols
[2023-03-11 03:33:52] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:33:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:33:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:33:52] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:33:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:33:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:33:52] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:33:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 03:33:52] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:33:52] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 03:33:52] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:33:52] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-11 03:33:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 266 transitions and 1078 arcs took 3 ms.
[2023-03-11 03:33:52] [INFO ] Flatten gal took : 47 ms
Total runtime 7759 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-b032
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityFireability

FORMULA FunctionPointer-PT-b032-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FunctionPointer-PT-b032-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678505639769

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 0 FunctionPointer-PT-b032-ReachabilityFireability-05
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 0 FunctionPointer-PT-b032-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 0 FunctionPointer-PT-b032-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 9 (type SRCH) for 0 FunctionPointer-PT-b032-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/375/ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 6 (type FNDP) for FunctionPointer-PT-b032-ReachabilityFireability-05
lola: result : true
lola: fired transitions : 240031
lola: tried executions : 5
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 7 (type EQUN) for FunctionPointer-PT-b032-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 9 (type SRCH) for FunctionPointer-PT-b032-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 10 (type EXCL) for FunctionPointer-PT-b032-ReachabilityFireability-05 (obsolete)
lola: LAUNCH task # 16 (type EXCL) for 3 FunctionPointer-PT-b032-ReachabilityFireability-12
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 3 FunctionPointer-PT-b032-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 3 FunctionPointer-PT-b032-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 3 FunctionPointer-PT-b032-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type EQUN) for FunctionPointer-PT-b032-ReachabilityFireability-05
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/375/ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 1761)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b032-ReachabilityFireability-05: EF true findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b032-ReachabilityFireability-12: EF 0 1 4 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 EF FNDP 4/1799 0/5 FunctionPointer-PT-b032-ReachabilityFireability-12 822501 t fired, 1 attempts, .
13 EF STEQ 4/3599 0/5 FunctionPointer-PT-b032-ReachabilityFireability-12 sara is running.
15 EF SRCH 4/3599 2/5 FunctionPointer-PT-b032-ReachabilityFireability-12 582940 m, 116588 m/sec, 900157 t fired, .
16 EF EXCL 4/3599 4/32 FunctionPointer-PT-b032-ReachabilityFireability-12 636066 m, 127213 m/sec, 811525 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 4 of 4 Visible: 2
lola: FINISHED task # 12 (type FNDP) for FunctionPointer-PT-b032-ReachabilityFireability-12
lola: result : true
lola: fired transitions : 1001490
lola: tried executions : 2
lola: time used : 5.000000
lola: memory pages used : 0
lola: CANCELED task # 13 (type EQUN) for FunctionPointer-PT-b032-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 15 (type SRCH) for FunctionPointer-PT-b032-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 16 (type EXCL) for FunctionPointer-PT-b032-ReachabilityFireability-12 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b032-ReachabilityFireability-05: EF true findpath
FunctionPointer-PT-b032-ReachabilityFireability-12: EF true findpath


Time elapsed: 6 secs. Pages in use: 7

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-b032"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is FunctionPointer-PT-b032, 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 r167-tall-167838853500695"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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