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.r627-smll-171774445400004.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 greatspnxred
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 r627-smll-171774445400004
=====================================================================

--------------------
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 1717748932301

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 08:28:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 08:28:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 08:28:56] [INFO ] Load time of PNML (sax parser for PT used): 836 ms
[2024-06-07 08:28:56] [INFO ] Transformed 270 places.
[2024-06-07 08:28:56] [INFO ] Transformed 4850 transitions.
[2024-06-07 08:28:56] [INFO ] Found NUPN structural information;
[2024-06-07 08:28:56] [INFO ] Parsed PT model containing 270 places and 4850 transitions and 83436 arcs in 1193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 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 233 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 08:28:57] [INFO ] Computed 0 invariants in 143 ms
[2024-06-07 08:28:57] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-07 08:28:57] [INFO ] Invariant cache hit.
[2024-06-07 08:28:59] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned []
Implicit Place search using SMT with State Equation took 2487 ms to find 0 implicit places.
Running 3909 sub problems to find dead transitions.
[2024-06-07 08:28: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 98515ms, After SMT, problems are : Problem set: 0 solved, 3909 unsolved
Search for dead transitions found 0 dead transitions in 98753ms
Starting structural reductions in LTL mode, iteration 1 : 94/270 places, 3910/4850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101542 ms. Remains : 94/270 places, 3910/4850 transitions.
Support contains 39 out of 94 places after structural reductions.
[2024-06-07 08:30:39] [INFO ] Flatten gal took : 1085 ms
[2024-06-07 08:30:40] [INFO ] Flatten gal took : 584 ms
[2024-06-07 08:30:41] [INFO ] Input system was already deterministic with 3910 transitions.
RANDOM walk for 40000 steps (8 resets) in 3857 ms. (10 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 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 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 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 4004 steps (8 resets) in 21 ms. (182 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 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 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 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 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 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 169405 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :2 out of 26
Probabilistic random walk after 169405 steps, saw 28956 distinct states, run finished after 3017 ms. (steps per millisecond=56 ) properties seen :2
[2024-06-07 08:30: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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3939/4004 variables, and 61 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5015 ms.
Refiners :[State Equation: 61/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 5013 ms.
Refiners :[State Equation: 81/94 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11141ms 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.88 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 1 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 1371 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 1375 ms. Remains : 51/94 places, 3858/3910 transitions.
RANDOM walk for 40000 steps (8 resets) in 3165 ms. (12 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (6 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (2 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (2 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (2 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (2 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (6 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (2 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (2 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (0 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 212880 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :5 out of 24
Probabilistic random walk after 212880 steps, saw 32092 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :5
// Phase 1: matrix 3858 rows 51 cols
[2024-06-07 08:31:02] [INFO ] Computed 9 invariants in 49 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 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, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3858/3909 variables, 51/60 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3909 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 0/3909 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3909/3909 variables, and 60 constraints, problems are : Problem set: 3 solved, 16 unsolved in 5434 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 19/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 15/51 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3858/3909 variables, 51/60 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3909 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 0/3909 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3909/3909 variables, and 60 constraints, problems are : Problem set: 3 solved, 16 unsolved in 5499 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11493ms problems are : Problem set: 3 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 13 properties in 3416 ms.
Support contains 15 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 3858/3858 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 48 transition count 3090
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 48 transition count 3090
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 48 transition count 3087
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 9 place count 48 transition count 3084
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 45 transition count 3084
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 16 place count 45 transition count 3083
Applied a total of 16 rules in 595 ms. Remains 45 /51 variables (removed 6) and now considering 3083/3858 (removed 775) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 596 ms. Remains : 45/51 places, 3083/3858 transitions.
RANDOM walk for 40000 steps (8 resets) in 2575 ms. (15 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 262174 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :2 out of 3
Probabilistic random walk after 262174 steps, saw 40299 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :2
// Phase 1: matrix 3083 rows 45 cols
[2024-06-07 08:31:22] [INFO ] Computed 9 invariants in 38 ms
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) 36/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3083/3128 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/3128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3128/3128 variables, and 54 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 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) 36/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3083/3128 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/3128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3128/3128 variables, and 54 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2333ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=6 )
Parikh walk visited 1 properties in 14 ms.
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.154 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 63 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:31:25] [INFO ] Computed 0 invariants in 57 ms
[2024-06-07 08:31:25] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-06-07 08:31:25] [INFO ] Invariant cache hit.
[2024-06-07 08:31:27] [INFO ] Implicit Places using invariants and state equation in 1906 ms returned []
Implicit Place search using SMT with State Equation took 2331 ms to find 0 implicit places.
Running 3653 sub problems to find dead transitions.
[2024-06-07 08:31:27] [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 95248ms, After SMT, problems are : Problem set: 0 solved, 3653 unsolved
Search for dead transitions found 0 dead transitions in 95335ms
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97762 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 563 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 1 reset in 2215 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 2 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-00 finished in 100659 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 53 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 08:33:05] [INFO ] Computed 0 invariants in 26 ms
[2024-06-07 08:33:06] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-06-07 08:33:06] [INFO ] Invariant cache hit.
[2024-06-07 08:33:08] [INFO ] Implicit Places using invariants and state equation in 1673 ms returned []
Implicit Place search using SMT with State Equation took 2142 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 08:33:08] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 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 86577ms, After SMT, problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 86642ms
Starting structural reductions in LTL mode, iteration 1 : 91/94 places, 3141/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88850 ms. Remains : 91/94 places, 3141/3910 transitions.
Stuttering acceptance computed with spot in 139 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 1769 ms.
Product exploration explored 100000 steps with 0 reset in 1714 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.38 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 127 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 156 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 1504 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 494 ms. (80 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 551 ms. (72 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 259240 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :1 out of 2
Probabilistic random walk after 259240 steps, saw 42651 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :1
[2024-06-07 08:34:42] [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 2115 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 1675 ms.
Refiners :[State Equation: 91/91 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3858ms 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 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 132 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 136 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)]
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 21 ms. Remains 91 /91 variables (removed 0) and now considering 3141/3141 (removed 0) transitions.
[2024-06-07 08:34:46] [INFO ] Invariant cache hit.
[2024-06-07 08:34:47] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-07 08:34:47] [INFO ] Invariant cache hit.
[2024-06-07 08:34:48] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 08:34:48] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 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 84363ms, After SMT, problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 84401ms
Finished structural reductions in LTL mode , in 1 iterations and 86407 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.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 126 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 179 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 1463 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 727 ms. (54 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 310703 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :1 out of 2
Probabilistic random walk after 310703 steps, saw 49451 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :1
[2024-06-07 08:36:17] [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 1573 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 1866 ms.
Refiners :[State Equation: 91/91 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3492ms 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 171 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 171 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 170 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 179 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 1718 ms.
Product exploration explored 100000 steps with 0 reset in 1758 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 118 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.101 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 2 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 0 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 1 ms
Applied a total of 62 rules in 1325 ms. Remains 79 /91 variables (removed 12) and now considering 3167/3141 (removed -26) transitions.
[2024-06-07 08:36:38] [INFO ] Redundant transitions in 11579 ms returned []
Running 3151 sub problems to find dead transitions.
// Phase 1: matrix 3167 rows 79 cols
[2024-06-07 08:36:38] [INFO ] Computed 0 invariants in 26 ms
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/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3151 unsolved
SMT process timed out in 85903ms, After SMT, problems are : Problem set: 0 solved, 3151 unsolved
Search for dead transitions found 0 dead transitions in 85941ms
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 98864 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 19 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 08:38:04] [INFO ] Computed 0 invariants in 56 ms
[2024-06-07 08:38:05] [INFO ] Implicit Places using invariants in 555 ms returned []
[2024-06-07 08:38:05] [INFO ] Invariant cache hit.
[2024-06-07 08:38:07] [INFO ] Implicit Places using invariants and state equation in 2020 ms returned []
Implicit Place search using SMT with State Equation took 2579 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 08:38:07] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)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 84816ms, After SMT, problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 84856ms
Finished structural reductions in LTL mode , in 1 iterations and 87463 ms. Remains : 91/91 places, 3141/3141 transitions.
Treatment of property ResIsolation-PT-N08P1-LTLFireability-03 finished in 387161 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 4 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.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 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 3 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 2 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 2441 ms. Remains 49 /94 variables (removed 45) and now considering 3107/3910 (removed 803) transitions.
[2024-06-07 08:39:35] [INFO ] Flow matrix only has 3106 transitions (discarded 1 similar events)
// Phase 1: matrix 3106 rows 49 cols
[2024-06-07 08:39:35] [INFO ] Computed 0 invariants in 25 ms
[2024-06-07 08:39:35] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-07 08:39:35] [INFO ] Flow matrix only has 3106 transitions (discarded 1 similar events)
[2024-06-07 08:39:35] [INFO ] Invariant cache hit.
[2024-06-07 08:39:37] [INFO ] State equation strengthened by 2299 read => feed constraints.
[2024-06-07 08:39:40] [INFO ] Implicit Places using invariants and state equation in 4791 ms returned []
Implicit Place search using SMT with State Equation took 5183 ms to find 0 implicit places.
[2024-06-07 08:39:52] [INFO ] Redundant transitions in 11475 ms returned []
Running 3089 sub problems to find dead transitions.
[2024-06-07 08:39:52] [INFO ] Flow matrix only has 3106 transitions (discarded 1 similar events)
[2024-06-07 08:39:52] [INFO ] Invariant cache hit.
[2024-06-07 08:39:53] [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 87638ms, After SMT, problems are : Problem set: 0 solved, 3089 unsolved
Search for dead transitions found 0 dead transitions in 87678ms
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 106803 ms. Remains : 49/94 places, 3107/3910 transitions.
Stuttering acceptance computed with spot in 171 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 4 steps with 0 reset in 1 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-04 finished in 107011 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 08:41:20] [INFO ] Computed 0 invariants in 52 ms
[2024-06-07 08:41:20] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-06-07 08:41:20] [INFO ] Invariant cache hit.
[2024-06-07 08:41:22] [INFO ] Implicit Places using invariants and state equation in 2042 ms returned []
Implicit Place search using SMT with State Equation took 2669 ms to find 0 implicit places.
Running 3653 sub problems to find dead transitions.
[2024-06-07 08:41:22] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 94517ms, After SMT, problems are : Problem set: 0 solved, 3653 unsolved
Search for dead transitions found 0 dead transitions in 94562ms
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97298 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 362 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 1847 ms.
Product exploration explored 100000 steps with 0 reset in 1603 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 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 136 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 121 ms :[true, p1, (AND p1 p0), p0]
RANDOM walk for 40000 steps (8 resets) in 1418 ms. (28 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1336 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1175 ms. (34 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 699 ms. (57 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 712 ms. (56 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 554 ms. (72 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 402335 steps, run timeout after 6001 ms. (steps per millisecond=67 ) properties seen :3 out of 6
Probabilistic random walk after 402335 steps, saw 60814 distinct states, run finished after 6004 ms. (steps per millisecond=67 ) properties seen :3
[2024-06-07 08:43:09] [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 2787 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 2011 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4884ms 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 6 ms. (steps per millisecond=9 )
Parikh walk visited 2 properties in 7 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 441 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 168 ms :[true, p0, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 179 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.29 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 1 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 3606 ms. Remains 53 /93 variables (removed 40) and now considering 3623/3654 (removed 31) transitions.
[2024-06-07 08:43:18] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
// Phase 1: matrix 3622 rows 53 cols
[2024-06-07 08:43:18] [INFO ] Computed 0 invariants in 38 ms
[2024-06-07 08:43:19] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-06-07 08:43:19] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 08:43:19] [INFO ] Invariant cache hit.
[2024-06-07 08:43:21] [INFO ] State equation strengthened by 3067 read => feed constraints.
[2024-06-07 08:43:29] [INFO ] Implicit Places using invariants and state equation in 9781 ms returned []
Implicit Place search using SMT with State Equation took 10284 ms to find 0 implicit places.
[2024-06-07 08:43:41] [INFO ] Redundant transitions in 12054 ms returned []
Running 3605 sub problems to find dead transitions.
[2024-06-07 08:43:41] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 08:43:41] [INFO ] Invariant cache hit.
[2024-06-07 08:43:43] [INFO ] State equation strengthened by 3067 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 96180ms, After SMT, problems are : Problem set: 0 solved, 3605 unsolved
Search for dead transitions found 0 dead transitions in 96223ms
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 122185 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 181 ms :[true, p0, p1, (AND p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 5275 ms. (7 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1007 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 976 ms. (40 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1542 ms. (25 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1200 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 900 ms. (44 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1200 ms. (33 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 4822 ms. (steps per millisecond=92 ) 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 3824 ms. (steps per millisecond=116 ) 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 464 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 128 ms :[true, p0, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 161 ms :[true, p0, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 165 ms :[true, p0, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 0 reset in 2035 ms.
Product exploration explored 100000 steps with 0 reset in 1777 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 1506 ms. Remains 53 /53 variables (removed 0) and now considering 3623/3623 (removed 0) transitions.
[2024-06-07 08:45:37] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 08:45:37] [INFO ] Invariant cache hit.
[2024-06-07 08:45:37] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-06-07 08:45:37] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 08:45:37] [INFO ] Invariant cache hit.
[2024-06-07 08:45:39] [INFO ] State equation strengthened by 3067 read => feed constraints.
[2024-06-07 08:45:45] [INFO ] Implicit Places using invariants and state equation in 7928 ms returned []
Implicit Place search using SMT with State Equation took 8490 ms to find 0 implicit places.
[2024-06-07 08:45:57] [INFO ] Redundant transitions in 11543 ms returned []
Running 3605 sub problems to find dead transitions.
[2024-06-07 08:45:57] [INFO ] Flow matrix only has 3622 transitions (discarded 1 similar events)
[2024-06-07 08:45:57] [INFO ] Invariant cache hit.
[2024-06-07 08:45:58] [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 94942ms, After SMT, problems are : Problem set: 0 solved, 3605 unsolved
Search for dead transitions found 0 dead transitions in 94987ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 116555 ms. Remains : 53/53 places, 3623/3623 transitions.
Treatment of property ResIsolation-PT-N08P1-LTLFireability-05 finished in 373164 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 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 08:47:33] [INFO ] Computed 0 invariants in 36 ms
[2024-06-07 08:47:33] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-06-07 08:47:33] [INFO ] Invariant cache hit.
[2024-06-07 08:47:35] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 08:47:35] [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 84568ms, After SMT, problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 84607ms
Starting structural reductions in LTL mode, iteration 1 : 91/94 places, 3141/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87069 ms. Remains : 91/94 places, 3141/3910 transitions.
Stuttering acceptance computed with spot in 106 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 1594 ms.
Stack based approach found an accepted trace after 115 steps with 0 reset with depth 116 and stack size 116 in 2 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-06 finished in 88797 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 48 ms. Remains 91 /94 variables (removed 3) and now considering 3141/3910 (removed 769) transitions.
[2024-06-07 08:49:02] [INFO ] Invariant cache hit.
[2024-06-07 08:49:02] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-06-07 08:49:02] [INFO ] Invariant cache hit.
[2024-06-07 08:49:04] [INFO ] Implicit Places using invariants and state equation in 2002 ms returned []
Implicit Place search using SMT with State Equation took 2477 ms to find 0 implicit places.
Running 3140 sub problems to find dead transitions.
[2024-06-07 08:49:04] [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 84613ms, After SMT, problems are : Problem set: 0 solved, 3140 unsolved
Search for dead transitions found 0 dead transitions in 84676ms
Starting structural reductions in LTL mode, iteration 1 : 91/94 places, 3141/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87214 ms. Remains : 91/94 places, 3141/3910 transitions.
Stuttering acceptance computed with spot in 122 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 1541 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-07 finished in 88905 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.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 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 0 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 624 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 08:50:31] [INFO ] Computed 0 invariants in 32 ms
[2024-06-07 08:50:32] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-06-07 08:50:32] [INFO ] Invariant cache hit.
[2024-06-07 08:50:33] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 1936 ms to find 0 implicit places.
[2024-06-07 08:50:45] [INFO ] Redundant transitions in 12373 ms returned []
Running 3350 sub problems to find dead transitions.
[2024-06-07 08:50:45] [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
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 3419/3422 variables, and 52 constraints, problems are : Problem set: 0 solved, 3350 unsolved in 30084 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 30064 ms.
Refiners :[State Equation: 52/54 constraints, PredecessorRefiner: 3350/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 120253ms problems are : Problem set: 0 solved, 3350 unsolved
Search for dead transitions found 0 dead transitions in 120293ms
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 135245 ms. Remains : 54/94 places, 3368/3910 transitions.
Stuttering acceptance computed with spot in 154 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 2049 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P1-LTLFireability-09 finished in 137476 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.14 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 2 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 823 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:52:49] [INFO ] Computed 0 invariants in 32 ms
[2024-06-07 08:52:49] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-06-07 08:52:49] [INFO ] Invariant cache hit.
[2024-06-07 08:52:51] [INFO ] Implicit Places using invariants and state equation in 1705 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
[2024-06-07 08:53:05] [INFO ] Redundant transitions in 13836 ms returned []
Running 3608 sub problems to find dead transitions.
[2024-06-07 08:53:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3608 unsolved
At refinement iteration 1 (OVERLAPS) 3625/3679 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 3608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3679/3682 variables, and 54 constraints, problems are : Problem set: 0 solved, 3608 unsolved in 30077 ms.
Refiners :[State Equation: 54/56 constraints, PredecessorRefiner: 3608/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3608 unsolved
At refinement iteration 1 (OVERLAPS) 3625/3679 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 3608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3679 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 3608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3679/3682 variables, and 67 constraints, problems are : Problem set: 0 solved, 3608 unsolved in 30098 ms.
Refiners :[State Equation: 54/56 constraints, PredecessorRefiner: 3608/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 124486ms problems are : Problem set: 0 solved, 3608 unsolved
Search for dead transitions found 0 dead transitions in 124532ms
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 141244 ms. Remains : 56/94 places, 3626/3910 transitions.
Stuttering acceptance computed with spot in 250 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 2437 ms.
Product exploration explored 100000 steps with 0 reset in 2369 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 211 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 213 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 1754 ms. (22 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1114 ms. (35 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1007 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 810 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1595 ms. (25 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 929 ms. (43 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1065 ms. (37 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 937 ms. (42 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 752 ms. (53 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 625963 steps, run timeout after 9001 ms. (steps per millisecond=69 ) properties seen :4 out of 8
Probabilistic random walk after 625963 steps, saw 90549 distinct states, run finished after 9002 ms. (steps per millisecond=69 ) properties seen :4
[2024-06-07 08:55:27] [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 1593 ms.
Refiners :[State Equation: 56/56 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1697ms 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 25 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 161018 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 52 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:55:29] [INFO ] Computed 0 invariants in 57 ms
[2024-06-07 08:55:29] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-06-07 08:55:29] [INFO ] Invariant cache hit.
[2024-06-07 08:55:32] [INFO ] Implicit Places using invariants and state equation in 2400 ms returned []
Implicit Place search using SMT with State Equation took 2802 ms to find 0 implicit places.
Running 3653 sub problems to find dead transitions.
[2024-06-07 08:55:32] [INFO ] Invariant cache hit.
(s11 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 95960ms, After SMT, problems are : Problem set: 0 solved, 3653 unsolved
Search for dead transitions found 0 dead transitions in 96024ms
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98886 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 367 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 1759 ms.
Product exploration explored 100000 steps with 0 reset in 1458 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.35 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 234 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 277 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
RANDOM walk for 40000 steps (8 resets) in 3567 ms. (11 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 877 ms. (45 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 760 ms. (52 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1051 ms. (38 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1438 ms. (27 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 764 ms. (52 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1133 ms. (35 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 863 ms. (46 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 715 ms. (55 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 791 ms. (50 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 574901 steps, run timeout after 12001 ms. (steps per millisecond=47 ) properties seen :0 out of 9
Probabilistic random walk after 574901 steps, saw 86575 distinct states, run finished after 12001 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-07 08:57:28] [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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3747/3747 variables, and 93 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5012 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.
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 0)
(t3 1)
(t4 0)
(t5 2)
(t6 1)
(t7 1)
(t8 0)
(t9 1)
(t10 0)
(t11 1)
(t12 1)
(t13 1)
(t14 0)
(t15 1)
(t16 0)
(t17 1)
(t18 1)
(t19 1)
(t20 0)
(t21 1)
(t22 0)
(t23 1)
(t24 1)
(t25 1)
(t26 0)
(t27 1)
(t28 0)
(t29 2)
(t30 1)
(t31 1)
(t32 0)
(t33 1)
(t34 0)
(t35 2)
(t36 1)
(t37 1)
(t38 0)
(t39 1)
(t40 0)
(t41 1)
(t42 1)
(t43 1)
(t44 0)
(t45 1)
(t46 0)
(t47 2)
(t48 1)
(t49 0)
(t50 0)
(t51 1)
(t52 1)
(t53 1)
(t54 1)
(t55 1)
(t56 0)
(t57 0)
(t58 1)
(t59 1)
(t60 0)
(t61 0)
(t62 0)
(t63 0)
(t64 0)
(t65 1)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 0)
(t71 0)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 0)
(t77 0)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 0)
(t116 0)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 0)
(t125 0)
(t126 0)
(t127 0)
(t128 0)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 0)
(t146 0)
(t147 0)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 0)
(t159 0)
(t160 0)
(t161 0)
(t162 0)
(t163 0)
(t164 0)
(t165 0)
(t166 0)
(t167 0)
(t168 0)
(t169 0)
(t170 0)
(t171 0)
(t172 0)
(t173 0)
(t174 0)
(t175 0)
(t176 0)
(t177 0)
(t178 0)
(t179 0)
(t180 0)
(t181 0)
(t182 0)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 0)
(t203 0)
(t204 0)
(t205 0)
(t206 0)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 0)
(t225 0)
(t226 0)
(t227 0)
(t228 0)
(t229 0)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 0)
(t236 0)
(t237 0)
(t238 0)
(t239 0)
(t240 0)
(t241 0)
(t242 0)
(t243 0)
(t244 0)
(t245 0)
(t246 0)
(t247 0)
(t248 0)
(t249 0)
(t250 0)
(t251 0)
(t252 0)
(t253 0)
(t254 0)
(t255 0)
(t256 0)
(t257 0)
(t258 0)
(t259 0)
(t260 0)
(t261 0)
(t262 0)
(t263 0)
(t264 0)
(t265 0)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 0)
(t271 0)
(t272 0)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 0)
(t279 0)
(t280 0)
(t281 0)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 0)
(t287 0)
(t288 0)
(t289 0)
(t290 0)
(t291 0)
(t292 0)
(t293 0)
(t294 0)
(t295 0)
(t296 0)
(t297 0)
(t298 0)
(t299 0)
(t300 0)
(t301 0)
(t302 0)
(t303 0)
(t304 0)
(t305 0)
(t306 0)
(t307 0)
(t308 0)
(t309 0)
(t310 0)
(t311 0)
(t312 0)
(t313 0)
(t314 0)
(t315 0)
(t316 0)
(t317 0)
(t318 0)
(t319 0)
(t320 0)
(t321 0)
(t322 0)
(t323 0)
(t324 0)
(t325 0)
(t326 0)
(t327 0)
(t328 0)
(t329 0)
(t330 0)
(t331 0)
(t332 0)
(t333 0)
(t334 0)
(t335 0)
(t336 0)
(t337 0)
(t338 0)
(t339 0)
(t340 0)
(t341 0)
(t342 0)
(t343 0)
(t344 0)
(t345 0)
(t346 0)
(t347 0)
(t348 0)
(t349 0)
(t350 0)
(t351 0)
(t352 0)
(t353 0)
(t354 0)
(t355 0)
(t356 0)
(t357 0)
(t358 0)
(t359 0)
(t360 0)
(t361 0)
(t362 0)
(t363 0)
(t364 0)
(t365 0)
(t366 0)
(t367 0)
(t368 0)
(t369 0)
(t370 0)
(t371 0)
(t372 0)
(t373 0)
(t374 0)
(t375 0)
(t376 0)
(t377 0)
(t378 0)
(t379 0)
(t380 0)
(t381 0)
(t382 0)
(t383 0)
(t384 0)
(t385 0)
(t386 0)
(t387 0)
(t388 0)
(t389 0)
(t390 0)
(t391 0)
(t392 0)
(t393 0)
(t394 0)
(t395 0)
(t396 0)
(t397 0)
(t398 0)
(t399 0)
(t400 0)
(t401 0)
(t402 0)
(t403 0)
(t404 0)
(t405 0)
(t406 0)
(t407 0)
(t408 0)
(t409 0)
(t410 0)
(t411 0)
(t412 0)
(t413 0)
(t414 0)
(t415 0)
(t416 0)
(t417 0)
(t418 0)
(t419 0)
(t420 0)
(t421 0)
(t422 0)
(t423 0)
(t424 0)
(t425 0)
(t426 0)
(t427 0)
(t428 0)
(t429 0)
(t430 0)
(t431 0)
(t432 0)
(t433 0)
(t434 0)
(t435 0)
(t436 0)
(t437 0)
(t438 0)
(t439 0)
(t440 0)
(t441 0)
(t442 0)
(t443 0)
(t444 0)
(t445 0)
(t446 0)
(t447 0)
(t448 0)
(t449 0)
(t450 0)
(t451 0)
(t452 0)
(t453 0)
(t454 0)
(t455 0)
(t456 0)
(t457 0)
(t458 0)
(t459 0)
(t460 0)
(t461 0)
(t462 0)
(t463 0)
(t464 0)
(t465 0)
(t466 0)
(t467 0)
(t468 0)
(t469 0)
(t470 0)
(t471 0)
(t472 0)
(t473 0)
(t474 0)
(t475 0)
(t476 0)
(t477 0)
(t478 0)
(t479 0)
(t480 0)
(t481 0)
(t482 0)
(t483 0)
(t484 0)
(t485 0)
(t486 0)
(t487 0)
(t488 0)
(t489 0)
(t490 0)
(t491 0)
(t492 0)
(t493 0)
(t494 0)
(t495 0)
(t496 0)
(t497 0)
(t498 0)
(t499 0)
(t500 0)
(t501 0)
(t502 0)
(t503 0)
(t504 0)
(t505 0)
(t506 0)
(t507 0)
(t508 0)
(t509 0)
(t510 0)
(t511 0)
(t512 0)
(t513 0)
(t514 0)
(t515 0)
(t516 0)
(t517 0)
(t518 0)
(t519 0)
(t520 0)
(t521 0)
(t522 0)
(t523 0)
(t524 0)
(t525 0)
(t526 0)
(t527 0)
(t528 0)
(t529 0)
(t530 0)
(t531 0)
(t532 0)
(t533 0)
(t534 0)
(t535 0)
(t536 0)
(t537 0)
(t538 0)
(t539 0)
(t540 0)
(t541 0)
(t542 0)
(t543 0)
(t544 0)
(t545 0)
(t546 0)
(t547 0)
(t548 0)
(t549 0)
(t550 0)
(t551 0)
(t552 0)
(t553 0)
(t554 0)
(t555 0)
(t556 0)
(t557 0)
(t558 0)
(t559 0)
(t560 0)
(t561 0)
(t562 0)
(t563 0)
(t564 0)
(t565 0)
(t566 0)
(t567 0)
(t568 0)
(t569 0)
(t570 0)
(t571 0)
(t572 0)
(t573 0)
(t574 0)
(t575 0)
(t576 0)
(t577 0)
(t578 0)
(t579 0)
(t580 0)
(t581 0)
(t582 0)
(t583 0)
(t584 0)
(t585 0)
(t586 0)
(t587 0)
(t588 0)
(t589 0)
(t590 0)
(t591 0)
(t592 0)
(t593 0)
(t594 0)
(t595 0)
(t596 0)
(t597 0)
(t598 0)
(t599 0)
(t600 0)
(t601 0)
(t602 0)
(t603 0)
(t604 0)
(t605 0)
(t606 0)
(t607 0)
(t608 0)
(t609 0)
(t610 0)
(t611 0)
(t612 0)
(t613 0)
(t614 0)
(t615 0)
(t616 0)
(t617 0)
(t618 0)
(t619 0)
(t620 0)
(t621 0)
(t622 0)
(t623 0)
(t624 0)
(t625 0)
(t626 0)
(t627 0)
(t628 0)
(t629 0)
(t630 0)
(t631 0)
(t632 0)
(t633 0)
(t634 0)
(t635 0)
(t636 0)
(t637 0)
(t638 0)
(t639 0)
(t640 0)
(t641 0)
(t642 0)
(t643 0)
(t644 0)
(t645 0)
(t646 0)
(t647 0)
(t648 0)
(t649 0)
(t650 0)
(t651 0)
(t652 0)
(t653 0)
(t654 0)
(t655 0)
(t656 0)
(t657 0)
(t658 0)
(t659 0)
(t660 0)
(t661 0)
(t662 0)
(t663 0)
(t664 0)
(t665 0)
(t666 0)
(t667 0)
(t668 0)
(t669 0)
(t670 0)
(t671 0)
(t672 0)
(t673 0)
(t674 0)
(t675 0)
(t676 0)
(t677 0)
(t678 0)
(t679 0)
(t680 0)
(t681 0)
(t682 0)
(t683 0)
(t684 0)
(t685 0)
(t686 0)
(t687 0)
(t688 0)
(t689 0)
(t690 0)
(t691 0)
(t692 0)
(t693 0)
(t694 0)
(t695 0)
(t696 0)
(t697 0)
(t698 0)
(t699 0)
(t700 0)
(t701 0)
(t702 0)
(t703 0)
(t704 0)
(t705 0)
(t706 0)
(t707 0)
(t708 0)
(t709 0)
(t710 0)
(t711 0)
(t712 0)
(t713 0)
(t714 0)
(t715 0)
(t716 0)
(t717 0)
(t718 0)
(t719 0)
(t720 0)
(t721 0)
(t722 0)
(t723 0)
(t724 0)
(t725 0)
(t726 0)
(t727 0)
(t728 0)
(t729 0)
(t730 0)
(t731 0)
(t732 0)
(t733 0)
(t734 0)
(t735 0)
(t736 0)
(t737 0)
(t738 0)
(t739 0)
(t740 0)
(t741 0)
(t742 0)
(t743 0)
(t744 0)
(t745 0)
(t746 0)
(t747 0)
(t748 0)
(t749 0)
(t750 0)
(t751 0)
(t752 0)
(t753 0)
(t754 0)
(t755 0)
(t756 0)
(t757 0)
(t758 0)
(t759 0)
(t760 0)
(t761 0)
(t762 0)
(t763 0)
(t764 0)
(t765 0)
(t766 0)
(t767 0)
(t768 0)
(t769 0)
(t770 0)
(t771 0)
(t772 0)
(t773 0)
(t774 0)
(t775 0)
(t776 0)
(t777 0)
(t778 0)
(t779 0)
(t780 0)
(t781 0)
(t782 0)
(t783 0)
(t784 0)
(t785 0)
(t786 0)
(t787 0)
(t788 0)
(t789 0)
(t790 0)
(t791 0)
(t792 0)
(t793 0)
(t794 0)
(t795 0)
(t796 0)
(t797 0)
(t798 0)
(t799 0)
(t800 0)
(t801 0)
(t802 0)
(t803 0)
(t804 0)
(t805 0)
(t806 0)
(t807 0)
(t808 0)
(t809 0)
(t810 0)
(t811 0)
(t812 0)
(t813 0)
(t814 0)
(t815 0)
(t816 0)
(t817 0)
(t818 0)
(t819 0)
(t820 0)
(t821 0)
(t822 0)
(t823 0)
(t824 0)
(t825 0)
(t826 0)
(t827 0)
(t828 0)
(t829 0)
(t830 0)
(t831 0)
(t832 0)
(t833 0)
(t834 0)
(t835 0)
(t836 0)
(t837 0)
(t838 0)
(t839 0)
(t840 0)
(t841 0)
(t842 0)
(t843 0)
(t844 0)
(t845 0)
(t846 0)
(t847 0)
(t848 0)
(t849 0)
(t850 0)
(t851 0)
(t852 0)
(t853 0)
(t854 0)
(t855 0)
(t856 0)
(t857 0)
(t858 0)
(t859 0)
(t860 0)
(t861 0)
(t862 0)
(t863 0)
(t864 0)
(t865 0)
(t866 0)
(t867 0)
(t868 0)
(t869 0)
(t870 0)
(t871 0)
(t872 0)
(t873 0)
(t874 0)
(t875 0)
(t876 0)
(t877 0)
(t878 0)
(t879 0)
(t880 0)
(t881 0)
(t882 0)
(t883 0)
(t884 0)
(t885 0)
(t886 0)
(t887 0)
(t888 0)
(t889 0)
(t890 0)
(t891 0)
(t892 0)
(t893 0)
(t894 0)
(t895 0)
(t896 0)
(t897 0)
(t898 0)
(t899 0)
(t900 0)
(t901 0)
(t902 0)
(t903 0)
(t904 0)
(t905 0)
(t906 0)
(t907 0)
(t908 0)
(t909 0)
(t910 0)
(t911 0)
(t912 0)
(t913 0)
(t914 0)
(t915 0)
(t916 0)
(t917 0)
(t918 0)
(t919 0)
(t920 0)
(t921 0)
(t922 0)
(t923 0)
(t924 0)
(t925 0)
(t926 0)
(t927 0)
(t928 0)
(t929 0)
(t930 0)
(t931 0)
(t932 0)
(t933 0)
(t934 0)
(t935 0)
(t936 0)
(t937 0)
(t938 0)
(t939 0)
(t940 0)
(t941 0)
(t942 0)
(t943 0)
(t944 0)
(t945 0)
(t946 0)
(t947 0)
(t948 0)
(t949 0)
(t950 0)
(t951 0)
(t952 0)
(t953 0)
(t954 0)
(t955 0)
(t956 0)
(t957 0)
(t958 0)
(t959 0)
(t960 0)
(t961 0)
(t962 0)
(t963 0)
(t964 0)
(t965 0)
(t966 0)
(t967 0)
(t968 0)
(t969 0)
(t970 0)
(t971 0)
(t972 0)
(t973 0)
(t974 0)
(t975 0)
(t976 0)
(t977 0)
(t978 0)
(t979 0)
(t980 0)
(t981 0)
(t982 0)
(t983 0)
(t984 0)
(t985 0)
(t986 0)
(t987 0)
(t988 0)
(t989 0)
(t990 0)
(t991 0)
(t992 0)
(t993 0)
(t994 0)
(t995 0)
(t996 0)
(t997 0)
(t998 0)
(t999 0)
(t1000 0)
(t1001 0)
(t1002 0)
(t1003 0)
(t1004 0)
(t1005 0)
(t1006 0)
(t1007 0)
(t1008 0)
(t1009 0)
(t1010 0)
(t1011 0)
(t1012 0)
(t1013 0)
(t1014 0)
(t1015 0)
(t1016 0)
(t1017 0)
(t1018 0)
(t1019 0)
(t1020 0)
(t1021 0)
(t1022 0)
(t1023 0)
(t1024 0)
(t1025 0)
(t1026 0)
(t1027 0)
(t1028 0)
(t1029 0)
(t1030 0)
(t1031 0)
(t1032 0)
(t1033 0)
(t1034 0)
(t1035 0)
(t1036 0)
(t1037 1)
(t1038 0)
(t1039 0)
(t1040 0)
(t1041 0)
(t1042 0)
(t1043 0)
(t1044 0)
(t1045 0)
(t1046 0)
(t1047 0)
(t1048 0)
(t1049 0)
(t1050 0)
(t1051 0)
(t1052 0)
(t1053 0)
(t1054 0)
(t1055 0)
(t1056 0)
(t1057 0)
(t1058 0)
(t1059 0)
(t1060 0)
(t1061 0)
(t1062 0)
(t1063 0)
(t1064 0)
(t1065 0)
(t1066 0)
(t1067 0)
(t1068 0)
(t1069 0)
(t1070 0)
(t1071 0)
(t1072 0)
(t1073 0)
(t1074 0)
(t1075 0)
(t1076 0)
(t1077 0)
(t1078 0)
(t1079 0)
(t1080 0)
(t1081 0)
(t1082 0)
(t1083 0)
(t1084 0)
(t1085 0)
(t1086 0)
(t1087 0)
(t1088 0)
(t1089 0)
(t1090 0)
(t1091 0)
(t1092 0)
(t1093 0)
(t1094 0)
(t1095 0)
(t1096 0)
(t1097 0)
(t1098 0)
(t1099 0)
(t1100 0)
(t1101 0)
(t1102 0)
(t1103 0)
(t1104 0)
(t1105 0)
(t1106 0)
(t1107 0)
(t1108 0)
(t1109 0)
(t1110 0)
(t1111 0)
(t1112 0)
(t1113 0)
(t1114 0)
(t1115 0)
(t1116 0)
(t1117 0)
(t1118 0)
(t1119 0)
(t1120 0)
(t1121 0)
(t1122 0)
(t1123 0)
(t1124 0)
(t1125 0)
(t1126 0)
(t1127 0)
(t1128 0)
(t1129 0)
(t1130 0)
(t1131 0)
(t1132 0)
(t1133 0)
(t1134 0)
(t1135 0)
(t1136 0)
(t1137 0)
(t1138 0)
(t1139 0)
(t1140 0)
(t1141 0)
(t1142 0)
(t1143 0)
(t1144 0)
(t1145 0)
(t1146 0)
(t1147 0)
(t1148 0)
(t1149 0)
(t1150 0)
(t1151 0)
(t1152 0)
(t1153 0)
(t1154 0)
(t1155 0)
(t1156 0)
(t1157 0)
(t1158 0)
(t1159 0)
(t1160 0)
(t1161 0)
(t1162 0)
(t1163 0)
(t1164 0)
(t1165 0)
(t1166 0)
(t1167 0)
(t1168 0)
(t1169 0)
(t1170 0)
(t1171 0)
(t1172 0)
(t1173 0)
(t1174 0)
(t1175 0)
(t1176 0)
(t1177 0)
(t1178 0)
(t1179 0)
(t1180 0)
(t1181 0)
(t1182 0)
(t1183 0)
(t1184 0)
(t1185 0)
(t1186 0)
(t1187 0)
(t1188 0)
(t1189 0)
(t1190 0)
(t1191 0)
(t1192 0)
(t1193 0)
(t1194 0)
(t1195 0)
(t1196 0)
(t1197 0)
(t1198 0)
(t1199 0)
(t1200 0)
(t1201 0)
(t1202 0)
(t1203 0)
(t1204 0)
(t1205 0)
(t1206 0)
(t1207 0)
(t1208 0)
(t1209 0)
(t1210 0)
(t1211 0)
(t1212 0)
(t1213 0)
(t1214 0)
(t1215 0)
(t1216 0)
(t1217 0)
(t1218 0)
(t1219 0)
(t1220 0)
(t1221 0)
(t1222 0)
(t1223 0)
(t1224 0)
(t1225 0)
(t1226 0)
(t1227 0)
(t1228 0)
(t1229 0)
(t1230 0)
(t1231 0)
(t1232 0)
(t1233 0)
(t1234 0)
(t1235 0)
(t1236 0)
(t1237 0)
(t1238 0)
(t1239 0)
(t1240 0)
(t1241 0)
(t1242 0)
(t1243 0)
(t1244 0)
(t1245 0)
(t1246 0)
(t1247 0)
(t1248 0)
(t1249 0)
(t1250 0)
(t1251 0)
(t1252 0)
(t1253 0)
(t1254 0)
(t1255 0)
(t1256 0)
(t1257 0)
(t1258 0)
(t1259 0)
(t1260 0)
(t1261 0)
(t1262 0)
(t1263 0)
(t1264 0)
(t1265 0)
(t1266 0)
(t1267 0)
(t1268 0)
(t1269 0)
(t1270 0)
(t1271 0)
(t1272 0)
(t1273 0)
(t1274 0)
(t1275 0)
(t1276 0)
(t1277 0)
(t1278 0)
(t1279 0)
(t1280 0)
(t1281 0)
(t1282 0)
(t1283 0)
(t1284 0)
(t1285 0)
(t1286 0)
(t1287 0)
(t1288 0)
(t1289 0)
(t1290 0)
(t1291 0)
(t1292 0)
(t1293 0)
(t1294 0)
(t1295 0)
(t1296 0)
(t1297 0)
(t1298 0)
(t1299 0)
(t1300 0)
(t1301 0)
(t1302 0)
(t1303 0)
(t1304 0)
(t1305 0)
(t1306 0)
(t1307 0)
(t1308 0)
(t1309 0)
(t1310 0)
(t1311 0)
(t1312 0)
(t1313 0)
(t1314 0)
(t1315 0)
(t1316 0)
(t1317 0)
(t1318 0)
(t1319 0)
(t1320 0)
(t1321 0)
(t1322 0)
(t1323 0)
(t1324 0)
(t1325 0)
(t1326 0)
(t1327 0)
(t1328 0)
(t1329 0)
(t1330 0)
(t1331 0)
(t1332 0)
(t1333 0)
(t1334 0)
(t1335 0)
(t1336 0)
(t1337 0)
(t1338 0)
(t1339 0)
(t1340 0)
(t1341 0)
(t1342 0)
(t1343 0)
(t1344 0)
(t1345 0)
(t1346 0)
(t1347 0)
(t1348 0)
(t1349 0)
(t1350 0)
(t1351 0)
(t1352 0)
(t1353 0)
(t1354 0)
(t1355 0)
(t1356 0)
(t1357 0)
(t1358 0)
(t1359 0)
(t1360 0)
(t1361 0)
(t1362 0)
(t1363 0)
(t1364 0)
(t1365 0)
(t1366 0)
(t1367 0)
(t1368 0)
(t1369 0)
(t1370 0)
(t1371 0)
(t1372 0)
(t1373 0)
(t1374 0)
(t1375 0)
(t1376 0)
(t1377 0)
(t1378 0)
(t1379 0)
(t1380 0)
(t1381 0)
(t1382 0)
(t1383 0)
(t1384 0)
(t1385 0)
(t1386 0)
(t1387 0)
(t1388 0)
(t1389 0)
(t1390 0)
(t1391 0)
(t1392 0)
(t1393 0)
(t1394 0)
(t1395 0)
(t1396 0)
(t1397 0)
(t1398 0)
(t1399 0)
(t1400 0)
(t1401 0)
(t1402 0)
(t1403 0)
(t1404 0)
(t1405 0)
(t1406 0)
(t1407 0)
(t1408 0)
(t1409 0)
(t1410 0)
(t1411 0)
(t1412 0)
(t1413 0)
(t1414 0)
(t1415 0)
(t1416 0)
(t1417 0)
(t1418 0)
(t1419 0)
(t1420 0)
(t1421 0)
(t1422 0)
(t1423 0)
(t1424 0)
(t1425 0)
(t1426 0)
(t1427 0)
(t1428 0)
(t1429 0)
(t1430 0)
(t1431 0)
(t1432 0)
(t1433 0)
(t1434 0)
(t1435 0)
(t1436 0)
(t1437 0)
(t1438 0)
(t1439 0)
(t1440 0)
(t1441 0)
(t1442 0)
(t1443 0)
(t1444 0)
(t1445 0)
(t1446 0)
(t1447 0)
(t1448 0)
(t1449 0)
(t1450 0)
(t1451 0)
(t1452 0)
(t1453 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
After SMT solving in domain Int declared 3747/3747 variables, and 93 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5012 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10225ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 6 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 1066 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 451 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 242 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
Stuttering acceptance computed with spot in 233 ms :[(NOT p4), p0, (OR (NOT p1) (NOT p2)), p3, p3, true]
[2024-06-07 08:57:41] [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 473 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 133707 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 43 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:57:43] [INFO ] Computed 0 invariants in 50 ms
[2024-06-07 08:57:43] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-06-07 08:57:43] [INFO ] Invariant cache hit.
[2024-06-07 08:57:45] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 2131 ms to find 0 implicit places.
Running 3396 sub problems to find dead transitions.
[2024-06-07 08:57:45] [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 30060 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 30057 ms.
Refiners :[State Equation: 91/92 constraints, PredecessorRefiner: 3396/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 122000ms problems are : Problem set: 0 solved, 3396 unsolved
Search for dead transitions found 0 dead transitions in 122056ms
Starting structural reductions in LTL mode, iteration 1 : 92/94 places, 3397/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124236 ms. Remains : 92/94 places, 3397/3910 transitions.
Stuttering acceptance computed with spot in 169 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 1386 ms.
Product exploration explored 100000 steps with 0 reset in 1420 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.32 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 122 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 155 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 3129 ms. (12 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 676 ms. (59 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 857 ms. (46 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 744 ms. (53 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 849 ms. (47 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 903 ms. (44 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 795 ms. (50 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 505 ms. (79 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 753 ms. (53 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 706 ms. (56 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 765 ms. (52 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 921 ms. (43 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 761 ms. (52 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 760046 steps, run timeout after 12001 ms. (steps per millisecond=63 ) properties seen :7 out of 12
Probabilistic random walk after 760046 steps, saw 116761 distinct states, run finished after 12001 ms. (steps per millisecond=63 ) properties seen :7
[2024-06-07 09:00:06] [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 1912 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 1871 ms.
Refiners :[State Equation: 92/92 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3925ms 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 3 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 435 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 150 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2024-06-07 09:00:11] [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 150344 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 38 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 09:00:13] [INFO ] Computed 0 invariants in 41 ms
[2024-06-07 09:00:13] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-06-07 09:00:13] [INFO ] Invariant cache hit.
[2024-06-07 09:00:15] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
Running 3653 sub problems to find dead transitions.
[2024-06-07 09:00:15] [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 30067 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 30063 ms.
Refiners :[State Equation: 92/93 constraints, PredecessorRefiner: 3653/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 123695ms problems are : Problem set: 0 solved, 3653 unsolved
Search for dead transitions found 0 dead transitions in 123741ms
Starting structural reductions in LTL mode, iteration 1 : 93/94 places, 3654/3910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125907 ms. Remains : 93/94 places, 3654/3910 transitions.
Stuttering acceptance computed with spot in 128 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 126058 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 160 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.23 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 1 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 1 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 362 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 09:02:20] [INFO ] Computed 0 invariants in 45 ms
[2024-06-07 09:02:20] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-06-07 09:02:20] [INFO ] Invariant cache hit.
[2024-06-07 09:02:22] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 2034 ms to find 0 implicit places.
Running 3092 sub problems to find dead transitions.
[2024-06-07 09:02:22] [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 30053 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 30088 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 117730ms problems are : Problem set: 0 solved, 3092 unsolved
Search for dead transitions found 0 dead transitions in 117768ms
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 120169 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 2056 ms.
Product exploration explored 100000 steps with 0 reset in 1836 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 106 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 133 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 1391 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 440 ms. (90 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 617 ms. (64 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 319170 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :1 out of 2
Probabilistic random walk after 319170 steps, saw 48548 distinct states, run finished after 3004 ms. (steps per millisecond=106 ) properties seen :1
[2024-06-07 09:04:28] [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 1720 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 1333 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3088ms 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 131 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 119 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 120 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 18 ms. Remains 51 /51 variables (removed 0) and now considering 3110/3110 (removed 0) transitions.
[2024-06-07 09:04:31] [INFO ] Invariant cache hit.
[2024-06-07 09:04:32] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-06-07 09:04:32] [INFO ] Invariant cache hit.
[2024-06-07 09:04:33] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2250 ms to find 0 implicit places.
Running 3092 sub problems to find dead transitions.
[2024-06-07 09:04:33] [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 30089 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 30087 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 115759ms problems are : Problem set: 0 solved, 3092 unsolved
Search for dead transitions found 0 dead transitions in 115794ms
Finished structural reductions in LTL mode , in 1 iterations and 118067 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 103 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 154 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 2369 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 741 ms. (53 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 307432 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :1 out of 2
Probabilistic random walk after 307432 steps, saw 46871 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :1
[2024-06-07 09:06: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 1511 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 1359 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2908ms 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 155 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 137 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 159 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 148 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 2024 ms.
Product exploration explored 100000 steps with 0 reset in 1809 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 136 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 459 ms. Remains 51 /51 variables (removed 0) and now considering 3109/3110 (removed 1) transitions.
[2024-06-07 09:06:53] [INFO ] Redundant transitions in 11436 ms returned []
Running 3091 sub problems to find dead transitions.
// Phase 1: matrix 3109 rows 51 cols
[2024-06-07 09:06:53] [INFO ] Computed 0 invariants in 29 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 30070 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
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 3157/3160 variables, and 57 constraints, problems are : Problem set: 0 solved, 3091 unsolved in 30053 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3091/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 117441ms problems are : Problem set: 0 solved, 3091 unsolved
Search for dead transitions found 0 dead transitions in 117484ms
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 129393 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 16 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 09:08:51] [INFO ] Computed 0 invariants in 44 ms
[2024-06-07 09:08:51] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-06-07 09:08:51] [INFO ] Invariant cache hit.
[2024-06-07 09:08:53] [INFO ] Implicit Places using invariants and state equation in 2069 ms returned []
Implicit Place search using SMT with State Equation took 2466 ms to find 0 implicit places.
Running 3092 sub problems to find dead transitions.
[2024-06-07 09:08:53] [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 30086 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 30084 ms.
Refiners :[State Equation: 49/51 constraints, PredecessorRefiner: 3092/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 116408ms problems are : Problem set: 0 solved, 3092 unsolved
Search for dead transitions found 0 dead transitions in 116451ms
Finished structural reductions in LTL mode , in 1 iterations and 118939 ms. Remains : 51/51 places, 3110/3110 transitions.
Treatment of property ResIsolation-PT-N08P1-LTLFireability-03 finished in 511322 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 09:10:51] [INFO ] Flatten gal took : 715 ms
[2024-06-07 09:10:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-07 09:10:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 3910 transitions and 69187 arcs took 77 ms.
Total runtime 2516819 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ResIsolation-PT-N08P1

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 94
TRANSITIONS: 3910
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.694s, Sys 0.021s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.033s, Sys 0.004s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1952
MODEL NAME: /home/mcc/execution/413/model
94 places, 3910 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ResIsolation-PT-N08P1-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ResIsolation-PT-N08P1-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717751737768

--------------------
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

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="greatspnxred"
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 greatspnxred"
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 r627-smll-171774445400004"
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 ;