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-167838856200684.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-b016, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856200684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678614397467

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b016
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 09:46:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 09:46:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:46:39] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-12 09:46:39] [INFO ] Transformed 306 places.
[2023-03-12 09:46:39] [INFO ] Transformed 840 transitions.
[2023-03-12 09:46:39] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b016-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 35 place count 187 transition count 534
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 187 transition count 534
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 187 transition count 476
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 129 place count 176 transition count 454
Iterating global reduction 2 with 11 rules applied. Total rules applied 140 place count 176 transition count 454
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 156 place count 176 transition count 438
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 161 place count 171 transition count 428
Iterating global reduction 3 with 5 rules applied. Total rules applied 166 place count 171 transition count 428
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 168 transition count 416
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 168 transition count 416
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 175 place count 165 transition count 410
Iterating global reduction 3 with 3 rules applied. Total rules applied 178 place count 165 transition count 410
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 163 transition count 402
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 163 transition count 402
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 161 transition count 394
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 161 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 159 transition count 390
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 159 transition count 390
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 157 transition count 386
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 157 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 196 place count 155 transition count 382
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 155 transition count 382
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 200 place count 153 transition count 378
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 153 transition count 378
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 204 place count 151 transition count 374
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 151 transition count 374
Applied a total of 206 rules in 97 ms. Remains 151 /222 variables (removed 71) and now considering 374/648 (removed 274) transitions.
[2023-03-12 09:46:39] [INFO ] Flow matrix only has 254 transitions (discarded 120 similar events)
// Phase 1: matrix 254 rows 151 cols
[2023-03-12 09:46:39] [INFO ] Computed 2 place invariants in 22 ms
[2023-03-12 09:46:39] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-12 09:46:39] [INFO ] Flow matrix only has 254 transitions (discarded 120 similar events)
[2023-03-12 09:46:39] [INFO ] Invariant cache hit.
[2023-03-12 09:46:40] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-12 09:46:40] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2023-03-12 09:46:40] [INFO ] Flow matrix only has 254 transitions (discarded 120 similar events)
[2023-03-12 09:46:40] [INFO ] Invariant cache hit.
[2023-03-12 09:46:40] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/222 places, 374/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 912 ms. Remains : 151/222 places, 374/648 transitions.
Support contains 21 out of 151 places after structural reductions.
[2023-03-12 09:46:40] [INFO ] Flatten gal took : 114 ms
[2023-03-12 09:46:40] [INFO ] Flatten gal took : 29 ms
[2023-03-12 09:46:40] [INFO ] Input system was already deterministic with 374 transitions.
Support contains 20 out of 151 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 17) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:46:41] [INFO ] Flow matrix only has 254 transitions (discarded 120 similar events)
[2023-03-12 09:46:41] [INFO ] Invariant cache hit.
[2023-03-12 09:46:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 09:46:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 09:46:41] [INFO ] After 93ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 09:46:41] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-12 09:46:41] [INFO ] After 34ms SMT Verify possible using 54 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:46:41] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:46:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 09:46:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:46:41] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:46:41] [INFO ] After 81ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:46:42] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-12 09:46:42] [INFO ] After 570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 144 transition count 356
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 144 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 144 transition count 354
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 138 transition count 340
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 138 transition count 340
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 134 transition count 326
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 134 transition count 326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 130 transition count 316
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 130 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 127 transition count 308
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 127 transition count 308
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 124 transition count 300
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 124 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 121 transition count 294
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 121 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 119 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 119 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 117 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 117 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 116 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 116 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 115 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 115 transition count 282
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 115 transition count 276
Applied a total of 80 rules in 100 ms. Remains 115 /151 variables (removed 36) and now considering 276/374 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 115/151 places, 276/374 transitions.
Incomplete random walk after 10011 steps, including 9 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 451653 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 451653 steps, saw 296938 distinct states, run finished after 3003 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:46:45] [INFO ] Flow matrix only has 188 transitions (discarded 88 similar events)
// Phase 1: matrix 188 rows 115 cols
[2023-03-12 09:46:45] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 09:46:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 09:46:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:46:45] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-12 09:46:45] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-12 09:46:45] [INFO ] After 29ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:46:45] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:46:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 09:46:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:46:45] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:46:45] [INFO ] After 30ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:46:45] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-12 09:46:45] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 276/276 transitions.
Applied a total of 0 rules in 9 ms. Remains 115 /115 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 115/115 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 276/276 transitions.
Applied a total of 0 rules in 8 ms. Remains 115 /115 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2023-03-12 09:46:45] [INFO ] Flow matrix only has 188 transitions (discarded 88 similar events)
[2023-03-12 09:46:45] [INFO ] Invariant cache hit.
[2023-03-12 09:46:46] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-12 09:46:46] [INFO ] Flow matrix only has 188 transitions (discarded 88 similar events)
[2023-03-12 09:46:46] [INFO ] Invariant cache hit.
[2023-03-12 09:46:46] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-12 09:46:46] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-12 09:46:46] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-12 09:46:46] [INFO ] Flow matrix only has 188 transitions (discarded 88 similar events)
[2023-03-12 09:46:46] [INFO ] Invariant cache hit.
[2023-03-12 09:46:46] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 676 ms. Remains : 115/115 places, 276/276 transitions.
Graph (trivial) has 165 edges and 115 vertex of which 24 / 115 are part of one of the 8 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions removed 40 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 112 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 99 transition count 158
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 93 transition count 158
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 13 place count 93 transition count 138
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 53 place count 73 transition count 138
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 66 transition count 131
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 66 transition count 131
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 81 place count 66 transition count 117
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 113 place count 50 transition count 101
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 120 place count 43 transition count 87
Iterating global reduction 3 with 7 rules applied. Total rules applied 127 place count 43 transition count 87
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 134 place count 36 transition count 73
Iterating global reduction 3 with 7 rules applied. Total rules applied 141 place count 36 transition count 73
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 148 place count 29 transition count 59
Iterating global reduction 3 with 7 rules applied. Total rules applied 155 place count 29 transition count 59
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 162 place count 29 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 162 place count 29 transition count 51
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 164 place count 28 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
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 170 place count 25 transition count 51
Applied a total of 170 rules in 28 ms. Remains 25 /115 variables (removed 90) and now considering 51/276 (removed 225) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 51 rows 25 cols
[2023-03-12 09:46:46] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 09:46:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 09:46:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 09:46:46] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-12 09:46:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 09:46:46] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:46:46] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:46:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 09:46:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:46:46] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:46:46] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:46:46] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-12 09:46:46] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 142 transition count 350
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 142 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 142 transition count 348
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 134 transition count 330
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 134 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 129 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 129 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 124 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 124 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 114 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 114 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 109 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 109 transition count 260
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 105 transition count 252
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 105 transition count 252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 101 transition count 244
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 99 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 97 transition count 236
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 97 transition count 236
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 97 transition count 234
Applied a total of 112 rules in 61 ms. Remains 97 /151 variables (removed 54) and now considering 234/374 (removed 140) transitions.
[2023-03-12 09:46:47] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-12 09:46:47] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 09:46:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 09:46:47] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-12 09:46:47] [INFO ] Invariant cache hit.
[2023-03-12 09:46:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-12 09:46:47] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-12 09:46:47] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:46:47] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-12 09:46:47] [INFO ] Invariant cache hit.
[2023-03-12 09:46:47] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/151 places, 234/374 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 504 ms. Remains : 97/151 places, 234/374 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-03 finished in 705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 352
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 143 transition count 350
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 136 transition count 334
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 136 transition count 334
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 131 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 131 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 126 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 126 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 122 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 118 transition count 282
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 118 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 114 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 114 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 111 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 108 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 106 transition count 258
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 106 transition count 254
Applied a total of 96 rules in 46 ms. Remains 106 /151 variables (removed 45) and now considering 254/374 (removed 120) transitions.
[2023-03-12 09:46:47] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2023-03-12 09:46:47] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 09:46:47] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-12 09:46:47] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 09:46:47] [INFO ] Invariant cache hit.
[2023-03-12 09:46:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 09:46:48] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-12 09:46:48] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 09:46:48] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 09:46:48] [INFO ] Invariant cache hit.
[2023-03-12 09:46:48] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/151 places, 254/374 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 106/151 places, 254/374 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s87 1)), p0:(AND (GEQ s1 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 605 reset in 384 ms.
Product exploration explored 100000 steps with 621 reset in 332 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 229 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:46:49] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 09:46:49] [INFO ] Invariant cache hit.
[2023-03-12 09:46:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 09:46:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:46:49] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:46:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 09:46:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 09:46:49] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:46:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 09:46:49] [INFO ] After 19ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:46:49] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 09:46:49] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 106/106 places, 254/254 transitions.
Finished random walk after 4394 steps, including 8 resets, run visited all 1 properties in 5 ms. (steps per millisecond=878 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-12 09:46:50] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 09:46:50] [INFO ] Invariant cache hit.
[2023-03-12 09:46:50] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-12 09:46:50] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 09:46:50] [INFO ] Invariant cache hit.
[2023-03-12 09:46:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 09:46:50] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-12 09:46:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 09:46:50] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 09:46:50] [INFO ] Invariant cache hit.
[2023-03-12 09:46:50] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 106/106 places, 254/254 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4091 steps, including 7 resets, run visited all 2 properties in 27 ms. (steps per millisecond=151 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 609 reset in 335 ms.
Product exploration explored 100000 steps with 584 reset in 320 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-12 09:46:51] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 09:46:51] [INFO ] Invariant cache hit.
[2023-03-12 09:46:51] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-12 09:46:51] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 09:46:51] [INFO ] Invariant cache hit.
[2023-03-12 09:46:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 09:46:52] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-12 09:46:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:46:52] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 09:46:52] [INFO ] Invariant cache hit.
[2023-03-12 09:46:52] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 106/106 places, 254/254 transitions.
Treatment of property FunctionPointer-PT-b016-LTLFireability-06 finished in 4514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 352
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 143 transition count 350
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 136 transition count 334
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 136 transition count 334
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 131 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 131 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 126 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 126 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 122 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 118 transition count 282
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 118 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 114 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 114 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 111 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 108 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 106 transition count 258
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 106 transition count 254
Applied a total of 96 rules in 30 ms. Remains 106 /151 variables (removed 45) and now considering 254/374 (removed 120) transitions.
[2023-03-12 09:46:52] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 09:46:52] [INFO ] Invariant cache hit.
[2023-03-12 09:46:52] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-12 09:46:52] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 09:46:52] [INFO ] Invariant cache hit.
[2023-03-12 09:46:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 09:46:52] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-12 09:46:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:46:52] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 09:46:52] [INFO ] Invariant cache hit.
[2023-03-12 09:46:52] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/151 places, 254/374 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 389 ms. Remains : 106/151 places, 254/374 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s35 1)), p1:(AND (GEQ s1 1) (GEQ s87 1) (OR (LT s0 1) (LT s60 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-07 finished in 568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((p0||X(F(p1))))&&G(p2)))))'
Support contains 6 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 144 transition count 356
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 144 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 144 transition count 354
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 138 transition count 340
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 138 transition count 340
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 135 transition count 330
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 135 transition count 330
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 132 transition count 322
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 132 transition count 322
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 129 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 129 transition count 314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 126 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 126 transition count 306
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 123 transition count 300
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 123 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 121 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 121 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 119 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 119 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 118 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 118 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 117 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 117 transition count 288
Applied a total of 70 rules in 22 ms. Remains 117 /151 variables (removed 34) and now considering 288/374 (removed 86) transitions.
[2023-03-12 09:46:52] [INFO ] Flow matrix only has 196 transitions (discarded 92 similar events)
// Phase 1: matrix 196 rows 117 cols
[2023-03-12 09:46:52] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 09:46:52] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 09:46:52] [INFO ] Flow matrix only has 196 transitions (discarded 92 similar events)
[2023-03-12 09:46:52] [INFO ] Invariant cache hit.
[2023-03-12 09:46:52] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-12 09:46:52] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-12 09:46:52] [INFO ] Flow matrix only has 196 transitions (discarded 92 similar events)
[2023-03-12 09:46:52] [INFO ] Invariant cache hit.
[2023-03-12 09:46:53] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/151 places, 288/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 117/151 places, 288/374 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p2:(AND (GEQ s0 1) (GEQ s100 1)), p0:(AND (GEQ s5 1) (GEQ s107 1)), p1:(AND (GEQ s1 1) (GEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-08 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)&&(G(p2)||p1)))&&X(p3))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 145 transition count 358
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 145 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 145 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 140 transition count 346
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 140 transition count 346
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 137 transition count 334
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 137 transition count 334
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 134 transition count 326
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 134 transition count 326
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 132 transition count 320
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 132 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 130 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 130 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 128 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 128 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 126 transition count 306
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 126 transition count 306
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 124 transition count 302
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 124 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 123 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 123 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 122 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 122 transition count 298
Applied a total of 60 rules in 19 ms. Remains 122 /151 variables (removed 29) and now considering 298/374 (removed 76) transitions.
[2023-03-12 09:46:53] [INFO ] Flow matrix only has 202 transitions (discarded 96 similar events)
// Phase 1: matrix 202 rows 122 cols
[2023-03-12 09:46:53] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 09:46:53] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-12 09:46:53] [INFO ] Flow matrix only has 202 transitions (discarded 96 similar events)
[2023-03-12 09:46:53] [INFO ] Invariant cache hit.
[2023-03-12 09:46:53] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-12 09:46:53] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-12 09:46:53] [INFO ] Flow matrix only has 202 transitions (discarded 96 similar events)
[2023-03-12 09:46:53] [INFO ] Invariant cache hit.
[2023-03-12 09:46:53] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/151 places, 298/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 122/151 places, 298/374 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p3), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 1}, { cond=p0, acceptance={1} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s95 1)), p1:(OR (LT s0 1) (LT s103 1)), p2:(OR (LT s0 1) (LT s103 1)), p3:(OR (LT s1 1) (LT s102 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 986 reset in 341 ms.
Stack based approach found an accepted trace after 35255 steps with 295 reset with depth 221 and stack size 221 in 130 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-09 finished in 1167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&p0))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 144 transition count 354
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 144 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 138 transition count 338
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 138 transition count 338
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 135 transition count 328
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 135 transition count 328
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 132 transition count 320
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 132 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 129 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 129 transition count 312
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 126 transition count 304
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 126 transition count 304
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 123 transition count 298
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 123 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 121 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 121 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 119 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 119 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 118 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 118 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 117 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 117 transition count 286
Applied a total of 70 rules in 14 ms. Remains 117 /151 variables (removed 34) and now considering 286/374 (removed 88) transitions.
[2023-03-12 09:46:54] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
// Phase 1: matrix 194 rows 117 cols
[2023-03-12 09:46:54] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-12 09:46:54] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-12 09:46:54] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
[2023-03-12 09:46:54] [INFO ] Invariant cache hit.
[2023-03-12 09:46:54] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-12 09:46:54] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-12 09:46:54] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
[2023-03-12 09:46:54] [INFO ] Invariant cache hit.
[2023-03-12 09:46:54] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/151 places, 286/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 117/151 places, 286/374 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s94 1)), p1:(AND (GEQ s4 1) (GEQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 451 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-10 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p1)&&p0))))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 143 transition count 352
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 136 transition count 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 136 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 132 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 132 transition count 322
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 128 transition count 312
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 128 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 124 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 124 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 120 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 116 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 116 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 113 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 113 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 110 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 108 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 108 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 106 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 106 transition count 260
Applied a total of 92 rules in 14 ms. Remains 106 /151 variables (removed 45) and now considering 260/374 (removed 114) transitions.
[2023-03-12 09:46:55] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2023-03-12 09:46:55] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 09:46:55] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 09:46:55] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-12 09:46:55] [INFO ] Invariant cache hit.
[2023-03-12 09:46:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 09:46:55] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-12 09:46:55] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-12 09:46:55] [INFO ] Invariant cache hit.
[2023-03-12 09:46:55] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/151 places, 260/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 106/151 places, 260/374 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s94 1)), p1:(OR (LT s0 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-11 finished in 558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 352
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 352
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 135 transition count 334
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 135 transition count 334
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 130 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 130 transition count 316
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 125 transition count 302
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 125 transition count 302
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 120 transition count 288
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 115 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 115 transition count 274
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 110 transition count 264
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 110 transition count 264
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 106 transition count 256
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 106 transition count 256
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 102 transition count 248
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 102 transition count 248
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 100 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 99 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 99 transition count 242
Applied a total of 104 rules in 17 ms. Remains 99 /151 variables (removed 52) and now considering 242/374 (removed 132) transitions.
[2023-03-12 09:46:55] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2023-03-12 09:46:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 09:46:55] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-12 09:46:55] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2023-03-12 09:46:55] [INFO ] Invariant cache hit.
[2023-03-12 09:46:55] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-12 09:46:55] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-12 09:46:55] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2023-03-12 09:46:55] [INFO ] Invariant cache hit.
[2023-03-12 09:46:55] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/151 places, 242/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 99/151 places, 242/374 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b016-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b016-LTLFireability-15 finished in 924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2023-03-12 09:46:56] [INFO ] Flatten gal took : 18 ms
[2023-03-12 09:46:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 09:46:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 151 places, 374 transitions and 1510 arcs took 3 ms.
Total runtime 17527 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/915/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FunctionPointer-PT-b016-LTLFireability-06

BK_STOP 1678614417852

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name FunctionPointer-PT-b016-LTLFireability-06
ltl formula formula --ltl=/tmp/915/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 151 places, 374 transitions and 1510 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/915/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/915/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/915/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/915/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55d7dd0123f4]
1: pnml2lts-mc(+0xa2496) [0x55d7dd012496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f72a5929140]
3: pnml2lts-mc(+0x405be5) [0x55d7dd375be5]
4: pnml2lts-mc(+0x16b3f9) [0x55d7dd0db3f9]
5: pnml2lts-mc(+0x164ac4) [0x55d7dd0d4ac4]
6: pnml2lts-mc(+0x272e0a) [0x55d7dd1e2e0a]
7: pnml2lts-mc(+0xb61f0) [0x55d7dd0261f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f72a577c4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f72a577c67a]
10: pnml2lts-mc(+0xa1581) [0x55d7dd011581]
11: pnml2lts-mc(+0xa1910) [0x55d7dd011910]
12: pnml2lts-mc(+0xa32a2) [0x55d7dd0132a2]
13: pnml2lts-mc(+0xa50f4) [0x55d7dd0150f4]
14: pnml2lts-mc(+0xa516b) [0x55d7dd01516b]
15: pnml2lts-mc(+0x3f34b3) [0x55d7dd3634b3]
16: pnml2lts-mc(+0x7c63d) [0x55d7dcfec63d]
17: pnml2lts-mc(+0x67d86) [0x55d7dcfd7d86]
18: pnml2lts-mc(+0x60a8a) [0x55d7dcfd0a8a]
19: pnml2lts-mc(+0x5eb15) [0x55d7dcfceb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f72a5764d0a]
21: pnml2lts-mc(+0x6075e) [0x55d7dcfd075e]

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-b016"
export BK_EXAMINATION="LTLFireability"
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-b016, examination is LTLFireability"
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-167838856200684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b016.tgz
mv FunctionPointer-PT-b016 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;