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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K 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-b128-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b128-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678508617025

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 04:23:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 04:23:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 04:23:38] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-11 04:23:38] [INFO ] Transformed 306 places.
[2023-03-11 04:23:38] [INFO ] Transformed 840 transitions.
[2023-03-11 04:23:38] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 151 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 2 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b128-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 32 place count 190 transition count 568
Iterating global reduction 1 with 22 rules applied. Total rules applied 54 place count 190 transition count 568
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 122 place count 190 transition count 500
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 182 transition count 484
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 182 transition count 484
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 150 place count 182 transition count 472
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 156 place count 176 transition count 460
Iterating global reduction 3 with 6 rules applied. Total rules applied 162 place count 176 transition count 460
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 168 place count 170 transition count 436
Iterating global reduction 3 with 6 rules applied. Total rules applied 174 place count 170 transition count 436
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 179 place count 165 transition count 426
Iterating global reduction 3 with 5 rules applied. Total rules applied 184 place count 165 transition count 426
Applied a total of 184 rules in 62 ms. Remains 165 /222 variables (removed 57) and now considering 426/648 (removed 222) transitions.
[2023-03-11 04:23:39] [INFO ] Flow matrix only has 285 transitions (discarded 141 similar events)
// Phase 1: matrix 285 rows 165 cols
[2023-03-11 04:23:39] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 04:23:39] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-11 04:23:39] [INFO ] Flow matrix only has 285 transitions (discarded 141 similar events)
[2023-03-11 04:23:39] [INFO ] Invariant cache hit.
[2023-03-11 04:23:39] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-11 04:23:39] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2023-03-11 04:23:39] [INFO ] Flow matrix only has 285 transitions (discarded 141 similar events)
[2023-03-11 04:23:39] [INFO ] Invariant cache hit.
[2023-03-11 04:23:39] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/222 places, 426/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 866 ms. Remains : 165/222 places, 426/648 transitions.
Support contains 26 out of 165 places after structural reductions.
[2023-03-11 04:23:39] [INFO ] Flatten gal took : 50 ms
[2023-03-11 04:23:39] [INFO ] Flatten gal took : 26 ms
[2023-03-11 04:23:39] [INFO ] Input system was already deterministic with 426 transitions.
Support contains 25 out of 165 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10121 steps, including 8 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 24) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 04:23:40] [INFO ] Flow matrix only has 285 transitions (discarded 141 similar events)
[2023-03-11 04:23:40] [INFO ] Invariant cache hit.
[2023-03-11 04:23:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:23:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:23:40] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:5
[2023-03-11 04:23:40] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-11 04:23:40] [INFO ] After 27ms SMT Verify possible using 59 Read/Feed constraints in real domain returned unsat :2 sat :0 real:6
[2023-03-11 04:23:40] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:6
[2023-03-11 04:23:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 04:23:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:23:41] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-11 04:23:41] [INFO ] After 84ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2023-03-11 04:23:41] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-11 04:23:41] [INFO ] After 620ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 167 ms.
Support contains 10 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 160 transition count 408
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 160 transition count 408
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 26 place count 160 transition count 392
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 157 transition count 384
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 157 transition count 384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 156 transition count 380
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 156 transition count 380
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 155 transition count 376
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 155 transition count 376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 154 transition count 374
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 154 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 153 transition count 372
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 153 transition count 372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 152 transition count 370
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 152 transition count 370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 151 transition count 368
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 151 transition count 368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 150 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 150 transition count 366
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 60 place count 150 transition count 352
Applied a total of 60 rules in 108 ms. Remains 150 /165 variables (removed 15) and now considering 352/426 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 150/165 places, 352/426 transitions.
Incomplete random walk after 10001 steps, including 8 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 04:23:41] [INFO ] Flow matrix only has 244 transitions (discarded 108 similar events)
// Phase 1: matrix 244 rows 150 cols
[2023-03-11 04:23:41] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:23:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:23:42] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-11 04:23:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-11 04:23:42] [INFO ] After 24ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 04:23:42] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 04:23:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:23:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-11 04:23:42] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 04:23:42] [INFO ] After 76ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 04:23:42] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-11 04:23:42] [INFO ] After 384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 153 ms.
Support contains 8 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 352/352 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 149 transition count 350
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 149 transition count 350
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 148 transition count 348
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 148 transition count 348
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 147 transition count 346
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 147 transition count 346
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 146 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 146 transition count 342
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 145 transition count 340
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 145 transition count 340
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 144 transition count 336
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 144 transition count 336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 143 transition count 334
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 143 transition count 334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 142 transition count 332
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 142 transition count 332
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 141 transition count 330
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 141 transition count 330
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 140 transition count 328
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 140 transition count 328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 139 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 139 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 138 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 138 transition count 324
Applied a total of 24 rules in 47 ms. Remains 138 /150 variables (removed 12) and now considering 324/352 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 138/150 places, 324/352 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :2
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 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 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 04:23:42] [INFO ] Flow matrix only has 223 transitions (discarded 101 similar events)
// Phase 1: matrix 223 rows 138 cols
[2023-03-11 04:23:42] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-11 04:23:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:23:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:23:42] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 04:23:42] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-11 04:23:42] [INFO ] After 43ms SMT Verify possible using 52 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:23:42] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:23:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 04:23:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:23:43] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:23:43] [INFO ] After 34ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 04:23:43] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-11 04:23:43] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 57 ms.
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 324/324 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 320
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 320
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 134 transition count 316
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 134 transition count 316
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 132 transition count 310
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 132 transition count 310
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 130 transition count 306
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 130 transition count 306
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 128 transition count 302
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 128 transition count 302
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 126 transition count 298
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 126 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 124 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 124 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 123 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 123 transition count 292
Applied a total of 30 rules in 38 ms. Remains 123 /138 variables (removed 15) and now considering 292/324 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 123/138 places, 292/324 transitions.
Incomplete random walk after 10116 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=235 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) 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 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 327575 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327575 steps, saw 215371 distinct states, run finished after 3002 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 04:23:46] [INFO ] Flow matrix only has 199 transitions (discarded 93 similar events)
// Phase 1: matrix 199 rows 123 cols
[2023-03-11 04:23:46] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:46] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 04:23:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:23:46] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 04:23:46] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 04:23:46] [INFO ] After 36ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:23:46] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:23:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 04:23:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:23:46] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:23:46] [INFO ] After 30ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 04:23:46] [INFO ] After 77ms 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-11 04:23:46] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 66 ms.
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 292/292 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 123/123 places, 292/292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 292/292 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2023-03-11 04:23:46] [INFO ] Flow matrix only has 199 transitions (discarded 93 similar events)
[2023-03-11 04:23:46] [INFO ] Invariant cache hit.
[2023-03-11 04:23:46] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-11 04:23:46] [INFO ] Flow matrix only has 199 transitions (discarded 93 similar events)
[2023-03-11 04:23:46] [INFO ] Invariant cache hit.
[2023-03-11 04:23:46] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 04:23:47] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-11 04:23:47] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-11 04:23:47] [INFO ] Flow matrix only has 199 transitions (discarded 93 similar events)
[2023-03-11 04:23:47] [INFO ] Invariant cache hit.
[2023-03-11 04:23:47] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 123/123 places, 292/292 transitions.
Graph (trivial) has 175 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions removed 40 transitions
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 117 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 107 transition count 168
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 100 transition count 168
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 15 place count 100 transition count 146
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 59 place count 78 transition count 146
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 66 place count 71 transition count 139
Iterating global reduction 2 with 7 rules applied. Total rules applied 73 place count 71 transition count 139
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 87 place count 71 transition count 125
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 121 place count 54 transition count 108
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 128 place count 47 transition count 94
Iterating global reduction 3 with 7 rules applied. Total rules applied 135 place count 47 transition count 94
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 142 place count 40 transition count 80
Iterating global reduction 3 with 7 rules applied. Total rules applied 149 place count 40 transition count 80
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 156 place count 33 transition count 66
Iterating global reduction 3 with 7 rules applied. Total rules applied 163 place count 33 transition count 66
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 170 place count 33 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 170 place count 33 transition count 58
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 172 place count 32 transition count 58
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 178 place count 29 transition count 58
Applied a total of 178 rules in 25 ms. Remains 29 /123 variables (removed 94) and now considering 58/292 (removed 234) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 58 rows 29 cols
[2023-03-11 04:23:47] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 04:23:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 04:23:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:23:47] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 04:23:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 04:23:47] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:23:47] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:23:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 04:23:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:23:47] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:23:47] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 04:23:47] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 04:23:47] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b128-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(p0)||(X(X((p1 U p2))) U (p2||X(p1)))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 398
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 398
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 28 place count 157 transition count 386
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 152 transition count 374
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 152 transition count 374
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 147 transition count 356
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 147 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 142 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 142 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 137 transition count 328
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 137 transition count 328
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 132 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 132 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 127 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 127 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 122 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 122 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 118 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 118 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 117 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 117 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 116 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 115 transition count 280
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 115 transition count 280
Applied a total of 112 rules in 29 ms. Remains 115 /165 variables (removed 50) and now considering 280/426 (removed 146) transitions.
[2023-03-11 04:23:47] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
// Phase 1: matrix 189 rows 115 cols
[2023-03-11 04:23:47] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:47] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 04:23:47] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2023-03-11 04:23:47] [INFO ] Invariant cache hit.
[2023-03-11 04:23:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 04:23:47] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-11 04:23:47] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2023-03-11 04:23:47] [INFO ] Invariant cache hit.
[2023-03-11 04:23:47] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/165 places, 280/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 115/165 places, 280/426 transitions.
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s95 1)), p2:(AND (GEQ s0 1) (GEQ s96 1)), p1:(AND (GEQ s0 1) (GEQ s32 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-03 finished in 716 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((p0 U G(!p1)))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 156 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 150 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 150 transition count 370
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 138 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 132 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 132 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 126 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 120 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 114 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 114 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 109 transition count 264
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 108 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 106 transition count 258
Applied a total of 126 rules in 31 ms. Remains 106 /165 variables (removed 59) and now considering 258/426 (removed 168) transitions.
[2023-03-11 04:23:48] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2023-03-11 04:23:48] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-11 04:23:48] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 04:23:48] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2023-03-11 04:23:48] [INFO ] Invariant cache hit.
[2023-03-11 04:23:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 04:23:48] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-11 04:23:48] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2023-03-11 04:23:48] [INFO ] Invariant cache hit.
[2023-03-11 04:23:48] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/165 places, 258/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 106/165 places, 258/426 transitions.
Stuttering acceptance computed with spot in 166 ms :[p1, p1, p1, true, p1]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s87 1)), p0:(AND (NOT (AND (GEQ s1 1) (GEQ s50 1))) (GEQ s0 1) (GEQ s87 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]]
Entered a terminal (fully accepting) state of product in 5533 steps with 57 reset in 80 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-04 finished in 621 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(!p0)||F(p1)))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 156 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 150 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 150 transition count 370
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 138 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 132 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 132 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 127 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 122 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 117 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 117 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 113 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 113 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 112 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 112 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 111 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 111 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 110 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 110 transition count 266
Applied a total of 118 rules in 16 ms. Remains 110 /165 variables (removed 55) and now considering 266/426 (removed 160) transitions.
[2023-03-11 04:23:48] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
// Phase 1: matrix 181 rows 110 cols
[2023-03-11 04:23:48] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 04:23:48] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 04:23:49] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2023-03-11 04:23:49] [INFO ] Invariant cache hit.
[2023-03-11 04:23:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 04:23:49] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-11 04:23:49] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2023-03-11 04:23:49] [INFO ] Invariant cache hit.
[2023-03-11 04:23:49] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/165 places, 266/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 110/165 places, 266/426 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s4 1) (GEQ s81 1)), p0:(AND (GEQ s0 1) (GEQ s91 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, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 295 ms.
Product exploration explored 100000 steps with 50000 reset in 283 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 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b128-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b128-LTLFireability-05 finished in 1099 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)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 386
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 148 transition count 366
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 134 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 134 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 73 place count 127 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 80 place count 127 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 120 transition count 284
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 120 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 101 place count 113 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 113 transition count 268
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 115 place count 106 transition count 254
Iterating global reduction 1 with 7 rules applied. Total rules applied 122 place count 106 transition count 254
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 128 place count 100 transition count 242
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 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 142 place count 97 transition count 234
Applied a total of 142 rules in 48 ms. Remains 97 /165 variables (removed 68) and now considering 234/426 (removed 192) transitions.
[2023-03-11 04:23:50] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-11 04:23:50] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:50] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-11 04:23:50] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 04:23:50] [INFO ] Invariant cache hit.
[2023-03-11 04:23:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 04:23:50] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-11 04:23:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 04:23:50] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 04:23:50] [INFO ] Invariant cache hit.
[2023-03-11 04:23:50] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/165 places, 234/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 97/165 places, 234/426 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1188 reset in 270 ms.
Stack based approach found an accepted trace after 42412 steps with 497 reset with depth 101 and stack size 101 in 148 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-06 finished in 821 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(G(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 386
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 148 transition count 366
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 134 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 134 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 73 place count 127 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 80 place count 127 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 120 transition count 284
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 120 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 101 place count 113 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 113 transition count 268
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 115 place count 106 transition count 254
Iterating global reduction 1 with 7 rules applied. Total rules applied 122 place count 106 transition count 254
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 128 place count 100 transition count 242
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 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 142 place count 97 transition count 234
Applied a total of 142 rules in 39 ms. Remains 97 /165 variables (removed 68) and now considering 234/426 (removed 192) transitions.
[2023-03-11 04:23:50] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 04:23:50] [INFO ] Invariant cache hit.
[2023-03-11 04:23:50] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 04:23:50] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 04:23:50] [INFO ] Invariant cache hit.
[2023-03-11 04:23:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 04:23:51] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-11 04:23:51] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-11 04:23:51] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 04:23:51] [INFO ] Invariant cache hit.
[2023-03-11 04:23:51] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/165 places, 234/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 97/165 places, 234/426 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-07 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 s0 1) (GEQ s91 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 63 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-07 finished in 347 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((p0 U X(p1))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 386
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 148 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 142 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 142 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 136 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 136 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 130 transition count 308
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 130 transition count 308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 124 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 118 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 118 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 112 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 112 transition count 268
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 106 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 106 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 105 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 105 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 104 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 104 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 103 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 103 transition count 250
Applied a total of 128 rules in 19 ms. Remains 103 /165 variables (removed 62) and now considering 250/426 (removed 176) transitions.
[2023-03-11 04:23:51] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 103 cols
[2023-03-11 04:23:51] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:51] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 04:23:51] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
[2023-03-11 04:23:51] [INFO ] Invariant cache hit.
[2023-03-11 04:23:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 04:23:51] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-11 04:23:51] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
[2023-03-11 04:23:51] [INFO ] Invariant cache hit.
[2023-03-11 04:23:51] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/165 places, 250/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 103/165 places, 250/426 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s80 1) (NOT (AND (GEQ s1 1) (GEQ s40 1)))), p1:(AND (GEQ s1 1) (GEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-09 finished in 429 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 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 390
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 390
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 157 transition count 388
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 151 transition count 374
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 151 transition count 374
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 145 transition count 350
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 145 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 139 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 139 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 133 transition count 316
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 133 transition count 316
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 127 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 121 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 121 transition count 292
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 115 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 115 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 110 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 110 transition count 270
Applied a total of 112 rules in 17 ms. Remains 110 /165 variables (removed 55) and now considering 270/426 (removed 156) transitions.
[2023-03-11 04:23:51] [INFO ] Flow matrix only has 183 transitions (discarded 87 similar events)
// Phase 1: matrix 183 rows 110 cols
[2023-03-11 04:23:51] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:51] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-11 04:23:51] [INFO ] Flow matrix only has 183 transitions (discarded 87 similar events)
[2023-03-11 04:23:51] [INFO ] Invariant cache hit.
[2023-03-11 04:23:51] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-11 04:23:51] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-11 04:23:51] [INFO ] Flow matrix only has 183 transitions (discarded 87 similar events)
[2023-03-11 04:23:51] [INFO ] Invariant cache hit.
[2023-03-11 04:23:51] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/165 places, 270/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 110/165 places, 270/426 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s101 1)), p1:(OR (AND (GEQ s0 1) (GEQ s15 1) (OR (LT s1 1) (LT s87 1))) (AND (GEQ s1 1) (GEQ s87 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-10 finished in 447 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)||X(p1))&&(G(p2)||X(X(p3)))))'
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 159 transition count 402
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 159 transition count 402
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 159 transition count 396
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 154 transition count 384
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 154 transition count 384
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 150 transition count 370
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 150 transition count 370
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 146 transition count 356
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 146 transition count 356
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 142 transition count 348
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 142 transition count 348
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 138 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 138 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 134 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 134 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 130 transition count 320
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 130 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 127 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 127 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 126 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 126 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 125 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 125 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 124 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 124 transition count 308
Applied a total of 88 rules in 22 ms. Remains 124 /165 variables (removed 41) and now considering 308/426 (removed 118) transitions.
[2023-03-11 04:23:52] [INFO ] Flow matrix only has 207 transitions (discarded 101 similar events)
// Phase 1: matrix 207 rows 124 cols
[2023-03-11 04:23:52] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 04:23:52] [INFO ] Flow matrix only has 207 transitions (discarded 101 similar events)
[2023-03-11 04:23:52] [INFO ] Invariant cache hit.
[2023-03-11 04:23:52] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 04:23:52] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-11 04:23:52] [INFO ] Flow matrix only has 207 transitions (discarded 101 similar events)
[2023-03-11 04:23:52] [INFO ] Invariant cache hit.
[2023-03-11 04:23:52] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/165 places, 308/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 124/165 places, 308/426 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p3), true, (NOT p0), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 7}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 5}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s111 1) (GEQ s0 1) (GEQ s103 1)), p0:(AND (GEQ s1 1) (GEQ s105 1)), p1:(AND (GEQ s0 1) (GEQ s111 1)), p3:(OR (LT s1 1) (LT s102 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-11 finished in 664 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(G(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 156 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 150 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 150 transition count 370
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 138 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 132 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 132 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 126 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 120 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 114 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 114 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 109 transition count 264
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 108 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 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 130 place count 106 transition count 254
Applied a total of 130 rules in 39 ms. Remains 106 /165 variables (removed 59) and now considering 254/426 (removed 172) transitions.
[2023-03-11 04:23:52] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2023-03-11 04:23:52] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 04:23:52] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 04:23:52] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 04:23:52] [INFO ] Invariant cache hit.
[2023-03-11 04:23:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 04:23:53] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-11 04:23:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 04:23:53] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 04:23:53] [INFO ] Invariant cache hit.
[2023-03-11 04:23:53] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/165 places, 254/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 359 ms. Remains : 106/165 places, 254/426 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-12 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 s1 1) (GEQ s87 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 32 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-12 finished in 421 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(p0))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 388
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 156 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 150 transition count 372
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 150 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 144 transition count 350
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 138 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 132 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 132 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 126 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 120 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 114 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 114 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 108 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 105 transition count 256
Applied a total of 124 rules in 25 ms. Remains 105 /165 variables (removed 60) and now considering 256/426 (removed 170) transitions.
[2023-03-11 04:23:53] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
// Phase 1: matrix 173 rows 105 cols
[2023-03-11 04:23:53] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 04:23:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 04:23:53] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
[2023-03-11 04:23:53] [INFO ] Invariant cache hit.
[2023-03-11 04:23:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 04:23:53] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-11 04:23:53] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
[2023-03-11 04:23:53] [INFO ] Invariant cache hit.
[2023-03-11 04:23:53] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/165 places, 256/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 105/165 places, 256/426 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-14 finished in 404 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)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 386
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 148 transition count 366
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 134 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 134 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 73 place count 127 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 80 place count 127 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 120 transition count 284
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 120 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 114 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 108 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 108 transition count 258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 123 place count 103 transition count 248
Iterating global reduction 1 with 5 rules applied. Total rules applied 128 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 101 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 101 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 100 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 100 transition count 242
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 100 transition count 240
Applied a total of 136 rules in 32 ms. Remains 100 /165 variables (removed 65) and now considering 240/426 (removed 186) transitions.
[2023-03-11 04:23:53] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
// Phase 1: matrix 164 rows 100 cols
[2023-03-11 04:23:53] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 04:23:53] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-11 04:23:53] [INFO ] Invariant cache hit.
[2023-03-11 04:23:53] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 04:23:53] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-11 04:23:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 04:23:53] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-11 04:23:53] [INFO ] Invariant cache hit.
[2023-03-11 04:23:53] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/165 places, 240/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 100/165 places, 240/426 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1098 reset in 265 ms.
Product exploration explored 100000 steps with 1141 reset in 253 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 : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10087 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1008 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10060 steps, run visited all 1 properties in 20 ms. (steps per millisecond=503 )
Probabilistic random walk after 10060 steps, saw 6628 distinct states, run finished after 21 ms. (steps per millisecond=479 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 240/240 transitions.
Applied a total of 0 rules in 11 ms. Remains 100 /100 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-11 04:23:54] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-11 04:23:54] [INFO ] Invariant cache hit.
[2023-03-11 04:23:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 04:23:55] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-11 04:23:55] [INFO ] Invariant cache hit.
[2023-03-11 04:23:55] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 04:23:55] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-11 04:23:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 04:23:55] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-11 04:23:55] [INFO ] Invariant cache hit.
[2023-03-11 04:23:55] [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 302 ms. Remains : 100/100 places, 240/240 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10060 steps, run visited all 1 properties in 32 ms. (steps per millisecond=314 )
Probabilistic random walk after 10060 steps, saw 6628 distinct states, run finished after 32 ms. (steps per millisecond=314 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1096 reset in 233 ms.
Product exploration explored 100000 steps with 1105 reset in 244 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-11 04:23:56] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-11 04:23:56] [INFO ] Invariant cache hit.
[2023-03-11 04:23:56] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 04:23:56] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-11 04:23:56] [INFO ] Invariant cache hit.
[2023-03-11 04:23:56] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 04:23:56] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-11 04:23:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 04:23:56] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-11 04:23:56] [INFO ] Invariant cache hit.
[2023-03-11 04:23:56] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 100/100 places, 240/240 transitions.
Treatment of property FunctionPointer-PT-b128-LTLFireability-15 finished in 3091 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)))'
[2023-03-11 04:23:56] [INFO ] Flatten gal took : 23 ms
[2023-03-11 04:23:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 0 ms.
[2023-03-11 04:23:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 165 places, 426 transitions and 1716 arcs took 4 ms.
Total runtime 18360 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-b128
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1678508667842

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 FunctionPointer-PT-b128-LTLFireability-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 7/32 FunctionPointer-PT-b128-LTLFireability-15 765862 m, 153172 m/sec, 990008 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 13/32 FunctionPointer-PT-b128-LTLFireability-15 1525300 m, 151887 m/sec, 1971722 t fired, .

Time elapsed: 10 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 19/32 FunctionPointer-PT-b128-LTLFireability-15 2286933 m, 152326 m/sec, 2956270 t fired, .

Time elapsed: 15 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 26/32 FunctionPointer-PT-b128-LTLFireability-15 3044700 m, 151553 m/sec, 3935823 t fired, .

Time elapsed: 20 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 32/32 FunctionPointer-PT-b128-LTLFireability-15 3802589 m, 151577 m/sec, 4915534 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for FunctionPointer-PT-b128-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-LTLFireability-15: LTL unknown AGGR


Time elapsed: 30 secs. Pages in use: 32

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-b128"
export BK_EXAMINATION="LTLFireability"
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-b128, 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 r167-tall-167838853500708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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