Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r202-smll-171649588000356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is IBMB2S565S3960-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649588000356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 10K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 03:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 03:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 127K May 18 16:42 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 IBMB2S565S3960-PT-none-LTLFireability-00
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-01
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-02
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-03
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-04
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-05
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-06
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-07
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-08
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-09
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-10
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-11
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-12
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-13
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-14
FORMULA_NAME IBMB2S565S3960-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716781335086

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 03:42:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 03:42:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 03:42:18] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-27 03:42:18] [INFO ] Transformed 273 places.
[2024-05-27 03:42:18] [INFO ] Transformed 179 transitions.
[2024-05-27 03:42:18] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 179/179 transitions.
Ensure Unique test removed 82 places
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 181 transition count 178
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 110 place count 164 transition count 161
Iterating global reduction 1 with 17 rules applied. Total rules applied 127 place count 164 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 162 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 162 transition count 159
Applied a total of 131 rules in 142 ms. Remains 162 /273 variables (removed 111) and now considering 159/179 (removed 20) transitions.
// Phase 1: matrix 159 rows 162 cols
[2024-05-27 03:42:18] [INFO ] Computed 15 invariants in 40 ms
[2024-05-27 03:42:19] [INFO ] Implicit Places using invariants in 415 ms returned [129]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 483 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/273 places, 159/179 transitions.
Applied a total of 0 rules in 16 ms. Remains 161 /161 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 679 ms. Remains : 161/273 places, 159/179 transitions.
Support contains 42 out of 161 places after structural reductions.
[2024-05-27 03:42:19] [INFO ] Flatten gal took : 89 ms
[2024-05-27 03:42:19] [INFO ] Flatten gal took : 32 ms
[2024-05-27 03:42:19] [INFO ] Input system was already deterministic with 159 transitions.
Support contains 40 out of 161 places (down from 42) after GAL structural reductions.
RANDOM walk for 40007 steps (155 resets) in 2795 ms. (14 steps per ms) remains 11/28 properties
BEST_FIRST walk for 40004 steps (24 resets) in 432 ms. (92 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (23 resets) in 668 ms. (59 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (24 resets) in 467 ms. (85 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (25 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
// Phase 1: matrix 159 rows 161 cols
[2024-05-27 03:42:21] [INFO ] Computed 14 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/26 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 26/53 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 25/78 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 38/116 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 46/162 variables, 21/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 65/227 variables, 33/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/227 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/227 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/233 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/233 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/233 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 46/279 variables, 28/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/279 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/279 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 22/301 variables, 14/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/301 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/301 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 12/313 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/313 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (OVERLAPS) 7/320 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/320 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/320 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 175 constraints, problems are : Problem set: 0 solved, 2 unsolved in 683 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 12/26 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 26/53 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 25/78 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 38/116 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 46/162 variables, 21/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 65/227 variables, 33/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/227 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/227 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 6/233 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/233 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/233 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 46/279 variables, 28/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/279 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/279 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 22/301 variables, 14/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/301 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/301 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 12/313 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/313 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 7/320 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/320 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/320 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 177 constraints, problems are : Problem set: 0 solved, 2 unsolved in 742 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1480ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 284 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 33 ms.
Computed a total of 67 stabilizing places and 69 stable transitions
Graph (complete) has 198 edges and 161 vertex of which 108 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1)||F(p2))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 154 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 148 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 148 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 148 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 147 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 147 transition count 151
Applied a total of 22 rules in 32 ms. Remains 147 /161 variables (removed 14) and now considering 151/159 (removed 8) transitions.
// Phase 1: matrix 151 rows 147 cols
[2024-05-27 03:42:23] [INFO ] Computed 7 invariants in 2 ms
[2024-05-27 03:42:23] [INFO ] Implicit Places using invariants in 77 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/161 places, 151/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 145 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 145 transition count 150
Applied a total of 2 rules in 9 ms. Remains 145 /146 variables (removed 1) and now considering 150/151 (removed 1) transitions.
// Phase 1: matrix 150 rows 145 cols
[2024-05-27 03:42:23] [INFO ] Computed 6 invariants in 2 ms
[2024-05-27 03:42:23] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 03:42:23] [INFO ] Invariant cache hit.
[2024-05-27 03:42:23] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 145/161 places, 150/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 427 ms. Remains : 145/161 places, 150/159 transitions.
Stuttering acceptance computed with spot in 507 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-00
Product exploration explored 100000 steps with 468 reset in 639 ms.
Product exploration explored 100000 steps with 476 reset in 300 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 172 edges and 145 vertex of which 98 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.6 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 155 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
RANDOM walk for 40006 steps (168 resets) in 429 ms. (93 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 264 ms. (150 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (24 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (27 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (24 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
[2024-05-27 03:42:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 11/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 9/25 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 23/48 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/64 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 24/88 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 35/123 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 45/168 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 4/172 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/172 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 43/215 variables, 23/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/215 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 34/249 variables, 19/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/249 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 20/269 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/269 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 16/285 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/285 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 9/294 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/294 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 1/295 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 4 unsolved in 578 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 11/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 9/25 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 23/48 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/64 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 24/88 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 35/123 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/123 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 45/168 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/172 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/172 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 43/215 variables, 23/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/215 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 34/249 variables, 19/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 20/269 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/269 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 16/285 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/285 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 9/294 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/294 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 1/295 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/295 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 0/295 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 155 constraints, problems are : Problem set: 0 solved, 4 unsolved in 764 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1354ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 2948 steps, including 6 resets, run visited all 4 properties in 31 ms. (steps per millisecond=95 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 32 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 789 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 150/150 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-27 03:42:28] [INFO ] Invariant cache hit.
[2024-05-27 03:42:28] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-27 03:42:28] [INFO ] Invariant cache hit.
[2024-05-27 03:42:28] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-27 03:42:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/294 variables, 144/150 constraints. Problems are: Problem set: 0 solved, 149 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 1/295 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7839 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/294 variables, 144/150 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 149/299 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/295 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 300 constraints, problems are : Problem set: 0 solved, 149 unsolved in 12916 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 20824ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 20834ms
Finished structural reductions in LTL mode , in 1 iterations and 21174 ms. Remains : 145/145 places, 150/150 transitions.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 172 edges and 145 vertex of which 98 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.8 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 228 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
RANDOM walk for 40004 steps (154 resets) in 301 ms. (132 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (26 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (26 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (26 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (28 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
[2024-05-27 03:42:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 11/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 9/25 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 23/48 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 16/64 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 24/88 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 35/123 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 45/168 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 4/172 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/172 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 43/215 variables, 23/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/215 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 34/249 variables, 19/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/249 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 20/269 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/269 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 16/285 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/285 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 9/294 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/294 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 1/295 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 5 unsolved in 656 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 11/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 9/25 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 23/48 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 16/64 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 24/88 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 35/123 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/123 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 45/168 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 4/172 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/172 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/172 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 43/215 variables, 23/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/215 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 34/249 variables, 19/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/249 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 20/269 variables, 11/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/269 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 16/285 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/285 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 9/294 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/294 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 1/295 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 156 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1065 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1744ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 2811 steps, including 6 resets, run visited all 5 properties in 29 ms. (steps per millisecond=96 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 29 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 878 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 481 reset in 228 ms.
Product exploration explored 100000 steps with 466 reset in 553 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 150/150 transitions.
Graph (trivial) has 126 edges and 145 vertex of which 18 / 145 are part of one of the 1 SCC in 6 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 153 edges and 128 vertex of which 97 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.4 ms
Discarding 31 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 97 transition count 104
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 40 place count 97 transition count 105
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 55 place count 97 transition count 105
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 78 place count 74 transition count 82
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 101 place count 74 transition count 82
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 115 place count 74 transition count 84
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 58 transition count 68
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 147 place count 58 transition count 68
Performed 9 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 156 place count 58 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 161 place count 58 transition count 95
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 174 place count 45 transition count 67
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 187 place count 45 transition count 67
Deduced a syphon composed of 24 places in 1 ms
Applied a total of 187 rules in 77 ms. Remains 45 /145 variables (removed 100) and now considering 67/150 (removed 83) transitions.
[2024-05-27 03:42:55] [INFO ] Redundant transitions in 48 ms returned []
Running 65 sub problems to find dead transitions.
// Phase 1: matrix 67 rows 45 cols
[2024-05-27 03:42:55] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 03:42:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 2 (OVERLAPS) 66/110 variables, 44/47 constraints. Problems are: Problem set: 41 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/47 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 1/111 variables, 1/48 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/48 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1/112 variables, 1/49 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/49 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/49 constraints. Problems are: Problem set: 41 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 49 constraints, problems are : Problem set: 41 solved, 24 unsolved in 912 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 41 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 3/23 variables, 1/3 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 60/83 variables, 23/26 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 24/50 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/50 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 28/111 variables, 22/72 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/72 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 1/112 variables, 1/73 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/73 constraints. Problems are: Problem set: 41 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/73 constraints. Problems are: Problem set: 41 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 73 constraints, problems are : Problem set: 41 solved, 24 unsolved in 701 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 1641ms problems are : Problem set: 41 solved, 24 unsolved
Search for dead transitions found 41 dead transitions in 1643ms
Found 41 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 41 transitions
Dead transitions reduction (with SMT) removed 41 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 45/145 places, 26/150 transitions.
Graph (complete) has 35 edges and 45 vertex of which 21 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 20 /45 variables (removed 25) and now considering 27/26 (removed -1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/145 places, 27/150 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1781 ms. Remains : 20/145 places, 27/150 transitions.
Built C files in :
/tmp/ltsmin5641075695910858091
[2024-05-27 03:42:57] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5641075695910858091
Running compilation step : cd /tmp/ltsmin5641075695910858091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 775 ms.
Running link step : cd /tmp/ltsmin5641075695910858091;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5641075695910858091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5246308445051954459.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 150/150 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 150/150 (removed 0) transitions.
// Phase 1: matrix 150 rows 145 cols
[2024-05-27 03:43:12] [INFO ] Computed 6 invariants in 2 ms
[2024-05-27 03:43:12] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 03:43:12] [INFO ] Invariant cache hit.
[2024-05-27 03:43:12] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-27 03:43:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/294 variables, 144/150 constraints. Problems are: Problem set: 0 solved, 149 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 1/295 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7087 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 150/294 variables, 144/150 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 149/299 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/295 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 300 constraints, problems are : Problem set: 0 solved, 149 unsolved in 11381 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 18492ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 18495ms
Finished structural reductions in LTL mode , in 1 iterations and 18691 ms. Remains : 145/145 places, 150/150 transitions.
Built C files in :
/tmp/ltsmin16714458564903187365
[2024-05-27 03:43:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16714458564903187365
Running compilation step : cd /tmp/ltsmin16714458564903187365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 592 ms.
Running link step : cd /tmp/ltsmin16714458564903187365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16714458564903187365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1531102127699575493.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 03:43:46] [INFO ] Flatten gal took : 12 ms
[2024-05-27 03:43:46] [INFO ] Flatten gal took : 10 ms
[2024-05-27 03:43:46] [INFO ] Time to serialize gal into /tmp/LTL17193385908363740659.gal : 4 ms
[2024-05-27 03:43:46] [INFO ] Time to serialize properties into /tmp/LTL16747204379384046103.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17193385908363740659.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5227786263724625089.hoa' '-atoms' '/tmp/LTL16747204379384046103.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16747204379384046103.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5227786263724625089.hoa
Detected timeout of ITS tools.
[2024-05-27 03:44:01] [INFO ] Flatten gal took : 9 ms
[2024-05-27 03:44:01] [INFO ] Flatten gal took : 8 ms
[2024-05-27 03:44:01] [INFO ] Time to serialize gal into /tmp/LTL8924021199345342203.gal : 2 ms
[2024-05-27 03:44:01] [INFO ] Time to serialize properties into /tmp/LTL3860534627701226156.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8924021199345342203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3860534627701226156.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(((X("(callToTask.s00003964.inputCriterion.s00001053.used>=1)"))||(G("((callToTask.s00003979.output.s00001054<1)||(callToTask.s000...289
Formula 0 simplified : F(X!"(callToTask.s00003964.inputCriterion.s00001053.used>=1)" & F!"((callToTask.s00003979.output.s00001054<1)||(callToTask.s00003979...277
Detected timeout of ITS tools.
[2024-05-27 03:44:16] [INFO ] Flatten gal took : 8 ms
[2024-05-27 03:44:16] [INFO ] Applying decomposition
[2024-05-27 03:44:16] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4449930383692775265.txt' '-o' '/tmp/graph4449930383692775265.bin' '-w' '/tmp/graph4449930383692775265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4449930383692775265.bin' '-l' '-1' '-v' '-w' '/tmp/graph4449930383692775265.weights' '-q' '0' '-e' '0.001'
[2024-05-27 03:44:16] [INFO ] Decomposing Gal with order
[2024-05-27 03:44:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 03:44:16] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-27 03:44:16] [INFO ] Flatten gal took : 84 ms
[2024-05-27 03:44:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-27 03:44:16] [INFO ] Time to serialize gal into /tmp/LTL15640671643723966758.gal : 12 ms
[2024-05-27 03:44:16] [INFO ] Time to serialize properties into /tmp/LTL4067658972851188452.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15640671643723966758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4067658972851188452.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(((X("(i4.u19.callToTask.s00003964.inputCriterion.s00001053.used>=1)"))||(G("((i11.u31.callToTask.s00003979.output.s00001054<1)||(...330
Formula 0 simplified : F(X!"(i4.u19.callToTask.s00003964.inputCriterion.s00001053.used>=1)" & F!"((i11.u31.callToTask.s00003979.output.s00001054<1)||(i11.u...318
Detected timeout of ITS tools.
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-00 finished in 128634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F((G(p0)&&X(!p1)))&&G(!p2))||G((F(G(p0))&&F(!p1))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 147 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 147 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 147 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 145 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 145 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 144 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 144 transition count 149
Applied a total of 27 rules in 11 ms. Remains 144 /161 variables (removed 17) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 144 cols
[2024-05-27 03:44:31] [INFO ] Computed 6 invariants in 1 ms
[2024-05-27 03:44:31] [INFO ] Implicit Places using invariants in 89 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/161 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 148
Applied a total of 2 rules in 7 ms. Remains 142 /143 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 142 cols
[2024-05-27 03:44:31] [INFO ] Computed 5 invariants in 1 ms
[2024-05-27 03:44:31] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-27 03:44:31] [INFO ] Invariant cache hit.
[2024-05-27 03:44:32] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/161 places, 148/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 332 ms. Remains : 142/161 places, 148/159 transitions.
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-02
Product exploration explored 100000 steps with 624 reset in 515 ms.
Product exploration explored 100000 steps with 641 reset in 265 ms.
Computed a total of 62 stabilizing places and 65 stable transitions
Graph (complete) has 166 edges and 142 vertex of which 98 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.3 ms
Computed a total of 62 stabilizing places and 65 stable transitions
Detected a total of 62/142 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 193 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40002 steps (172 resets) in 172 ms. (231 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (27 resets) in 43 ms. (909 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (26 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
[2024-05-27 03:44:33] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 2/290 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/142 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 45ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (AND p0 (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 25 factoid took 880 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 142 /142 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-27 03:44:35] [INFO ] Invariant cache hit.
[2024-05-27 03:44:35] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-27 03:44:35] [INFO ] Invariant cache hit.
[2024-05-27 03:44:35] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-27 03:44:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/289 variables, 141/146 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/290 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 147 constraints, problems are : Problem set: 0 solved, 147 unsolved in 7007 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 148/289 variables, 141/146 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 147/293 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 1/290 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 294 constraints, problems are : Problem set: 0 solved, 147 unsolved in 13887 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 20914ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 20917ms
Finished structural reductions in LTL mode , in 1 iterations and 21253 ms. Remains : 142/142 places, 148/148 transitions.
Computed a total of 62 stabilizing places and 65 stable transitions
Graph (complete) has 166 edges and 142 vertex of which 98 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 62 stabilizing places and 65 stable transitions
Detected a total of 62/142 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 207 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
RANDOM walk for 40008 steps (170 resets) in 76 ms. (519 steps per ms) remains 2/9 properties
BEST_FIRST walk for 20045 steps (10 resets) in 39 ms. (501 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 692 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Product exploration explored 100000 steps with 630 reset in 175 ms.
Product exploration explored 100000 steps with 632 reset in 194 ms.
Applying partial POR strategy [false, true, false, false, true, false, true]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) p1), (NOT p0), p1, (OR (AND (NOT p0) p2) (AND p1 p2)), p1, (AND (NOT p0) p1), (AND p1 p0)]
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 148/148 transitions.
Graph (trivial) has 121 edges and 142 vertex of which 18 / 142 are part of one of the 1 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 147 edges and 125 vertex of which 81 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 81 transition count 89
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 34 place count 81 transition count 89
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 47 place count 81 transition count 89
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 70 place count 58 transition count 65
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 93 place count 58 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 57 transition count 64
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 57 transition count 64
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 106 place count 57 transition count 65
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 117 place count 46 transition count 54
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 128 place count 46 transition count 54
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 46 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 135 place count 46 transition count 76
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 39 transition count 59
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 39 transition count 59
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 149 rules in 22 ms. Remains 39 /142 variables (removed 103) and now considering 59/148 (removed 89) transitions.
[2024-05-27 03:45:00] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
// Phase 1: matrix 59 rows 39 cols
[2024-05-27 03:45:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 03:45:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 2 (OVERLAPS) 58/96 variables, 38/40 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/40 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 1/97 variables, 1/41 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/41 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1/98 variables, 1/42 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/42 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/42 constraints. Problems are: Problem set: 33 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 42 constraints, problems are : Problem set: 33 solved, 24 unsolved in 732 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 33 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 3/20 variables, 1/2 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 53/73 variables, 20/22 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 24/46 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/46 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 24/97 variables, 19/65 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/65 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 1/98 variables, 1/66 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/66 constraints. Problems are: Problem set: 33 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/98 variables, 0/66 constraints. Problems are: Problem set: 33 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 66 constraints, problems are : Problem set: 33 solved, 24 unsolved in 844 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1594ms problems are : Problem set: 33 solved, 24 unsolved
Search for dead transitions found 33 dead transitions in 1595ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 39/142 places, 26/148 transitions.
Graph (complete) has 32 edges and 39 vertex of which 18 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 5 ms. Remains 17 /39 variables (removed 22) and now considering 27/26 (removed -1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/142 places, 27/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1628 ms. Remains : 17/142 places, 27/148 transitions.
Built C files in :
/tmp/ltsmin15791742530661032156
[2024-05-27 03:45:01] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15791742530661032156
Running compilation step : cd /tmp/ltsmin15791742530661032156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 658 ms.
Running link step : cd /tmp/ltsmin15791742530661032156;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15791742530661032156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6477043395843044210.hoa' '--buchi-type=spotba'
LTSmin run took 2218 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-02 finished in 33042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(!p0)) U (p0&&F(!p0)&&X(X(!p1))))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 159
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 13 place count 148 transition count 154
Iterating global reduction 1 with 5 rules applied. Total rules applied 18 place count 148 transition count 154
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 146 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 146 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 145 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 145 transition count 151
Applied a total of 24 rules in 9 ms. Remains 145 /161 variables (removed 16) and now considering 151/159 (removed 8) transitions.
// Phase 1: matrix 151 rows 145 cols
[2024-05-27 03:45:04] [INFO ] Computed 6 invariants in 1 ms
[2024-05-27 03:45:04] [INFO ] Implicit Places using invariants in 85 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/161 places, 151/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 150
Applied a total of 2 rules in 5 ms. Remains 143 /144 variables (removed 1) and now considering 150/151 (removed 1) transitions.
// Phase 1: matrix 150 rows 143 cols
[2024-05-27 03:45:04] [INFO ] Computed 5 invariants in 2 ms
[2024-05-27 03:45:04] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 03:45:04] [INFO ] Invariant cache hit.
[2024-05-27 03:45:05] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/161 places, 150/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 403 ms. Remains : 143/161 places, 150/159 transitions.
Stuttering acceptance computed with spot in 329 ms :[p1, p0, (OR p0 p1), (OR p1 p0), true, true, true]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-04 finished in 755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 152 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 146 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 146 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 146 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 144 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 143 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 143 transition count 149
Applied a total of 28 rules in 12 ms. Remains 143 /161 variables (removed 18) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 143 cols
[2024-05-27 03:45:05] [INFO ] Computed 5 invariants in 2 ms
[2024-05-27 03:45:05] [INFO ] Implicit Places using invariants in 89 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/161 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 148
Applied a total of 2 rules in 5 ms. Remains 141 /142 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 141 cols
[2024-05-27 03:45:05] [INFO ] Computed 4 invariants in 2 ms
[2024-05-27 03:45:05] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 03:45:05] [INFO ] Invariant cache hit.
[2024-05-27 03:45:05] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/161 places, 148/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 387 ms. Remains : 141/161 places, 148/159 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-05
Entered a terminal (fully accepting) state of product in 78037 steps with 366 reset in 150 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-05 finished in 779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(F(p1) U G(p2))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 121 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 106 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Ensure Unique test removed 6 places
Reduce places removed 7 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 99 transition count 53
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 45 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 43 transition count 50
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 115 place count 43 transition count 37
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 141 place count 30 transition count 37
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 28 transition count 36
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 28 transition count 36
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 154 place count 23 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 157 place count 23 transition count 28
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 163 place count 20 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 20 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 171 place count 20 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 173 place count 19 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 174 place count 18 transition count 23
Ensure Unique test removed 2 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 176 place count 16 transition count 23
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 177 place count 15 transition count 19
Iterating global reduction 7 with 1 rules applied. Total rules applied 178 place count 15 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 179 place count 14 transition count 18
Applied a total of 179 rules in 33 ms. Remains 14 /161 variables (removed 147) and now considering 18/159 (removed 141) transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-05-27 03:45:06] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 03:45:06] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-27 03:45:06] [INFO ] Invariant cache hit.
[2024-05-27 03:45:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 03:45:06] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 87 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/161 places, 18/159 transitions.
Applied a total of 0 rules in 4 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 13/161 places, 18/159 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-06
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-06 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 120 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 90 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 45 output transitions
Drop transitions (Output transitions of discarded places.) removed 45 transitions
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 85 transition count 47
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 37 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 36 transition count 45
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 101 place count 36 transition count 35
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 121 place count 26 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 25 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 25 transition count 34
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 138 place count 17 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 142 place count 17 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 16 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 148 place count 14 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 150 place count 14 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 14 transition count 20
Applied a total of 151 rules in 19 ms. Remains 14 /161 variables (removed 147) and now considering 20/159 (removed 139) transitions.
// Phase 1: matrix 20 rows 14 cols
[2024-05-27 03:45:06] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 03:45:06] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-27 03:45:06] [INFO ] Invariant cache hit.
[2024-05-27 03:45:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 03:45:06] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [5]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/161 places, 19/159 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 18
Applied a total of 1 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 13 cols
[2024-05-27 03:45:06] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 03:45:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-27 03:45:06] [INFO ] Invariant cache hit.
[2024-05-27 03:45:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 03:45:06] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/161 places, 18/159 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 13/161 places, 18/159 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-07
Stuttering criterion allowed to conclude after 35 steps with 1 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-07 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 124 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 90 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 45 output transitions
Drop transitions (Output transitions of discarded places.) removed 45 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 86 transition count 45
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 37 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 100 place count 37 transition count 34
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 122 place count 26 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 25 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 25 transition count 33
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 136 place count 19 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 139 place count 19 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 145 place count 16 transition count 34
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 148 place count 16 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 158 place count 16 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 14 transition count 19
Ensure Unique test removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 163 place count 12 transition count 19
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 11 transition count 14
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 10 transition count 13
Applied a total of 166 rules in 22 ms. Remains 10 /161 variables (removed 151) and now considering 13/159 (removed 146) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-27 03:45:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 03:45:07] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-27 03:45:07] [INFO ] Invariant cache hit.
[2024-05-27 03:45:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 03:45:07] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [2]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 79 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/161 places, 12/159 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 9/161 places, 12/159 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-08
Stuttering criterion allowed to conclude after 42 steps with 2 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-08 finished in 171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X((p2 U (p3||G(p2)))))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 152 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 15 place count 146 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 146 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 146 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 144 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 143 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 143 transition count 149
Applied a total of 28 rules in 11 ms. Remains 143 /161 variables (removed 18) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 143 cols
[2024-05-27 03:45:07] [INFO ] Computed 5 invariants in 3 ms
[2024-05-27 03:45:07] [INFO ] Implicit Places using invariants in 91 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/161 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 148
Applied a total of 2 rules in 4 ms. Remains 141 /142 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 141 cols
[2024-05-27 03:45:07] [INFO ] Computed 4 invariants in 2 ms
[2024-05-27 03:45:07] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 03:45:07] [INFO ] Invariant cache hit.
[2024-05-27 03:45:07] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/161 places, 148/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 376 ms. Remains : 141/161 places, 148/159 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-09
Stuttering criterion allowed to conclude after 1256 steps with 7 reset in 6 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-09 finished in 609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 122 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 92 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 43 output transitions
Drop transitions (Output transitions of discarded places.) removed 43 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 86 transition count 46
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 36 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 103 place count 36 transition count 34
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 125 place count 25 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 24 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 24 transition count 33
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 139 place count 18 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 142 place count 18 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 15 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 159 place count 15 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 14 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 13 transition count 21
Ensure Unique test removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 11 transition count 21
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 10 transition count 16
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 10 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 9 transition count 15
Applied a total of 167 rules in 22 ms. Remains 9 /161 variables (removed 152) and now considering 15/159 (removed 144) transitions.
// Phase 1: matrix 15 rows 9 cols
[2024-05-27 03:45:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 03:45:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-27 03:45:07] [INFO ] Invariant cache hit.
[2024-05-27 03:45:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 03:45:07] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [2]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/161 places, 14/159 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 13
Applied a total of 1 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 8 cols
[2024-05-27 03:45:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-27 03:45:07] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-27 03:45:07] [INFO ] Invariant cache hit.
[2024-05-27 03:45:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 03:45:08] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/161 places, 13/159 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 8/161 places, 13/159 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-10
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-10 finished in 281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(p1)))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 152 transition count 159
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 14 place count 147 transition count 154
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 147 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 147 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 145 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 144 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 144 transition count 150
Applied a total of 26 rules in 11 ms. Remains 144 /161 variables (removed 17) and now considering 150/159 (removed 9) transitions.
// Phase 1: matrix 150 rows 144 cols
[2024-05-27 03:45:08] [INFO ] Computed 5 invariants in 4 ms
[2024-05-27 03:45:08] [INFO ] Implicit Places using invariants in 100 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/161 places, 150/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 149
Applied a total of 2 rules in 4 ms. Remains 142 /143 variables (removed 1) and now considering 149/150 (removed 1) transitions.
// Phase 1: matrix 149 rows 142 cols
[2024-05-27 03:45:08] [INFO ] Computed 4 invariants in 2 ms
[2024-05-27 03:45:08] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 03:45:08] [INFO ] Invariant cache hit.
[2024-05-27 03:45:08] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/161 places, 149/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 142/161 places, 149/159 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-11 finished in 607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||G(p1)||(!p0&&F(p2)))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 159
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 149 transition count 155
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 149 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 149 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 148 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 148 transition count 153
Applied a total of 19 rules in 9 ms. Remains 148 /161 variables (removed 13) and now considering 153/159 (removed 6) transitions.
// Phase 1: matrix 153 rows 148 cols
[2024-05-27 03:45:08] [INFO ] Computed 6 invariants in 5 ms
[2024-05-27 03:45:08] [INFO ] Implicit Places using invariants in 96 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/161 places, 153/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 146 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 146 transition count 152
Applied a total of 2 rules in 8 ms. Remains 146 /147 variables (removed 1) and now considering 152/153 (removed 1) transitions.
// Phase 1: matrix 152 rows 146 cols
[2024-05-27 03:45:08] [INFO ] Computed 5 invariants in 2 ms
[2024-05-27 03:45:08] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-27 03:45:08] [INFO ] Invariant cache hit.
[2024-05-27 03:45:09] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/161 places, 152/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 413 ms. Remains : 146/161 places, 152/159 transitions.
Stuttering acceptance computed with spot in 492 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-13
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-13 finished in 935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(p1&&X((X(p3)&&p2)))))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 153 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 147 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 147 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 147 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 145 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 145 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 144 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 144 transition count 149
Applied a total of 27 rules in 11 ms. Remains 144 /161 variables (removed 17) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 144 cols
[2024-05-27 03:45:09] [INFO ] Computed 6 invariants in 2 ms
[2024-05-27 03:45:09] [INFO ] Implicit Places using invariants in 95 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/161 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 148
Applied a total of 2 rules in 4 ms. Remains 142 /143 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 142 cols
[2024-05-27 03:45:09] [INFO ] Computed 5 invariants in 1 ms
[2024-05-27 03:45:10] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-27 03:45:10] [INFO ] Invariant cache hit.
[2024-05-27 03:45:10] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/161 places, 148/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 416 ms. Remains : 142/161 places, 148/159 transitions.
Stuttering acceptance computed with spot in 509 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p3)), (AND p0 (NOT p3)), true, (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-15 finished in 1066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1)||F(p2))))'
Found a Lengthening insensitive property : IBMB2S565S3960-PT-none-LTLFireability-00
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 161/161 places, 159/159 transitions.
Graph (trivial) has 123 edges and 161 vertex of which 19 / 161 are part of one of the 1 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 179 edges and 143 vertex of which 107 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 101 transition count 55
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 47 transition count 54
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 111 place count 47 transition count 40
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 139 place count 33 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 32 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 32 transition count 39
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 153 place count 26 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 156 place count 26 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 162 place count 23 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 23 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 22 transition count 37
Ensure Unique test removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 167 place count 20 transition count 37
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 168 place count 19 transition count 31
Iterating global reduction 5 with 1 rules applied. Total rules applied 169 place count 19 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 18 transition count 30
Applied a total of 170 rules in 11 ms. Remains 18 /161 variables (removed 143) and now considering 30/159 (removed 129) transitions.
// Phase 1: matrix 30 rows 18 cols
[2024-05-27 03:45:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 03:45:11] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 03:45:11] [INFO ] Invariant cache hit.
[2024-05-27 03:45:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 03:45:11] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [10]
Discarding 1 places :
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 95 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 17/161 places, 26/159 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 108 ms. Remains : 17/161 places, 26/159 transitions.
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLFireability-00
Product exploration explored 100000 steps with 6512 reset in 306 ms.
Product exploration explored 100000 steps with 6518 reset in 300 ms.
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 28 edges and 17 vertex of which 10 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 199 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
RANDOM walk for 40007 steps (2376 resets) in 222 ms. (179 steps per ms) remains 4/10 properties
BEST_FIRST walk for 37008 steps (359 resets) in 72 ms. (506 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 699 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 17 cols
[2024-05-27 03:45:13] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 03:45:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-27 03:45:13] [INFO ] Invariant cache hit.
[2024-05-27 03:45:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 03:45:13] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-27 03:45:13] [INFO ] Invariant cache hit.
[2024-05-27 03:45:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 22/37 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 5/42 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/43 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 17 unsolved in 407 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 22/37 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 5/42 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 37 constraints, problems are : Problem set: 0 solved, 17 unsolved in 440 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 858ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 859ms
Finished structural reductions in LTL mode , in 1 iterations and 939 ms. Remains : 17/17 places, 26/26 transitions.
Computed a total of 4 stabilizing places and 11 stable transitions
Graph (complete) has 28 edges and 17 vertex of which 10 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 349 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
RANDOM walk for 40008 steps (2377 resets) in 257 ms. (155 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40002 steps (387 resets) in 73 ms. (540 steps per ms) remains 1/4 properties
BEST_FIRST walk for 35590 steps (339 resets) in 57 ms. (613 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 809 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Product exploration explored 100000 steps with 6509 reset in 177 ms.
Product exploration explored 100000 steps with 6539 reset in 207 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 26/26 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 17 transition count 21
Applied a total of 5 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/26 (removed 5) transitions.
[2024-05-27 03:45:18] [INFO ] Redundant transitions in 19 ms returned []
Running 17 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 17 cols
[2024-05-27 03:45:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 03:45:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 19/34 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/38 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 20 constraints, problems are : Problem set: 0 solved, 17 unsolved in 353 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 19/34 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/36 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 1/38 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/38 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 37 constraints, problems are : Problem set: 0 solved, 17 unsolved in 481 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 847ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 847ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/17 places, 21/26 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 874 ms. Remains : 17/17 places, 21/26 transitions.
Built C files in :
/tmp/ltsmin14403724785225418790
[2024-05-27 03:45:18] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14403724785225418790
Running compilation step : cd /tmp/ltsmin14403724785225418790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 221 ms.
Running link step : cd /tmp/ltsmin14403724785225418790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14403724785225418790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6919685051626966977.hoa' '--buchi-type=spotba'
LTSmin run took 559 ms.
Treatment of property IBMB2S565S3960-PT-none-LTLFireability-00 finished in 8966 ms.
FORMULA IBMB2S565S3960-PT-none-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-27 03:45:19] [INFO ] Flatten gal took : 16 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 182067 ms.

BK_STOP 1716781519936

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is IBMB2S565S3960-PT-none, 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 r202-smll-171649588000356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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