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.r631-smll-171774446900004.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 ltsminxred
Input is ResIsolation-PT-N08P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r631-smll-171774446900004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 5.5K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 4.1M Jun 7 06:26 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 ResIsolation-PT-N08P1-LTLFireability-00
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-01
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-02
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-03
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-04
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-05
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-06
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-07
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-08
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-09
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-10
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-11
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-12
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-13
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-14
FORMULA_NAME ResIsolation-PT-N08P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717745752044

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N08P1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:35:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 07:35:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:35:55] [INFO ] Load time of PNML (sax parser for PT used): 880 ms
[2024-06-07 07:35:55] [INFO ] Transformed 270 places.
[2024-06-07 07:35:55] [INFO ] Transformed 4850 transitions.
[2024-06-07 07:35:55] [INFO ] Found NUPN structural information;
[2024-06-07 07:35:55] [INFO ] Parsed PT model containing 270 places and 4850 transitions and 83436 arcs in 1319 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ResIsolation-PT-N08P1-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 4850/4850 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 261 transition count 4850
Discarding 151 places :
Symmetric choice reduction at 1 with 151 rule applications. Total rules 160 place count 110 transition count 4699
Iterating global reduction 1 with 151 rules applied. Total rules applied 311 place count 110 transition count 4699
Ensure Unique test removed 773 transitions
Reduce isomorphic transitions removed 773 transitions.
Iterating post reduction 1 with 773 rules applied. Total rules applied 1084 place count 110 transition count 3926
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1100 place count 94 transition count 3910
Iterating global reduction 2 with 16 rules applied. Total rules applied 1116 place count 94 transition count 3910
Applied a total of 1116 rules in 272 ms. Remains 94 /270 variables (removed 176) and now considering 3910/4850 (removed 940) transitions.
// Phase 1: matrix 3910 rows 94 cols
[2024-06-07 07:35:56] [INFO ] Computed 0 invariants in 198 ms
[2024-06-07 07:35:57] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-06-07 07:35:57] [INFO ] Invariant cache hit.
[2024-06-07 07:35:59] [INFO ] Implicit Places using invariants and state equation in 2078 ms returned []
Implicit Place search using SMT with State Equation took 2626 ms to find 0 implicit places.
Running 3909 sub problems to find dead transitions.
[2024-06-07 07:35:59] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3909 unsolved
SMT process timed out in 99555ms, After SMT, problems are : Problem set: 0 solved, 3909 unsolved
Search for dead transitions found 0 dead transitions in 99714ms
Starting structural reductions in LTL mode, iteration 1 : 94/270 places, 3910/4850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102699 ms. Remains : 94/270 places, 3910/4850 transitions.
Support contains 39 out of 94 places after structural reductions.
[2024-06-07 07:37:40] [INFO ] Flatten gal took : 1006 ms
[2024-06-07 07:37:41] [INFO ] Flatten gal took : 581 ms
[2024-06-07 07:37:42] [INFO ] Input system was already deterministic with 3910 transitions.
RANDOM walk for 40000 steps (8 resets) in 3671 ms. (10 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 201835 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :2 out of 26
Probabilistic random walk after 201835 steps, saw 34228 distinct states, run finished after 3006 ms. (steps per millisecond=67 ) properties seen :2
[2024-06-07 07:37:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 3858/3897 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3897 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 42/3939 variables, 22/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3939 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 27/3966 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3966/4004 variables, and 71 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5012 ms.
Refiners :[State Equation: 71/94 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 3858/3897 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3897 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 42/3939 variables, 22/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3939 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 27/3966 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3966 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 21/3987 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3987/4004 variables, and 81 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5017 ms.
Refiners :[State Equation: 81/94 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10749ms problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.82 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 92 transition count 3885
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 38 place count 78 transition count 3885
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 86 place count 54 transition count 3861
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 54 transition count 3859
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 52 transition count 3859
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 51 transition count 3858
Applied a total of 91 rules in 1621 ms. Remains 51 /94 variables (removed 43) and now considering 3858/3910 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1623 ms. Remains : 51/94 places, 3858/3910 transitions.
RANDOM walk for 40000 steps (8 resets) in 3116 ms. (12 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (4 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (1 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (2 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (6 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (3 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (2 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 188633 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :3 out of 23
Probabilistic random walk after 188633 steps, saw 28731 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :3
// Phase 1: matrix 3858 rows 51 cols
[2024-06-07 07:38:03] [INFO ] Computed 9 invariants in 45 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 12/51 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 3858/3909 variables, 51/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3909 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 0/3909 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3909/3909 variables, and 60 constraints, problems are : Problem set: 3 solved, 17 unsolved in 9800 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 16/51 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 3858/3909 variables, 51/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3909 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 0/3909 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3909/3909 variables, and 60 constraints, problems are : Problem set: 3 solved, 17 unsolved in 6942 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 17/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 17489ms problems are : Problem set: 3 solved, 17 unsolved
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 10 properties in 2376 ms.
Support contains 26 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 3858/3858 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 3602
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 3602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 50 transition count 3601
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 50 transition count 3600
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 49 transition count 3600
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 49 transition count 3599
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 49 transition count 3598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 48 transition count 3598
Applied a total of 8 rules in 925 ms. Remains 48 /51 variables (removed 3) and now considering 3598/3858 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 925 ms. Remains : 48/51 places, 3598/3858 transitions.
RANDOM walk for 40000 steps (8 resets) in 2478 ms. (16 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
// Phase 1: matrix 3598 rows 48 cols
[2024-06-07 07:38:25] [INFO ] Computed 9 invariants in 26 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 25/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3598/3646 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3646 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/3646 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3646/3646 variables, and 57 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2715 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 25/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3598/3646 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3646 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/3646 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3646/3646 variables, and 57 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2406 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5363ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 1035 ms.
Support contains 14 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 3598/3598 transitions.
Graph (trivial) has 4 edges and 48 vertex of which 2 / 48 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 47 transition count 3595
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 3595
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 46 transition count 3594
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 261 place count 45 transition count 3338
Applied a total of 261 rules in 1975 ms. Remains 45 /48 variables (removed 3) and now considering 3338/3598 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1976 ms. Remains : 45/48 places, 3338/3598 transitions.
RANDOM walk for 40000 steps (8 resets) in 2524 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 203952 steps, run visited all 2 properties in 2047 ms. (steps per millisecond=99 )
Probabilistic random walk after 203952 steps, saw 34123 distinct states, run finished after 2058 ms. (steps per millisecond=99 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA ResIsolation-PT-N08P1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.93 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(F(p0))&&((!p1||G(p1)) U X(p2))))'
Support contains 20 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 3654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 3654
Applied a total of 2 rules in 37 ms. Remains 93 /94 variables (removed 1) and now considering 3654/3910 (removed 256) transitions.
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 07:38:37] [INFO ] Computed 0 invariants in 88 ms
[2024-06-07 07:38:37] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-06-07 07:38:37] [INFO ] Invariant cache hit.
[2024-06-07 07:38:39] [INFO ] Implicit Places using invariants and state equation in 1868 ms returned []
Implicit Place search using SMT with State Equation took 2432 ms to find 0 implicit places.
Running 3653 sub problems to find dead transitions.
[2024-06-07 07:38:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
SMT process timed out in 94570ms, After SMT, problems are : Problem set: 0 solved, 3653 unsolved
Search for dead transitions found 0 dead transitions in 94653ms
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97157 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 584 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 2308 ms.
Stack based approach found an accepted trace after 63 steps with 1 reset with depth 62 and stack size 62 in 2 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-00 finished in 100192 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((X(G(!p1))||p0))))'
Support contains 10 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 3142
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 3142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 91 transition count 3141
Applied a total of 7 rules in 45 ms. Remains 91 /94 variables (removed 3) and now considering 3141/3910 (removed 769) transitions.
// Phase 1: matrix 3141 rows 91 cols
[2024-06-07 07:40:17] [INFO ] Computed 0 invariants in 29 ms
[2024-06-07 07:40:17] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-06-07 07:40:17] [INFO ] Invariant cache hit.
[2024-06-07 07:40:20] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned []
Implicit Place search using SMT with State Equation took 2813 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 07:40:20] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
SMT process timed out in 86711ms, After SMT, problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 86776ms
Starting structural reductions in LTL mode, iteration 1 : 91/94 places, 3141/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89649 ms. Remains : 91/94 places, 3141/3910 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 1599 ms.
Product exploration explored 100000 steps with 0 reset in 1252 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 648 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.55 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 1583 ms. (25 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 522 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 273403 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :1 out of 2
Probabilistic random walk after 273403 steps, saw 45078 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :1
[2024-06-07 07:41:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/3162 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/3191 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3191 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/3213 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/3230 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3230 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3232 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3232/3232 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1444 ms.
Refiners :[State Equation: 91/91 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/3162 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/3191 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3191 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/3213 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/3230 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3230 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3232 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3232/3232 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1307 ms.
Refiners :[State Equation: 91/91 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2802ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 155 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 3141/3141 transitions.
Applied a total of 0 rules in 25 ms. Remains 91 /91 variables (removed 0) and now considering 3141/3141 (removed 0) transitions.
[2024-06-07 07:41:57] [INFO ] Invariant cache hit.
[2024-06-07 07:41:58] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-06-07 07:41:58] [INFO ] Invariant cache hit.
[2024-06-07 07:41:59] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2216 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 07:41:59] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
SMT process timed out in 83545ms, After SMT, problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 83580ms
Finished structural reductions in LTL mode , in 1 iterations and 85830 ms. Remains : 91/91 places, 3141/3141 transitions.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 648 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.52 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 1151 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 438 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 383 ms. (104 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 263611 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :1 out of 2
Probabilistic random walk after 263611 steps, saw 44121 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :1
[2024-06-07 07:43:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/3162 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/3191 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3191 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/3213 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/3230 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3230 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3232 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3232/3232 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1582 ms.
Refiners :[State Equation: 91/91 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/3162 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/3191 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3191 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/3213 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3213 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/3230 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3230 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3232 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3232 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3232/3232 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1826 ms.
Refiners :[State Equation: 91/91 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3461ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 164 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 161 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 1642 ms.
Product exploration explored 100000 steps with 0 reset in 1588 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 124 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 3141/3141 transitions.
Graph (complete) has 648 edges and 91 vertex of which 89 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.102 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 89 transition count 3139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 89 transition count 3137
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 10 place count 89 transition count 3146
Deduced a syphon composed of 16 places in 3 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 19 place count 89 transition count 3146
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 23 place count 85 transition count 3142
Deduced a syphon composed of 12 places in 3 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 85 transition count 3142
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 46 place count 85 transition count 3143
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 82 transition count 3139
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 82 transition count 3139
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 82 transition count 3174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 79 transition count 3168
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 79 transition count 3168
Deduced a syphon composed of 28 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 79 transition count 3167
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 62 rules in 1089 ms. Remains 79 /91 variables (removed 12) and now considering 3167/3141 (removed -26) transitions.
[2024-06-07 07:43:48] [INFO ] Redundant transitions in 11828 ms returned []
Running 3151 sub problems to find dead transitions.
// Phase 1: matrix 3167 rows 79 cols
[2024-06-07 07:43:48] [INFO ] Computed 0 invariants in 26 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3151 unsolved
SMT process timed out in 86649ms, After SMT, problems are : Problem set: 0 solved, 3151 unsolved
Search for dead transitions found 0 dead transitions in 86704ms
Starting structural reductions in SI_LTL mode, iteration 1 : 79/91 places, 3167/3141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99641 ms. Remains : 79/91 places, 3167/3141 transitions.
Support contains 10 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 3141/3141 transitions.
Applied a total of 0 rules in 35 ms. Remains 91 /91 variables (removed 0) and now considering 3141/3141 (removed 0) transitions.
// Phase 1: matrix 3141 rows 91 cols
[2024-06-07 07:45:15] [INFO ] Computed 0 invariants in 52 ms
[2024-06-07 07:45:15] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-06-07 07:45:15] [INFO ] Invariant cache hit.
[2024-06-07 07:45:17] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 2393 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 07:45:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
SMT process timed out in 84535ms, After SMT, problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 84573ms
Finished structural reductions in LTL mode , in 1 iterations and 87010 ms. Remains : 91/91 places, 3141/3141 transitions.
Treatment of property ResIsolation-PT-N08P1-LTLFireability-03 finished in 386369 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))))'
Support contains 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (trivial) has 53 edges and 94 vertex of which 6 / 94 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 670 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 87 transition count 3896
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 80 transition count 3896
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 16 place count 80 transition count 3887
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 34 place count 71 transition count 3887
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 68 transition count 3119
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 68 transition count 3119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 68 transition count 3116
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 43 place count 68 transition count 3113
Deduced a syphon composed of 3 places in 12 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 49 place count 65 transition count 3113
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 75 place count 52 transition count 3100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 81 place count 49 transition count 3108
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 49 transition count 3107
Applied a total of 82 rules in 2248 ms. Remains 49 /94 variables (removed 45) and now considering 3107/3910 (removed 803) transitions.
[2024-06-07 07:46:45] [INFO ] Flow matrix only has 3106 transitions (discarded 1 similar events)
// Phase 1: matrix 3106 rows 49 cols
[2024-06-07 07:46:46] [INFO ] Computed 0 invariants in 42 ms
[2024-06-07 07:46:46] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-06-07 07:46:46] [INFO ] Flow matrix only has 3106 transitions (discarded 1 similar events)
[2024-06-07 07:46:46] [INFO ] Invariant cache hit.
[2024-06-07 07:46:48] [INFO ] State equation strengthened by 2299 read => feed constraints.
[2024-06-07 07:46:53] [INFO ] Implicit Places using invariants and state equation in 6902 ms returned []
Implicit Place search using SMT with State Equation took 7378 ms to find 0 implicit places.
[2024-06-07 07:47:04] [INFO ] Redundant transitions in 10902 ms returned []
Running 3089 sub problems to find dead transitions.
[2024-06-07 07:47:04] [INFO ] Flow matrix only has 3106 transitions (discarded 1 similar events)
[2024-06-07 07:47:04] [INFO ] Invariant cache hit.
[2024-06-07 07:47:04] [INFO ] State equation strengthened by 2299 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3089 unsolved
At refinement iteration 1 (OVERLAPS) 3104/3151 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3089 unsolved
SMT process timed out in 86101ms, After SMT, problems are : Problem set: 0 solved, 3089 unsolved
Search for dead transitions found 0 dead transitions in 86136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/94 places, 3107/3910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106681 ms. Remains : 49/94 places, 3107/3910 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-04 finished in 106864 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)||(!p1 U (G(!p1)||(!p1&&G(!p0)))))))'
Support contains 16 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 3654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 3654
Applied a total of 2 rules in 58 ms. Remains 93 /94 variables (removed 1) and now considering 3654/3910 (removed 256) transitions.
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 07:48:30] [INFO ] Computed 0 invariants in 62 ms
[2024-06-07 07:48:31] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-06-07 07:48:31] [INFO ] Invariant cache hit.
[2024-06-07 07:48:33] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 2676 ms to find 0 implicit places.
Running 3653 sub problems to find dead transitions.
[2024-06-07 07:48:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
At refinement iteration 1 (OVERLAPS) 3654/3746 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3746/3747 variables, and 92 constraints, problems are : Problem set: 0 solved, 3653 unsolved in 30063 ms.
Refiners :[State Equation: 92/93 constraints, PredecessorRefiner: 3653/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3653 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
At refinement iteration 1 (OVERLAPS) 3654/3746 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3746 variables, 57/149 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3746/3747 variables, and 149 constraints, problems are : Problem set: 0 solved, 3653 unsolved in 30062 ms.
Refiners :[State Equation: 92/93 constraints, PredecessorRefiner: 3653/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 121985ms problems are : Problem set: 0 solved, 3653 unsolved
Search for dead transitions found 0 dead transitions in 122055ms
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124807 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 327 ms :[true, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), (NOT p0), (AND p1 p0), p0]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 1496 ms.
Product exploration explored 100000 steps with 0 reset in 1647 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 667 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.65 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 129 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[true, p1, (AND p1 p0), p0]
RANDOM walk for 40000 steps (8 resets) in 1242 ms. (32 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 979 ms. (40 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1478 ms. (27 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 642 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1159 ms. (34 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 992 ms. (40 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 516 ms. (77 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 401439 steps, run timeout after 6001 ms. (steps per millisecond=66 ) properties seen :3 out of 6
Probabilistic random walk after 401439 steps, saw 60506 distinct states, run finished after 6001 ms. (steps per millisecond=66 ) properties seen :3
[2024-06-07 07:50:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3585/3601 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 75/3676 variables, 41/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3676 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/3703 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3703 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 23/3726 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3726 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 19/3745 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3745 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 11 (OVERLAPS) 2/3747 variables, 2/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3747/3747 variables, and 93 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2580 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3585/3601 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 75/3676 variables, 41/57 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3676 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/3703 variables, 11/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3703 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 23/3726 variables, 10/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3726 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 19/3745 variables, 13/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3745 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3747 variables, 2/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3747/3747 variables, and 93 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2415 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5083ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 54 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 510 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[true, p0, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 163 ms :[true, p0, p1, (AND p0 p1)]
Support contains 16 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 3654/3654 transitions.
Graph (trivial) has 52 edges and 93 vertex of which 6 / 93 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 661 edges and 89 vertex of which 87 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.25 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 86 transition count 3641
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 80 transition count 3640
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 15 place count 80 transition count 3629
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 37 place count 69 transition count 3629
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 56 transition count 3616
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 53 transition count 3624
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 53 transition count 3623
Applied a total of 70 rules in 3492 ms. Remains 53 /93 variables (removed 40) and now considering 3623/3654 (removed 31) transitions.
[2024-06-07 07:50:57] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
// Phase 1: matrix 3622 rows 53 cols
[2024-06-07 07:50:57] [INFO ] Computed 0 invariants in 37 ms
[2024-06-07 07:50:57] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-06-07 07:50:57] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 07:50:57] [INFO ] Invariant cache hit.
[2024-06-07 07:50:59] [INFO ] State equation strengthened by 3067 read => feed constraints.
[2024-06-07 07:51:09] [INFO ] Implicit Places using invariants and state equation in 11454 ms returned []
Implicit Place search using SMT with State Equation took 11912 ms to find 0 implicit places.
[2024-06-07 07:51:20] [INFO ] Redundant transitions in 11736 ms returned []
Running 3605 sub problems to find dead transitions.
[2024-06-07 07:51:20] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 07:51:20] [INFO ] Invariant cache hit.
[2024-06-07 07:51:22] [INFO ] State equation strengthened by 3067 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3605 unsolved
SMT process timed out in 93393ms, After SMT, problems are : Problem set: 0 solved, 3605 unsolved
Search for dead transitions found 0 dead transitions in 93433ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/93 places, 3623/3654 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120595 ms. Remains : 53/93 places, 3623/3654 transitions.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 205 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[true, p0, p1, (AND p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 4920 ms. (8 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 852 ms. (46 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1348 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1433 ms. (27 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 847 ms. (47 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1204 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 986 ms. (40 steps per ms) remains 6/6 properties
Probably explored full state space saw : 62991 states, properties seen :5
Probabilistic random walk after 446489 steps, saw 62991 distinct states, run finished after 4773 ms. (steps per millisecond=93 ) properties seen :5
Explored full state space saw : 62991 states, properties seen :0
Exhaustive walk after 446489 steps, saw 62991 distinct states, run finished after 3435 ms. (steps per millisecond=129 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 473 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[true, p0, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 172 ms :[true, p0, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 166 ms :[true, p0, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 0 reset in 1889 ms.
Product exploration explored 100000 steps with 0 reset in 2033 ms.
Support contains 16 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 3623/3623 transitions.
Applied a total of 0 rules in 1371 ms. Remains 53 /53 variables (removed 0) and now considering 3623/3623 (removed 0) transitions.
[2024-06-07 07:53:13] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 07:53:13] [INFO ] Invariant cache hit.
[2024-06-07 07:53:13] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-06-07 07:53:13] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 07:53:13] [INFO ] Invariant cache hit.
[2024-06-07 07:53:16] [INFO ] State equation strengthened by 3067 read => feed constraints.
[2024-06-07 07:53:24] [INFO ] Implicit Places using invariants and state equation in 10957 ms returned []
Implicit Place search using SMT with State Equation took 11364 ms to find 0 implicit places.
[2024-06-07 07:53:35] [INFO ] Redundant transitions in 10782 ms returned []
Running 3605 sub problems to find dead transitions.
[2024-06-07 07:53:35] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 07:53:35] [INFO ] Invariant cache hit.
[2024-06-07 07:53:37] [INFO ] State equation strengthened by 3067 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3605 unsolved
SMT process timed out in 93913ms, After SMT, problems are : Problem set: 0 solved, 3605 unsolved
Search for dead transitions found 0 dead transitions in 93957ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 117494 ms. Remains : 53/53 places, 3623/3623 transitions.
Treatment of property ResIsolation-PT-N08P1-LTLFireability-05 finished in 399739 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(F(p0)))'
Support contains 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 3142
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 3142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 91 transition count 3141
Applied a total of 7 rules in 68 ms. Remains 91 /94 variables (removed 3) and now considering 3141/3910 (removed 769) transitions.
// Phase 1: matrix 3141 rows 91 cols
[2024-06-07 07:55:10] [INFO ] Computed 0 invariants in 40 ms
[2024-06-07 07:55:10] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-06-07 07:55:10] [INFO ] Invariant cache hit.
[2024-06-07 07:55:12] [INFO ] Implicit Places using invariants and state equation in 1882 ms returned []
Implicit Place search using SMT with State Equation took 2404 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 07:55:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
At refinement iteration 1 (OVERLAPS) 3141/3231 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3231/3232 variables, and 90 constraints, problems are : Problem set: 0 solved, 3140 unsolved in 30055 ms.
Refiners :[State Equation: 90/91 constraints, PredecessorRefiner: 3140/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
At refinement iteration 1 (OVERLAPS) 3141/3231 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3231 variables, 56/146 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3231/3232 variables, and 146 constraints, problems are : Problem set: 0 solved, 3140 unsolved in 30082 ms.
Refiners :[State Equation: 90/91 constraints, PredecessorRefiner: 3140/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 115793ms problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 115848ms
Starting structural reductions in LTL mode, iteration 1 : 91/94 places, 3141/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118333 ms. Remains : 91/94 places, 3141/3910 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 1739 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-06 finished in 120221 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(F(p0)))'
Support contains 9 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 91 transition count 3142
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 3142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 91 transition count 3141
Applied a total of 7 rules in 75 ms. Remains 91 /94 variables (removed 3) and now considering 3141/3910 (removed 769) transitions.
[2024-06-07 07:57:10] [INFO ] Invariant cache hit.
[2024-06-07 07:57:11] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-06-07 07:57:11] [INFO ] Invariant cache hit.
[2024-06-07 07:57:13] [INFO ] Implicit Places using invariants and state equation in 2038 ms returned []
Implicit Place search using SMT with State Equation took 2598 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 07:57:13] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3140 unsolved
SMT process timed out in 84501ms, After SMT, problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 84562ms
Starting structural reductions in LTL mode, iteration 1 : 91/94 places, 3141/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87247 ms. Remains : 91/94 places, 3141/3910 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 1645 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 1 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-07 finished in 89037 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(G(!p1)))))'
Support contains 14 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 91 transition count 3901
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 85 transition count 3901
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 85 transition count 3892
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 76 transition count 3892
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 74 transition count 3380
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 74 transition count 3380
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 74 transition count 3378
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 37 place count 74 transition count 3376
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 41 place count 72 transition count 3376
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 71 place count 57 transition count 3361
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 77 place count 54 transition count 3369
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 54 transition count 3368
Applied a total of 78 rules in 814 ms. Remains 54 /94 variables (removed 40) and now considering 3368/3910 (removed 542) transitions.
// Phase 1: matrix 3368 rows 54 cols
[2024-06-07 07:58:40] [INFO ] Computed 0 invariants in 50 ms
[2024-06-07 07:58:40] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-06-07 07:58:40] [INFO ] Invariant cache hit.
[2024-06-07 07:58:42] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
[2024-06-07 07:58:53] [INFO ] Redundant transitions in 10962 ms returned []
Running 3350 sub problems to find dead transitions.
[2024-06-07 07:58:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3350 unsolved
At refinement iteration 1 (OVERLAPS) 3367/3419 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3419/3422 variables, and 52 constraints, problems are : Problem set: 0 solved, 3350 unsolved in 30052 ms.
Refiners :[State Equation: 52/54 constraints, PredecessorRefiner: 3350/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3350 unsolved
At refinement iteration 1 (OVERLAPS) 3367/3419 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3419 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 3350 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3419/3422 variables, and 63 constraints, problems are : Problem set: 0 solved, 3350 unsolved in 30058 ms.
Refiners :[State Equation: 52/54 constraints, PredecessorRefiner: 3350/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 117784ms problems are : Problem set: 0 solved, 3350 unsolved
Search for dead transitions found 0 dead transitions in 117822ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/94 places, 3368/3910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131933 ms. Remains : 54/94 places, 3368/3910 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 1841 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-09 finished in 133928 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(((F(!p0)&&F(!p1))||G((!p2||(F(!p0)&&F(!p1))))||(!p2&&F(!p0))))))'
Support contains 20 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 91 transition count 3901
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 85 transition count 3901
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 85 transition count 3892
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 76 transition count 3892
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 75 transition count 3636
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 75 transition count 3636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 75 transition count 3635
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 34 place count 75 transition count 3634
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 74 transition count 3634
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 66 place count 59 transition count 3619
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 72 place count 56 transition count 3627
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 56 transition count 3626
Applied a total of 73 rules in 737 ms. Remains 56 /94 variables (removed 38) and now considering 3626/3910 (removed 284) transitions.
// Phase 1: matrix 3626 rows 56 cols
[2024-06-07 08:00:54] [INFO ] Computed 0 invariants in 50 ms
[2024-06-07 08:00:54] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-06-07 08:00:54] [INFO ] Invariant cache hit.
[2024-06-07 08:00:56] [INFO ] Implicit Places using invariants and state equation in 2035 ms returned []
Implicit Place search using SMT with State Equation took 2528 ms to find 0 implicit places.
[2024-06-07 08:01:09] [INFO ] Redundant transitions in 12423 ms returned []
Running 3608 sub problems to find dead transitions.
[2024-06-07 08:01:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3608 unsolved
SMT process timed out in 94388ms, After SMT, problems are : Problem set: 0 solved, 3608 unsolved
Search for dead transitions found 0 dead transitions in 94429ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/94 places, 3626/3910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110140 ms. Remains : 56/94 places, 3626/3910 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (AND p0 p2) (AND p1 p2)), (AND p2 p0), (AND p1 p2), (AND p2 p0 p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 2225 ms.
Product exploration explored 100000 steps with 0 reset in 2062 ms.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 145 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (AND p0 p2) (AND p1 p2)), (AND p2 p0), (AND p1 p2), (AND p2 p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 2028 ms. (19 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 987 ms. (40 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 826 ms. (48 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 927 ms. (43 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1244 ms. (32 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1006 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1021 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 840 ms. (47 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 799 ms. (50 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 615484 steps, run timeout after 9001 ms. (steps per millisecond=68 ) properties seen :4 out of 8
Probabilistic random walk after 615484 steps, saw 89070 distinct states, run finished after 9002 ms. (steps per millisecond=68 ) properties seen :4
[2024-06-07 08:03:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3616 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3616 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 54/3670 variables, 30/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3670 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 3682/3682 variables, and 56 constraints, problems are : Problem set: 4 solved, 0 unsolved in 1629 ms.
Refiners :[State Equation: 56/56 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1732ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p2 (NOT p0) (NOT p1))), (G (OR (NOT p2) (NOT p0))), (G (OR (NOT p2) (NOT p0) (NOT p1))), (G (OR (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p2 (NOT p0)))), (F p2), (F p1)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 23 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P1-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P1-LTLFireability-11 finished in 128974 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(((X(p1) U p2) U !p3))) U p4))'
Support contains 25 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 3654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 3654
Applied a total of 2 rules in 48 ms. Remains 93 /94 variables (removed 1) and now considering 3654/3910 (removed 256) transitions.
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 08:03:02] [INFO ] Computed 0 invariants in 35 ms
[2024-06-07 08:03:02] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-06-07 08:03:02] [INFO ] Invariant cache hit.
[2024-06-07 08:03:04] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 2206 ms to find 0 implicit places.
Running 3653 sub problems to find dead transitions.
[2024-06-07 08:03:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
SMT process timed out in 92133ms, After SMT, problems are : Problem set: 0 solved, 3653 unsolved
Search for dead transitions found 0 dead transitions in 92202ms
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94467 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 1433 ms.
Product exploration explored 100000 steps with 0 reset in 1457 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 667 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.37 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT p4)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p4) p3 (NOT p2)))), (X (NOT (AND (NOT p4) p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 216 ms. Reduced automaton from 6 states, 14 edges and 5 AP (stutter sensitive) to 6 states, 14 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
RANDOM walk for 40000 steps (8 resets) in 3747 ms. (10 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 702 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 645 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 751 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 736 ms. (54 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 667 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 589 ms. (67 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 875 ms. (45 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 780 ms. (51 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 649 ms. (61 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 516887 steps, run timeout after 9001 ms. (steps per millisecond=57 ) properties seen :0 out of 9
Probabilistic random walk after 516887 steps, saw 77099 distinct states, run finished after 9001 ms. (steps per millisecond=57 ) properties seen :0
[2024-06-07 08:04:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 3598/3623 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3623 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 57/3680 variables, 34/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3680 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 29/3709 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3709 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 21/3730 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3730 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 16/3746 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3746 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/3747 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3747/3747 variables, and 93 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5020 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 3598/3623 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3623 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 57/3680 variables, 34/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3680 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 29/3709 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3709 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 21/3730 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3730 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 16/3746 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3746 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/3747 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/3747 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3747/3747 variables, and 93 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4858 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10079ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
Finished Parikh walk after 53 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 9 properties in 1012 ms.
Knowledge obtained : [(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT p4)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p4) p3 (NOT p2)))), (X (NOT (AND (NOT p4) p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p4), (F (NOT (OR p2 (NOT p3) p4))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p2 (NOT p1)))), (F p2), (F p3), (F (NOT (OR (NOT p3) p4))), (F p1), (F p0)]
Knowledge based reduction with 19 factoid took 441 ms. Reduced automaton from 6 states, 14 edges and 5 AP (stutter sensitive) to 6 states, 14 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
Stuttering acceptance computed with spot in 231 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
[2024-06-07 08:05:04] [INFO ] Invariant cache hit.
Proved EG (NOT p4)
Knowledge obtained : [(AND (NOT p4) (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2)))), (X (NOT p4)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p4) p3 (NOT p2)))), (X (NOT (AND (NOT p4) p3))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p4), (F (NOT (OR p2 (NOT p3) p4))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p2 (NOT p1)))), (F p2), (F p3), (F (NOT (OR (NOT p3) p4))), (F p1), (F p0), (G (NOT p4))]
Property proved to be false thanks to negative knowledge :(G (NOT p4))
Knowledge based reduction with 19 factoid took 460 ms. Reduced automaton from 6 states, 14 edges and 5 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P1-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P1-LTLFireability-12 finished in 124763 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((X(p0)&&(p1||F(G(p2))))))'
Support contains 13 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 92 transition count 3398
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 92 transition count 3398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 92 transition count 3397
Applied a total of 5 rules in 42 ms. Remains 92 /94 variables (removed 2) and now considering 3397/3910 (removed 513) transitions.
// Phase 1: matrix 3397 rows 92 cols
[2024-06-07 08:05:07] [INFO ] Computed 0 invariants in 46 ms
[2024-06-07 08:05:07] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-06-07 08:05:07] [INFO ] Invariant cache hit.
[2024-06-07 08:05:09] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2054 ms to find 0 implicit places.
Running 3396 sub problems to find dead transitions.
[2024-06-07 08:05:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3396 unsolved
At refinement iteration 1 (OVERLAPS) 3397/3488 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 3396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3488/3489 variables, and 91 constraints, problems are : Problem set: 0 solved, 3396 unsolved in 30056 ms.
Refiners :[State Equation: 91/92 constraints, PredecessorRefiner: 3396/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3396 unsolved
At refinement iteration 1 (OVERLAPS) 3397/3488 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 3396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3488 variables, 56/147 constraints. Problems are: Problem set: 0 solved, 3396 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3488/3489 variables, and 147 constraints, problems are : Problem set: 0 solved, 3396 unsolved in 30055 ms.
Refiners :[State Equation: 91/92 constraints, PredecessorRefiner: 3396/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 118196ms problems are : Problem set: 0 solved, 3396 unsolved
Search for dead transitions found 0 dead transitions in 118250ms
Starting structural reductions in LTL mode, iteration 1 : 92/94 places, 3397/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120352 ms. Remains : 92/94 places, 3397/3910 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 1419 ms.
Product exploration explored 100000 steps with 1 reset in 1382 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 657 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.33 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X p2), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 110 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 4141 ms. (9 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 599 ms. (66 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1196 ms. (33 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 642 ms. (62 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 688 ms. (58 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 759 ms. (52 steps per ms) remains 5/5 properties
[2024-06-07 08:07:13] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3339/3352 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3352 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/3422 variables, 45/58 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3422 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 29/3451 variables, 11/69 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3451 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 21/3472 variables, 10/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3472 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 16/3488 variables, 12/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3488 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/3489 variables, 1/92 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3489 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3489 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3489/3489 variables, and 92 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1901 ms.
Refiners :[State Equation: 92/92 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3339/3352 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3352 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 70/3422 variables, 45/58 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3422 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 29/3451 variables, 11/69 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3451 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 21/3472 variables, 10/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3472 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 16/3488 variables, 12/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3488 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 11 (OVERLAPS) 1/3489 variables, 1/92 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3489 variables, 0/92 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3489 variables, 0/92 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3489/3489 variables, and 92 constraints, problems are : Problem set: 4 solved, 1 unsolved in 1719 ms.
Refiners :[State Equation: 92/92 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3752ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 55 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 5 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X p2), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR p1 p2)), (G (OR (NOT p1) (NOT p2))), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p1)]
Knowledge based reduction with 25 factoid took 362 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2024-06-07 08:07:18] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X p2), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR p1 p2)), (G (OR (NOT p1) (NOT p2))), (G (OR p0 p1 p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p1), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 25 factoid took 393 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P1-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P1-LTLFireability-13 finished in 132958 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' '!(((p0||X(p1)) U p2))'
Support contains 17 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 93 transition count 3654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 93 transition count 3654
Applied a total of 2 rules in 36 ms. Remains 93 /94 variables (removed 1) and now considering 3654/3910 (removed 256) transitions.
// Phase 1: matrix 3654 rows 93 cols
[2024-06-07 08:07:20] [INFO ] Computed 0 invariants in 36 ms
[2024-06-07 08:07:20] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-06-07 08:07:20] [INFO ] Invariant cache hit.
[2024-06-07 08:07:22] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
Running 3653 sub problems to find dead transitions.
[2024-06-07 08:07:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
At refinement iteration 1 (OVERLAPS) 3654/3746 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3746/3747 variables, and 92 constraints, problems are : Problem set: 0 solved, 3653 unsolved in 30088 ms.
Refiners :[State Equation: 92/93 constraints, PredecessorRefiner: 3653/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3653 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
At refinement iteration 1 (OVERLAPS) 3654/3746 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3746 variables, 57/149 constraints. Problems are: Problem set: 0 solved, 3653 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3746/3747 variables, and 149 constraints, problems are : Problem set: 0 solved, 3653 unsolved in 30067 ms.
Refiners :[State Equation: 92/93 constraints, PredecessorRefiner: 3653/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 122612ms problems are : Problem set: 0 solved, 3653 unsolved
Search for dead transitions found 0 dead transitions in 122664ms
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124736 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-14 finished in 124855 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((X(G(!p1))||p0))))'
Found a Lengthening insensitive property : ResIsolation-PT-N08P1-LTLFireability-03
Stuttering acceptance computed with spot in 115 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 94 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 94/94 places, 3910/3910 transitions.
Graph (complete) has 676 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.24 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 91 transition count 3900
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 84 transition count 3900
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 15 place count 84 transition count 3891
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 33 place count 75 transition count 3891
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 72 transition count 3123
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 72 transition count 3123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 72 transition count 3120
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 42 place count 72 transition count 3117
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 69 transition count 3117
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 78 place count 54 transition count 3102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 51 transition count 3110
Applied a total of 84 rules in 358 ms. Remains 51 /94 variables (removed 43) and now considering 3110/3910 (removed 800) transitions.
// Phase 1: matrix 3110 rows 51 cols
[2024-06-07 08:09:25] [INFO ] Computed 0 invariants in 28 ms
[2024-06-07 08:09:26] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-07 08:09:26] [INFO ] Invariant cache hit.
[2024-06-07 08:09:27] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 1851 ms to find 0 implicit places.
Running 3092 sub problems to find dead transitions.
[2024-06-07 08:09:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 1 (OVERLAPS) 3109/3158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3158/3161 variables, and 49 constraints, problems are : Problem set: 0 solved, 3092 unsolved in 30052 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 1 (OVERLAPS) 3109/3158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3158 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3158/3161 variables, and 57 constraints, problems are : Problem set: 0 solved, 3092 unsolved in 30051 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 114854ms problems are : Problem set: 0 solved, 3092 unsolved
Search for dead transitions found 0 dead transitions in 114890ms
Starting structural reductions in LI_LTL mode, iteration 1 : 51/94 places, 3110/3910 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 117104 ms. Remains : 51/94 places, 3110/3910 transitions.
Running random walk in product with property : ResIsolation-PT-N08P1-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 2005 ms.
Product exploration explored 100000 steps with 0 reset in 1954 ms.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 2134 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 475 ms. (84 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 324699 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :1 out of 2
Probabilistic random walk after 324699 steps, saw 49394 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :1
[2024-06-07 08:11:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/3149 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3149 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/3161 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3161/3161 variables, and 51 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1221 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/3149 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3149 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/3161 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3161/3161 variables, and 51 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1136 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2395ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 115 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 3110/3110 transitions.
Applied a total of 0 rules in 16 ms. Remains 51 /51 variables (removed 0) and now considering 3110/3110 (removed 0) transitions.
[2024-06-07 08:11:33] [INFO ] Invariant cache hit.
[2024-06-07 08:11:33] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-07 08:11:33] [INFO ] Invariant cache hit.
[2024-06-07 08:11:35] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
Running 3092 sub problems to find dead transitions.
[2024-06-07 08:11:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 1 (OVERLAPS) 3109/3158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3158/3161 variables, and 49 constraints, problems are : Problem set: 0 solved, 3092 unsolved in 30057 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 1 (OVERLAPS) 3109/3158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3158 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3158/3161 variables, and 57 constraints, problems are : Problem set: 0 solved, 3092 unsolved in 30051 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 114850ms problems are : Problem set: 0 solved, 3092 unsolved
Search for dead transitions found 0 dead transitions in 114898ms
Finished structural reductions in LTL mode , in 1 iterations and 116742 ms. Remains : 51/51 places, 3110/3110 transitions.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 2054 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 430 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 569 ms. (70 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 325897 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :1 out of 2
Probabilistic random walk after 325897 steps, saw 49579 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :1
[2024-06-07 08:13:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/3149 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3149 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/3161 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3161/3161 variables, and 51 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1263 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3077/3086 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3086 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/3149 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3149 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/3161 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3161 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3161/3161 variables, and 51 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1158 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2460ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 116 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 270 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 1957 ms.
Product exploration explored 100000 steps with 0 reset in 1948 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 117 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 3110/3110 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 51 transition count 3109
Applied a total of 1 rules in 334 ms. Remains 51 /51 variables (removed 0) and now considering 3109/3110 (removed 1) transitions.
[2024-06-07 08:13:52] [INFO ] Redundant transitions in 10674 ms returned []
Running 3091 sub problems to find dead transitions.
// Phase 1: matrix 3109 rows 51 cols
[2024-06-07 08:13:52] [INFO ] Computed 0 invariants in 28 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3091 unsolved
At refinement iteration 1 (OVERLAPS) 3108/3157 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3091 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3157/3160 variables, and 49 constraints, problems are : Problem set: 0 solved, 3091 unsolved in 30065 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3091/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3091 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3091 unsolved
At refinement iteration 1 (OVERLAPS) 3108/3157 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3091 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3157 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 3091 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3157/3160 variables, and 57 constraints, problems are : Problem set: 0 solved, 3091 unsolved in 30050 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3091/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 115791ms problems are : Problem set: 0 solved, 3091 unsolved
Search for dead transitions found 0 dead transitions in 115828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/51 places, 3109/3110 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126848 ms. Remains : 51/51 places, 3109/3110 transitions.
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 3110/3110 transitions.
Applied a total of 0 rules in 15 ms. Remains 51 /51 variables (removed 0) and now considering 3110/3110 (removed 0) transitions.
// Phase 1: matrix 3110 rows 51 cols
[2024-06-07 08:15:48] [INFO ] Computed 0 invariants in 26 ms
[2024-06-07 08:15:48] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-07 08:15:48] [INFO ] Invariant cache hit.
[2024-06-07 08:15:50] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 1976 ms to find 0 implicit places.
Running 3092 sub problems to find dead transitions.
[2024-06-07 08:15:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 1 (OVERLAPS) 3109/3158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3158/3161 variables, and 49 constraints, problems are : Problem set: 0 solved, 3092 unsolved in 30080 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3092 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 1 (OVERLAPS) 3109/3158 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3158 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 3092 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3158/3161 variables, and 57 constraints, problems are : Problem set: 0 solved, 3092 unsolved in 30052 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 114126ms problems are : Problem set: 0 solved, 3092 unsolved
Search for dead transitions found 0 dead transitions in 114163ms
Finished structural reductions in LTL mode , in 1 iterations and 116160 ms. Remains : 51/51 places, 3110/3110 transitions.
Treatment of property ResIsolation-PT-N08P1-LTLFireability-03 finished in 500137 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)||(!p1 U (G(!p1)||(!p1&&G(!p0)))))))'
[2024-06-07 08:17:46] [INFO ] Flatten gal took : 746 ms
[2024-06-07 08:17:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-07 08:17:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 3910 transitions and 69187 arcs took 72 ms.
Total runtime 2511754 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024

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="ResIsolation-PT-N08P1"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ResIsolation-PT-N08P1, 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 r631-smll-171774446900004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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