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.r070-tall-171620505200123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CANInsertWithFailure-PT-040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505200123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716245938218

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-20 22:58:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 22:58:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:58:59] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2024-05-20 22:58:59] [INFO ] Transformed 3684 places.
[2024-05-20 22:58:59] [INFO ] Transformed 9840 transitions.
[2024-05-20 22:58:59] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 554 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 22:59:01] [INFO ] Computed 42 invariants in 467 ms
[2024-05-20 22:59:03] [INFO ] Implicit Places using invariants in 2687 ms returned []
[2024-05-20 22:59:03] [INFO ] Invariant cache hit.
[2024-05-20 22:59:06] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 22:59:37] [INFO ] Performed 385/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 22:59:46] [INFO ] Implicit Places using invariants and state equation in 42829 ms returned []
Implicit Place search using SMT with State Equation took 45547 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 22:59:46] [INFO ] Invariant cache hit.
[2024-05-20 22:59:46] [INFO ] State equation strengthened by 3160 read => feed constraints.
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/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39594ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39731ms
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85936 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 48 out of 3683 places after structural reductions.
[2024-05-20 23:00:26] [INFO ] Flatten gal took : 380 ms
[2024-05-20 23:00:26] [INFO ] Flatten gal took : 255 ms
[2024-05-20 23:00:27] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 47 out of 3683 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (41 resets) in 2505 ms. (15 steps per ms) remains 13/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 12/12 properties
[2024-05-20 23:00:28] [INFO ] Invariant cache hit.
[2024-05-20 23:00:28] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 3586/3605 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3605 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 74/3679 variables, 37/40 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/3681 variables, 2/42 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3681 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 9840/13521 variables, 3681/3723 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13521/13523 variables, and 6883 constraints, problems are : Problem set: 2 solved, 10 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3681/3683 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 3584/3601 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-20 23:00:34] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 15 ms to minimize.
[2024-05-20 23:00:34] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 2 ms to minimize.
[2024-05-20 23:00:34] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2024-05-20 23:00:34] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-05-20 23:00:35] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2024-05-20 23:00:35] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2024-05-20 23:00:35] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 3 ms to minimize.
[2024-05-20 23:00:35] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-20 23:00:35] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-20 23:00:35] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-20 23:00:36] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-20 23:00:36] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-20 23:00:36] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-20 23:00:36] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-20 23:00:36] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-20 23:00:36] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-20 23:00:36] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 3 ms to minimize.
[2024-05-20 23:00:37] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-20 23:00:37] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-20 23:00:37] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 20/21 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-20 23:00:37] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-20 23:00:37] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-20 23:00:37] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-20 23:00:37] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-20 23:00:38] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-20 23:00:38] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-20 23:00:38] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-20 23:00:38] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-20 23:00:38] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 23:00:38] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-20 23:00:38] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
SMT process timed out in 10159ms, After SMT, problems are : Problem set: 2 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 17 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 3404 transition count 9560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1476 Post agglomeration using F-continuation condition.Transition count delta: 1476
Deduced a syphon composed of 1476 places in 5 ms
Reduce places removed 1476 places and 0 transitions.
Iterating global reduction 3 with 2952 rules applied. Total rules applied 3512 place count 1927 transition count 8084
Drop transitions (Redundant composition of simpler transitions.) removed 1400 transitions
Redundant transition composition rules discarded 1400 transitions
Iterating global reduction 3 with 1400 rules applied. Total rules applied 4912 place count 1927 transition count 6684
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4914 place count 1927 transition count 6682
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4916 place count 1925 transition count 6682
Partial Free-agglomeration rule applied 1706 times.
Drop transitions (Partial Free agglomeration) removed 1706 transitions
Iterating global reduction 4 with 1706 rules applied. Total rules applied 6622 place count 1925 transition count 6682
Applied a total of 6622 rules in 1822 ms. Remains 1925 /3683 variables (removed 1758) and now considering 6682/9840 (removed 3158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1824 ms. Remains : 1925/3683 places, 6682/9840 transitions.
RANDOM walk for 40000 steps (203 resets) in 793 ms. (50 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
// Phase 1: matrix 6682 rows 1925 cols
[2024-05-20 23:00:41] [INFO ] Computed 42 invariants in 161 ms
[2024-05-20 23:00:41] [INFO ] State equation strengthened by 6340 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1831/1843 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1843 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 78/1921 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1921 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1923 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1923 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6682/8605 variables, 1923/1965 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8605 variables, 6340/8305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8605 variables, 0/8305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8607 variables, 2/8307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8607 variables, 0/8307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/8607 variables, 0/8307 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8607/8607 variables, and 8307 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6992 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1925/1925 constraints, ReadFeed: 6340/6340 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1831/1843 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:00:48] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-20 23:00:48] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2024-05-20 23:00:48] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 5 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 0 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 0 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:00:49] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:00:50] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:00:50] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:00:50] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1843 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:00:50] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:00:50] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 1 ms to minimize.
[2024-05-20 23:00:50] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-20 23:00:50] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:00:50] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:00:50] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 3 ms to minimize.
[2024-05-20 23:00:50] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-20 23:00:50] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-20 23:00:50] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:00:51] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:00:51] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:00:51] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-20 23:00:51] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:00:51] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:00:51] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:00:51] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:00:51] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:00:51] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1843 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1843 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 78/1921 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1921 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/1923 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:00:54] [INFO ] Deduced a trap composed of 52 places in 1546 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1923 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1923 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 6682/8605 variables, 1923/2004 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8605 variables, 6340/8344 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8605 variables, 7/8351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8605/8607 variables, and 8351 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45042 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1923/1925 constraints, ReadFeed: 6340/6340 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 39/39 constraints]
After SMT, in 52309ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 1925 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1925/1925 places, 6682/6682 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1922 transition count 6679
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 1922 transition count 6679
Applied a total of 9 rules in 458 ms. Remains 1922 /1925 variables (removed 3) and now considering 6679/6682 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 1922/1925 places, 6679/6682 transitions.
RANDOM walk for 40000 steps (201 resets) in 812 ms. (49 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 106191 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 7
Probabilistic random walk after 106191 steps, saw 32084 distinct states, run finished after 3004 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 6679 rows 1922 cols
[2024-05-20 23:01:37] [INFO ] Computed 42 invariants in 152 ms
[2024-05-20 23:01:37] [INFO ] State equation strengthened by 6348 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1828/1840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1840 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 78/1918 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1918 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1920 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1920 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6679/8599 variables, 1920/1962 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8599 variables, 6348/8310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8599 variables, 0/8310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8601 variables, 2/8312 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8601 variables, 0/8312 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/8601 variables, 0/8312 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8601/8601 variables, and 8312 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6937 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1922/1922 constraints, ReadFeed: 6348/6348 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1828/1840 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:01:44] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1840 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1840 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 78/1918 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1918 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1920 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:01:47] [INFO ] Deduced a trap composed of 56 places in 1532 ms of which 12 ms to minimize.
[2024-05-20 23:01:48] [INFO ] Deduced a trap composed of 52 places in 1531 ms of which 12 ms to minimize.
[2024-05-20 23:01:48] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 1 ms to minimize.
[2024-05-20 23:01:48] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-05-20 23:01:49] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1920 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1920 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 6679/8599 variables, 1920/1968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8599 variables, 6348/8316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8599 variables, 7/8323 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8599 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2/8601 variables, 2/8325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8601 variables, 0/8325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8601/8601 variables, and 8325 constraints, problems are : Problem set: 0 solved, 7 unsolved in 75046 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1922/1922 constraints, ReadFeed: 6348/6348 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
After SMT, in 82225ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 1922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1922/1922 places, 6679/6679 transitions.
Applied a total of 0 rules in 190 ms. Remains 1922 /1922 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 1922/1922 places, 6679/6679 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1922/1922 places, 6679/6679 transitions.
Applied a total of 0 rules in 167 ms. Remains 1922 /1922 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
[2024-05-20 23:02:59] [INFO ] Invariant cache hit.
[2024-05-20 23:03:01] [INFO ] Implicit Places using invariants in 1989 ms returned []
[2024-05-20 23:03:01] [INFO ] Invariant cache hit.
[2024-05-20 23:03:03] [INFO ] State equation strengthened by 6348 read => feed constraints.
[2024-05-20 23:03:33] [INFO ] Performed 754/1922 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:04:03] [INFO ] Performed 1856/1922 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:04:05] [INFO ] Implicit Places using invariants and state equation in 63739 ms returned []
Implicit Place search using SMT with State Equation took 65728 ms to find 0 implicit places.
[2024-05-20 23:04:06] [INFO ] Redundant transitions in 648 ms returned []
Running 6639 sub problems to find dead transitions.
[2024-05-20 23:04:06] [INFO ] Invariant cache hit.
[2024-05-20 23:04:06] [INFO ] State equation strengthened by 6348 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1921 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6639 unsolved
SMT process timed out in 36909ms, After SMT, problems are : Problem set: 0 solved, 6639 unsolved
Search for dead transitions found 0 dead transitions in 36971ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103543 ms. Remains : 1922/1922 places, 6679/6679 transitions.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 162 stabilizing places and 280 stable transitions
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 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 931 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-20 23:04:44] [INFO ] Computed 42 invariants in 209 ms
[2024-05-20 23:04:45] [INFO ] Implicit Places using invariants in 1358 ms returned []
[2024-05-20 23:04:45] [INFO ] Invariant cache hit.
[2024-05-20 23:04:47] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:05:02] [INFO ] Implicit Places using invariants and state equation in 16325 ms returned []
Implicit Place search using SMT with State Equation took 17684 ms to find 0 implicit places.
[2024-05-20 23:05:03] [INFO ] Redundant transitions in 837 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-20 23:05:03] [INFO ] Invariant cache hit.
[2024-05-20 23:05:03] [INFO ] State equation strengthened by 4757 read => feed constraints.
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/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 35571ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 35628ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55110 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-00
Stuttering criterion allowed to conclude after 212 steps with 0 reset in 11 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-00 finished in 55456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p1||(p2&&X(X(p3)))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 218 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:05:39] [INFO ] Computed 42 invariants in 442 ms
[2024-05-20 23:05:41] [INFO ] Implicit Places using invariants in 2428 ms returned []
[2024-05-20 23:05:41] [INFO ] Invariant cache hit.
[2024-05-20 23:05:44] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:06:15] [INFO ] Performed 335/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:06:28] [INFO ] Implicit Places using invariants and state equation in 47028 ms returned []
Implicit Place search using SMT with State Equation took 49466 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:06:28] [INFO ] Invariant cache hit.
[2024-05-20 23:06:28] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39377ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39455ms
Finished structural reductions in LTL mode , in 1 iterations and 89187 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p3), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-01
Product exploration explored 100000 steps with 33335 reset in 1237 ms.
Product exploration explored 100000 steps with 33261 reset in 1171 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X p2), (X (NOT (AND (NOT p1) p2))), (X (OR p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 102 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (39 resets) in 564 ms. (70 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
[2024-05-20 23:07:11] [INFO ] Invariant cache hit.
[2024-05-20 23:07:11] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3600/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:07:12] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-20 23:07:12] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-20 23:07:12] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:07:12] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-20 23:07:12] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-20 23:07:12] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-20 23:07:13] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2024-05-20 23:07:13] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-20 23:07:13] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-20 23:07:13] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-20 23:07:13] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-20 23:07:13] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:07:13] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-20 23:07:14] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 23:07:14] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-20 23:07:14] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-20 23:07:14] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-20 23:07:14] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-20 23:07:14] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-20 23:07:14] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:07:14] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-05-20 23:07:15] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-20 23:07:15] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-20 23:07:15] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-20 23:07:15] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 23:07:15] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-20 23:07:15] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-20 23:07:15] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-20 23:07:16] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-20 23:07:16] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-20 23:07:16] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-20 23:07:16] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-20 23:07:16] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-20 23:07:16] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
SMT process timed out in 5075ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 2 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 2 with 3120 rules applied. Total rules applied 3680 place count 1843 transition count 8000
Drop transitions (Redundant composition of simpler transitions.) removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 2 with 1482 rules applied. Total rules applied 5162 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5163 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5164 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1640 times.
Drop transitions (Partial Free agglomeration) removed 1640 transitions
Iterating global reduction 3 with 1640 rules applied. Total rules applied 6804 place count 1842 transition count 6517
Applied a total of 6804 rules in 1160 ms. Remains 1842 /3683 variables (removed 1841) and now considering 6517/9840 (removed 3323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1161 ms. Remains : 1842/3683 places, 6517/9840 transitions.
RANDOM walk for 40000 steps (216 resets) in 551 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 114543 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 114543 steps, saw 32362 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 6517 rows 1842 cols
[2024-05-20 23:07:21] [INFO ] Computed 42 invariants in 161 ms
[2024-05-20 23:07:21] [INFO ] State equation strengthened by 6397 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1759/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:07:21] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1838 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1838 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1840 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:07:23] [INFO ] Deduced a trap composed of 53 places in 1432 ms of which 12 ms to minimize.
[2024-05-20 23:07:24] [INFO ] Deduced a trap composed of 49 places in 1498 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1840 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6517/8357 variables, 1840/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8357 variables, 6397/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8357 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8359 variables, 2/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8359 variables, 0/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8359 variables, 0/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8359/8359 variables, and 8284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5632 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1842/1842 constraints, ReadFeed: 6397/6397 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1759/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:07:27] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:07:28] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:07:29] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-20 23:07:29] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:07:29] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:07:29] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:07:29] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:07:29] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:07:29] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:07:29] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:07:29] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-20 23:07:29] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1760 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1760 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1838 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1840 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1840 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:07:31] [INFO ] Deduced a trap composed of 67 places in 1422 ms of which 11 ms to minimize.
[2024-05-20 23:07:32] [INFO ] Deduced a trap composed of 51 places in 1453 ms of which 11 ms to minimize.
[2024-05-20 23:07:34] [INFO ] Deduced a trap composed of 46 places in 1429 ms of which 12 ms to minimize.
[2024-05-20 23:07:35] [INFO ] Deduced a trap composed of 61 places in 1456 ms of which 11 ms to minimize.
[2024-05-20 23:07:37] [INFO ] Deduced a trap composed of 73 places in 1449 ms of which 11 ms to minimize.
[2024-05-20 23:07:38] [INFO ] Deduced a trap composed of 76 places in 1439 ms of which 11 ms to minimize.
[2024-05-20 23:07:40] [INFO ] Deduced a trap composed of 45 places in 1438 ms of which 12 ms to minimize.
[2024-05-20 23:07:41] [INFO ] Deduced a trap composed of 49 places in 1432 ms of which 11 ms to minimize.
[2024-05-20 23:07:43] [INFO ] Deduced a trap composed of 79 places in 1523 ms of which 12 ms to minimize.
[2024-05-20 23:07:44] [INFO ] Deduced a trap composed of 51 places in 1384 ms of which 11 ms to minimize.
[2024-05-20 23:07:46] [INFO ] Deduced a trap composed of 48 places in 1474 ms of which 12 ms to minimize.
[2024-05-20 23:07:47] [INFO ] Deduced a trap composed of 55 places in 1416 ms of which 11 ms to minimize.
[2024-05-20 23:07:49] [INFO ] Deduced a trap composed of 47 places in 1446 ms of which 11 ms to minimize.
[2024-05-20 23:07:50] [INFO ] Deduced a trap composed of 55 places in 1440 ms of which 11 ms to minimize.
[2024-05-20 23:07:51] [INFO ] Deduced a trap composed of 50 places in 1287 ms of which 10 ms to minimize.
[2024-05-20 23:07:53] [INFO ] Deduced a trap composed of 47 places in 1451 ms of which 11 ms to minimize.
[2024-05-20 23:07:54] [INFO ] Deduced a trap composed of 55 places in 1478 ms of which 12 ms to minimize.
[2024-05-20 23:07:56] [INFO ] Deduced a trap composed of 57 places in 1541 ms of which 12 ms to minimize.
[2024-05-20 23:07:57] [INFO ] Deduced a trap composed of 81 places in 1466 ms of which 11 ms to minimize.
[2024-05-20 23:07:59] [INFO ] Deduced a trap composed of 51 places in 1324 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1840 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:08:00] [INFO ] Deduced a trap composed of 130 places in 1508 ms of which 11 ms to minimize.
[2024-05-20 23:08:02] [INFO ] Deduced a trap composed of 56 places in 1513 ms of which 11 ms to minimize.
[2024-05-20 23:08:03] [INFO ] Deduced a trap composed of 52 places in 1468 ms of which 11 ms to minimize.
[2024-05-20 23:08:05] [INFO ] Deduced a trap composed of 50 places in 1454 ms of which 11 ms to minimize.
[2024-05-20 23:08:06] [INFO ] Deduced a trap composed of 45 places in 1476 ms of which 11 ms to minimize.
[2024-05-20 23:08:08] [INFO ] Deduced a trap composed of 47 places in 1457 ms of which 11 ms to minimize.
[2024-05-20 23:08:09] [INFO ] Deduced a trap composed of 57 places in 1482 ms of which 11 ms to minimize.
[2024-05-20 23:08:11] [INFO ] Deduced a trap composed of 49 places in 1445 ms of which 10 ms to minimize.
[2024-05-20 23:08:12] [INFO ] Deduced a trap composed of 47 places in 1380 ms of which 11 ms to minimize.
SMT process timed out in 51664ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 168 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 167 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2024-05-20 23:08:13] [INFO ] Invariant cache hit.
[2024-05-20 23:08:14] [INFO ] Implicit Places using invariants in 1836 ms returned []
[2024-05-20 23:08:14] [INFO ] Invariant cache hit.
[2024-05-20 23:08:16] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2024-05-20 23:08:46] [INFO ] Performed 799/1842 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:09:16] [INFO ] Implicit Places using invariants and state equation in 61285 ms returned []
Implicit Place search using SMT with State Equation took 63123 ms to find 0 implicit places.
[2024-05-20 23:09:16] [INFO ] Redundant transitions in 469 ms returned []
Running 6477 sub problems to find dead transitions.
[2024-05-20 23:09:16] [INFO ] Invariant cache hit.
[2024-05-20 23:09:16] [INFO ] State equation strengthened by 6397 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1841 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6477 unsolved
SMT process timed out in 36073ms, After SMT, problems are : Problem set: 0 solved, 6477 unsolved
Search for dead transitions found 0 dead transitions in 36124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99913 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Knowledge obtained : [(AND p1 p2 p0 p3), (X p2), (X (NOT (AND (NOT p1) p2))), (X (OR p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p1) p0) (OR (NOT p2) p0)))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT (AND (OR (NOT p1) p0) (OR (NOT p2) p0))))
Knowledge based reduction with 16 factoid took 129 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-01 finished in 253886 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 U (X(G(p1))||F((!p0&&X((F(p2)||G(!p0))))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 188 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:09:53] [INFO ] Computed 42 invariants in 377 ms
[2024-05-20 23:09:55] [INFO ] Implicit Places using invariants in 2406 ms returned []
[2024-05-20 23:09:55] [INFO ] Invariant cache hit.
[2024-05-20 23:09:58] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:10:28] [INFO ] Performed 371/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:10:39] [INFO ] Implicit Places using invariants and state equation in 43638 ms returned []
Implicit Place search using SMT with State Equation took 46045 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:10:39] [INFO ] Invariant cache hit.
[2024-05-20 23:10:39] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39224ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39297ms
Finished structural reductions in LTL mode , in 1 iterations and 85549 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-03
Product exploration explored 100000 steps with 106 reset in 760 ms.
Product exploration explored 100000 steps with 105 reset in 858 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (AND p0 p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 89 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (40 resets) in 494 ms. (80 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
[2024-05-20 23:11:20] [INFO ] Invariant cache hit.
[2024-05-20 23:11:20] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 23:11:21] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-20 23:11:21] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-20 23:11:21] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-20 23:11:21] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-20 23:11:22] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-20 23:11:22] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-05-20 23:11:22] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-05-20 23:11:22] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-20 23:11:22] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-20 23:11:22] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-20 23:11:23] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-20 23:11:23] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-20 23:11:23] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-20 23:11:23] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-20 23:11:23] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-20 23:11:23] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:11:23] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-20 23:11:23] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-20 23:11:24] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-20 23:11:24] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 23:11:24] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-20 23:11:24] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-20 23:11:24] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-20 23:11:24] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-20 23:11:24] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-20 23:11:25] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-05-20 23:11:25] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-20 23:11:25] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-20 23:11:25] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-20 23:11:25] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-20 23:11:25] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-20 23:11:25] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3601/13523 variables, and 33 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/40 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/3683 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 23:11:26] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-05-20 23:11:26] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-20 23:11:26] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-20 23:11:26] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-20 23:11:27] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-20 23:11:27] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-20 23:11:27] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/3601 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3601 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 78/3679 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3679 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3681 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 23:11:31] [INFO ] Deduced a trap composed of 87 places in 3650 ms of which 23 ms to minimize.
SMT process timed out in 11041ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 2 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 2 with 3114 rules applied. Total rules applied 3674 place count 1846 transition count 8003
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 2 with 1479 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5154 place count 1846 transition count 6523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5155 place count 1845 transition count 6523
Partial Free-agglomeration rule applied 1639 times.
Drop transitions (Partial Free agglomeration) removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 6794 place count 1845 transition count 6523
Applied a total of 6794 rules in 1134 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6523/9840 (removed 3317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1134 ms. Remains : 1845/3683 places, 6523/9840 transitions.
RANDOM walk for 40000 steps (214 resets) in 894 ms. (44 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
// Phase 1: matrix 6523 rows 1845 cols
[2024-05-20 23:11:33] [INFO ] Computed 42 invariants in 157 ms
[2024-05-20 23:11:33] [INFO ] State equation strengthened by 6393 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/1841 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6523/8366 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8366 variables, 6393/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8366 variables, 0/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/8368 variables, 2/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2845 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:11:36] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:11:38] [INFO ] Deduced a trap composed of 68 places in 1529 ms of which 12 ms to minimize.
[2024-05-20 23:11:40] [INFO ] Deduced a trap composed of 54 places in 1455 ms of which 11 ms to minimize.
[2024-05-20 23:11:41] [INFO ] Deduced a trap composed of 49 places in 1410 ms of which 11 ms to minimize.
[2024-05-20 23:11:42] [INFO ] Deduced a trap composed of 47 places in 1341 ms of which 11 ms to minimize.
[2024-05-20 23:11:44] [INFO ] Deduced a trap composed of 53 places in 1208 ms of which 10 ms to minimize.
[2024-05-20 23:11:45] [INFO ] Deduced a trap composed of 51 places in 1405 ms of which 11 ms to minimize.
[2024-05-20 23:11:46] [INFO ] Deduced a trap composed of 45 places in 1337 ms of which 10 ms to minimize.
[2024-05-20 23:11:48] [INFO ] Deduced a trap composed of 53 places in 1217 ms of which 10 ms to minimize.
[2024-05-20 23:11:49] [INFO ] Deduced a trap composed of 53 places in 1220 ms of which 10 ms to minimize.
[2024-05-20 23:11:50] [INFO ] Deduced a trap composed of 58 places in 1143 ms of which 9 ms to minimize.
[2024-05-20 23:11:51] [INFO ] Deduced a trap composed of 64 places in 1177 ms of which 9 ms to minimize.
[2024-05-20 23:11:52] [INFO ] Deduced a trap composed of 55 places in 1207 ms of which 11 ms to minimize.
[2024-05-20 23:11:54] [INFO ] Deduced a trap composed of 60 places in 1197 ms of which 10 ms to minimize.
[2024-05-20 23:11:55] [INFO ] Deduced a trap composed of 52 places in 1185 ms of which 10 ms to minimize.
[2024-05-20 23:11:56] [INFO ] Deduced a trap composed of 63 places in 1178 ms of which 10 ms to minimize.
[2024-05-20 23:11:57] [INFO ] Deduced a trap composed of 61 places in 1116 ms of which 9 ms to minimize.
[2024-05-20 23:11:58] [INFO ] Deduced a trap composed of 46 places in 1073 ms of which 9 ms to minimize.
[2024-05-20 23:11:59] [INFO ] Deduced a trap composed of 53 places in 1018 ms of which 8 ms to minimize.
[2024-05-20 23:12:01] [INFO ] Deduced a trap composed of 47 places in 1065 ms of which 9 ms to minimize.
[2024-05-20 23:12:02] [INFO ] Deduced a trap composed of 48 places in 1021 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:12:03] [INFO ] Deduced a trap composed of 46 places in 1061 ms of which 8 ms to minimize.
[2024-05-20 23:12:04] [INFO ] Deduced a trap composed of 45 places in 1051 ms of which 9 ms to minimize.
[2024-05-20 23:12:05] [INFO ] Deduced a trap composed of 51 places in 1058 ms of which 9 ms to minimize.
[2024-05-20 23:12:06] [INFO ] Deduced a trap composed of 48 places in 1067 ms of which 9 ms to minimize.
[2024-05-20 23:12:07] [INFO ] Deduced a trap composed of 47 places in 1039 ms of which 9 ms to minimize.
[2024-05-20 23:12:08] [INFO ] Deduced a trap composed of 47 places in 1026 ms of which 9 ms to minimize.
[2024-05-20 23:12:09] [INFO ] Deduced a trap composed of 53 places in 1009 ms of which 9 ms to minimize.
[2024-05-20 23:12:10] [INFO ] Deduced a trap composed of 60 places in 1010 ms of which 9 ms to minimize.
[2024-05-20 23:12:11] [INFO ] Deduced a trap composed of 49 places in 1020 ms of which 10 ms to minimize.
[2024-05-20 23:12:12] [INFO ] Deduced a trap composed of 48 places in 1001 ms of which 8 ms to minimize.
[2024-05-20 23:12:13] [INFO ] Deduced a trap composed of 48 places in 995 ms of which 9 ms to minimize.
[2024-05-20 23:12:14] [INFO ] Deduced a trap composed of 50 places in 963 ms of which 9 ms to minimize.
[2024-05-20 23:12:15] [INFO ] Deduced a trap composed of 47 places in 981 ms of which 9 ms to minimize.
[2024-05-20 23:12:16] [INFO ] Deduced a trap composed of 46 places in 999 ms of which 8 ms to minimize.
[2024-05-20 23:12:17] [INFO ] Deduced a trap composed of 47 places in 1005 ms of which 9 ms to minimize.
[2024-05-20 23:12:18] [INFO ] Deduced a trap composed of 50 places in 1021 ms of which 11 ms to minimize.
[2024-05-20 23:12:19] [INFO ] Deduced a trap composed of 46 places in 937 ms of which 9 ms to minimize.
[2024-05-20 23:12:20] [INFO ] Deduced a trap composed of 72 places in 868 ms of which 7 ms to minimize.
[2024-05-20 23:12:21] [INFO ] Deduced a trap composed of 82 places in 837 ms of which 7 ms to minimize.
SMT process timed out in 48114ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 168 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 1845/1845 places, 6523/6523 transitions.
RANDOM walk for 40000 steps (216 resets) in 571 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 109645 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 1
Probabilistic random walk after 109645 steps, saw 28643 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-20 23:12:24] [INFO ] Invariant cache hit.
[2024-05-20 23:12:25] [INFO ] State equation strengthened by 6393 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/1841 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6523/8366 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8366 variables, 6393/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8366 variables, 0/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/8368 variables, 2/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2734 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:12:28] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:12:29] [INFO ] Deduced a trap composed of 96 places in 1549 ms of which 12 ms to minimize.
[2024-05-20 23:12:31] [INFO ] Deduced a trap composed of 90 places in 1492 ms of which 11 ms to minimize.
[2024-05-20 23:12:32] [INFO ] Deduced a trap composed of 80 places in 1467 ms of which 11 ms to minimize.
[2024-05-20 23:12:34] [INFO ] Deduced a trap composed of 71 places in 1500 ms of which 11 ms to minimize.
[2024-05-20 23:12:35] [INFO ] Deduced a trap composed of 66 places in 1469 ms of which 11 ms to minimize.
[2024-05-20 23:12:37] [INFO ] Deduced a trap composed of 52 places in 1418 ms of which 12 ms to minimize.
[2024-05-20 23:12:38] [INFO ] Deduced a trap composed of 50 places in 1423 ms of which 11 ms to minimize.
[2024-05-20 23:12:40] [INFO ] Deduced a trap composed of 53 places in 1420 ms of which 11 ms to minimize.
[2024-05-20 23:12:41] [INFO ] Deduced a trap composed of 57 places in 1495 ms of which 11 ms to minimize.
[2024-05-20 23:12:43] [INFO ] Deduced a trap composed of 59 places in 1404 ms of which 11 ms to minimize.
[2024-05-20 23:12:44] [INFO ] Deduced a trap composed of 56 places in 1342 ms of which 10 ms to minimize.
[2024-05-20 23:12:45] [INFO ] Deduced a trap composed of 50 places in 1364 ms of which 11 ms to minimize.
[2024-05-20 23:12:47] [INFO ] Deduced a trap composed of 50 places in 1303 ms of which 13 ms to minimize.
[2024-05-20 23:12:48] [INFO ] Deduced a trap composed of 50 places in 1296 ms of which 10 ms to minimize.
[2024-05-20 23:12:49] [INFO ] Deduced a trap composed of 49 places in 1332 ms of which 11 ms to minimize.
[2024-05-20 23:12:51] [INFO ] Deduced a trap composed of 51 places in 1336 ms of which 10 ms to minimize.
[2024-05-20 23:12:52] [INFO ] Deduced a trap composed of 60 places in 1372 ms of which 10 ms to minimize.
[2024-05-20 23:12:54] [INFO ] Deduced a trap composed of 55 places in 1358 ms of which 11 ms to minimize.
[2024-05-20 23:12:55] [INFO ] Deduced a trap composed of 48 places in 1334 ms of which 10 ms to minimize.
[2024-05-20 23:12:56] [INFO ] Deduced a trap composed of 59 places in 1309 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:12:58] [INFO ] Deduced a trap composed of 60 places in 1319 ms of which 10 ms to minimize.
[2024-05-20 23:12:59] [INFO ] Deduced a trap composed of 68 places in 1163 ms of which 9 ms to minimize.
[2024-05-20 23:13:00] [INFO ] Deduced a trap composed of 81 places in 1263 ms of which 10 ms to minimize.
[2024-05-20 23:13:01] [INFO ] Deduced a trap composed of 47 places in 1218 ms of which 10 ms to minimize.
[2024-05-20 23:13:03] [INFO ] Deduced a trap composed of 74 places in 1258 ms of which 10 ms to minimize.
[2024-05-20 23:13:04] [INFO ] Deduced a trap composed of 64 places in 1266 ms of which 10 ms to minimize.
[2024-05-20 23:13:05] [INFO ] Deduced a trap composed of 60 places in 1295 ms of which 10 ms to minimize.
[2024-05-20 23:13:07] [INFO ] Deduced a trap composed of 52 places in 1271 ms of which 11 ms to minimize.
[2024-05-20 23:13:08] [INFO ] Deduced a trap composed of 48 places in 1267 ms of which 10 ms to minimize.
[2024-05-20 23:13:09] [INFO ] Deduced a trap composed of 52 places in 1294 ms of which 10 ms to minimize.
[2024-05-20 23:13:11] [INFO ] Deduced a trap composed of 46 places in 1300 ms of which 11 ms to minimize.
[2024-05-20 23:13:12] [INFO ] Deduced a trap composed of 55 places in 1311 ms of which 11 ms to minimize.
[2024-05-20 23:13:13] [INFO ] Deduced a trap composed of 50 places in 1290 ms of which 11 ms to minimize.
[2024-05-20 23:13:15] [INFO ] Deduced a trap composed of 49 places in 1301 ms of which 10 ms to minimize.
[2024-05-20 23:13:16] [INFO ] Deduced a trap composed of 46 places in 1257 ms of which 10 ms to minimize.
[2024-05-20 23:13:17] [INFO ] Deduced a trap composed of 65 places in 1314 ms of which 10 ms to minimize.
[2024-05-20 23:13:18] [INFO ] Deduced a trap composed of 49 places in 1229 ms of which 10 ms to minimize.
[2024-05-20 23:13:20] [INFO ] Deduced a trap composed of 51 places in 1224 ms of which 13 ms to minimize.
[2024-05-20 23:13:21] [INFO ] Deduced a trap composed of 48 places in 1214 ms of which 9 ms to minimize.
[2024-05-20 23:13:22] [INFO ] Deduced a trap composed of 58 places in 1208 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:13:23] [INFO ] Deduced a trap composed of 60 places in 1166 ms of which 9 ms to minimize.
[2024-05-20 23:13:25] [INFO ] Deduced a trap composed of 62 places in 1119 ms of which 9 ms to minimize.
[2024-05-20 23:13:26] [INFO ] Deduced a trap composed of 53 places in 1108 ms of which 9 ms to minimize.
[2024-05-20 23:13:27] [INFO ] Deduced a trap composed of 57 places in 1152 ms of which 9 ms to minimize.
[2024-05-20 23:13:28] [INFO ] Deduced a trap composed of 55 places in 1127 ms of which 9 ms to minimize.
[2024-05-20 23:13:29] [INFO ] Deduced a trap composed of 55 places in 1115 ms of which 9 ms to minimize.
[2024-05-20 23:13:30] [INFO ] Deduced a trap composed of 67 places in 1111 ms of which 9 ms to minimize.
[2024-05-20 23:13:31] [INFO ] Deduced a trap composed of 62 places in 1106 ms of which 9 ms to minimize.
[2024-05-20 23:13:33] [INFO ] Deduced a trap composed of 61 places in 1101 ms of which 9 ms to minimize.
[2024-05-20 23:13:34] [INFO ] Deduced a trap composed of 50 places in 1094 ms of which 9 ms to minimize.
[2024-05-20 23:13:35] [INFO ] Deduced a trap composed of 51 places in 1137 ms of which 9 ms to minimize.
[2024-05-20 23:13:36] [INFO ] Deduced a trap composed of 51 places in 1127 ms of which 9 ms to minimize.
[2024-05-20 23:13:37] [INFO ] Deduced a trap composed of 51 places in 1136 ms of which 9 ms to minimize.
[2024-05-20 23:13:38] [INFO ] Deduced a trap composed of 67 places in 1132 ms of which 10 ms to minimize.
[2024-05-20 23:13:39] [INFO ] Deduced a trap composed of 68 places in 1137 ms of which 10 ms to minimize.
[2024-05-20 23:13:41] [INFO ] Deduced a trap composed of 53 places in 1147 ms of which 9 ms to minimize.
[2024-05-20 23:13:42] [INFO ] Deduced a trap composed of 52 places in 1133 ms of which 10 ms to minimize.
[2024-05-20 23:13:43] [INFO ] Deduced a trap composed of 48 places in 1059 ms of which 9 ms to minimize.
SMT process timed out in 78458ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 175 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 166 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
[2024-05-20 23:13:43] [INFO ] Invariant cache hit.
[2024-05-20 23:13:45] [INFO ] Implicit Places using invariants in 1888 ms returned []
[2024-05-20 23:13:45] [INFO ] Invariant cache hit.
[2024-05-20 23:13:47] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 23:14:17] [INFO ] Performed 717/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:14:47] [INFO ] Performed 1781/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:14:49] [INFO ] Implicit Places using invariants and state equation in 63944 ms returned []
Implicit Place search using SMT with State Equation took 65834 ms to find 0 implicit places.
[2024-05-20 23:14:50] [INFO ] Redundant transitions in 473 ms returned []
Running 6483 sub problems to find dead transitions.
[2024-05-20 23:14:50] [INFO ] Invariant cache hit.
[2024-05-20 23:14:50] [INFO ] State equation strengthened by 6393 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6483 unsolved
SMT process timed out in 36450ms, After SMT, problems are : Problem set: 0 solved, 6483 unsolved
Search for dead transitions found 0 dead transitions in 36504ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103002 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (AND p0 p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 21 factoid took 347 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 185 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:15:27] [INFO ] Computed 42 invariants in 383 ms
[2024-05-20 23:15:29] [INFO ] Implicit Places using invariants in 2404 ms returned []
[2024-05-20 23:15:29] [INFO ] Invariant cache hit.
[2024-05-20 23:15:32] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:16:03] [INFO ] Performed 371/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:16:13] [INFO ] Implicit Places using invariants and state equation in 43989 ms returned []
Implicit Place search using SMT with State Equation took 46395 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:16:13] [INFO ] Invariant cache hit.
[2024-05-20 23:16:13] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 1.0)
(s569 1.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 1.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39268ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39343ms
Finished structural reductions in LTL mode , in 1 iterations and 85941 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (AND p0 p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 117 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (39 resets) in 489 ms. (81 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
[2024-05-20 23:16:53] [INFO ] Invariant cache hit.
[2024-05-20 23:16:53] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 78/3679 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/3681 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3681 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9840/13521 variables, 3681/3723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13521/13523 variables, and 6883 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3524 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3681/3683 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3596/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:16:57] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-20 23:16:57] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-20 23:16:58] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-20 23:16:58] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-20 23:16:58] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-20 23:16:58] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-20 23:16:58] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-20 23:16:58] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-05-20 23:16:58] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-20 23:16:59] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-20 23:16:59] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-05-20 23:16:59] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:16:59] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-20 23:16:59] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-20 23:16:59] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-20 23:16:59] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-20 23:17:00] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-05-20 23:17:00] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 23:17:00] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-20 23:17:00] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 23:17:00] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-20 23:17:00] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 23:17:00] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-05-20 23:17:00] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-20 23:17:01] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-20 23:17:01] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-20 23:17:01] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 1 ms to minimize.
[2024-05-20 23:17:01] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-20 23:17:01] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-20 23:17:01] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-20 23:17:01] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-20 23:17:02] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-20 23:17:02] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-20 23:17:02] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3601/13523 variables, and 35 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/40 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/3683 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 34/34 constraints]
After SMT, in 8581ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 2 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 2 with 3114 rules applied. Total rules applied 3674 place count 1846 transition count 8003
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 2 with 1479 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5154 place count 1846 transition count 6523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5155 place count 1845 transition count 6523
Partial Free-agglomeration rule applied 1639 times.
Drop transitions (Partial Free agglomeration) removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 6794 place count 1845 transition count 6523
Applied a total of 6794 rules in 1189 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6523/9840 (removed 3317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1189 ms. Remains : 1845/3683 places, 6523/9840 transitions.
RANDOM walk for 40000 steps (215 resets) in 899 ms. (44 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
// Phase 1: matrix 6523 rows 1845 cols
[2024-05-20 23:17:03] [INFO ] Computed 42 invariants in 166 ms
[2024-05-20 23:17:04] [INFO ] State equation strengthened by 6393 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/1841 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6523/8366 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8366 variables, 6393/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8366 variables, 0/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/8368 variables, 2/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2854 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:17:07] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:17:08] [INFO ] Deduced a trap composed of 76 places in 1457 ms of which 13 ms to minimize.
[2024-05-20 23:17:10] [INFO ] Deduced a trap composed of 73 places in 1545 ms of which 12 ms to minimize.
[2024-05-20 23:17:11] [INFO ] Deduced a trap composed of 80 places in 1519 ms of which 11 ms to minimize.
[2024-05-20 23:17:13] [INFO ] Deduced a trap composed of 65 places in 1523 ms of which 11 ms to minimize.
[2024-05-20 23:17:14] [INFO ] Deduced a trap composed of 62 places in 1482 ms of which 11 ms to minimize.
[2024-05-20 23:17:16] [INFO ] Deduced a trap composed of 49 places in 1473 ms of which 11 ms to minimize.
[2024-05-20 23:17:17] [INFO ] Deduced a trap composed of 49 places in 1409 ms of which 11 ms to minimize.
[2024-05-20 23:17:19] [INFO ] Deduced a trap composed of 70 places in 1293 ms of which 10 ms to minimize.
[2024-05-20 23:17:20] [INFO ] Deduced a trap composed of 45 places in 1210 ms of which 10 ms to minimize.
[2024-05-20 23:17:21] [INFO ] Deduced a trap composed of 48 places in 1200 ms of which 10 ms to minimize.
[2024-05-20 23:17:22] [INFO ] Deduced a trap composed of 47 places in 1196 ms of which 10 ms to minimize.
[2024-05-20 23:17:24] [INFO ] Deduced a trap composed of 46 places in 1196 ms of which 10 ms to minimize.
[2024-05-20 23:17:25] [INFO ] Deduced a trap composed of 46 places in 1201 ms of which 9 ms to minimize.
[2024-05-20 23:17:26] [INFO ] Deduced a trap composed of 48 places in 1175 ms of which 10 ms to minimize.
[2024-05-20 23:17:27] [INFO ] Deduced a trap composed of 47 places in 1210 ms of which 10 ms to minimize.
[2024-05-20 23:17:29] [INFO ] Deduced a trap composed of 47 places in 1194 ms of which 10 ms to minimize.
[2024-05-20 23:17:30] [INFO ] Deduced a trap composed of 56 places in 1181 ms of which 10 ms to minimize.
[2024-05-20 23:17:31] [INFO ] Deduced a trap composed of 67 places in 1280 ms of which 10 ms to minimize.
[2024-05-20 23:17:32] [INFO ] Deduced a trap composed of 55 places in 1237 ms of which 10 ms to minimize.
[2024-05-20 23:17:34] [INFO ] Deduced a trap composed of 53 places in 1212 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:17:35] [INFO ] Deduced a trap composed of 79 places in 1105 ms of which 10 ms to minimize.
[2024-05-20 23:17:36] [INFO ] Deduced a trap composed of 48 places in 1092 ms of which 10 ms to minimize.
[2024-05-20 23:17:37] [INFO ] Deduced a trap composed of 55 places in 1071 ms of which 9 ms to minimize.
[2024-05-20 23:17:38] [INFO ] Deduced a trap composed of 53 places in 1076 ms of which 9 ms to minimize.
[2024-05-20 23:17:39] [INFO ] Deduced a trap composed of 53 places in 1050 ms of which 9 ms to minimize.
[2024-05-20 23:17:40] [INFO ] Deduced a trap composed of 50 places in 1022 ms of which 9 ms to minimize.
[2024-05-20 23:17:41] [INFO ] Deduced a trap composed of 58 places in 1000 ms of which 9 ms to minimize.
[2024-05-20 23:17:42] [INFO ] Deduced a trap composed of 67 places in 986 ms of which 8 ms to minimize.
[2024-05-20 23:17:43] [INFO ] Deduced a trap composed of 51 places in 1004 ms of which 9 ms to minimize.
[2024-05-20 23:17:44] [INFO ] Deduced a trap composed of 68 places in 1028 ms of which 9 ms to minimize.
[2024-05-20 23:17:45] [INFO ] Deduced a trap composed of 49 places in 985 ms of which 8 ms to minimize.
[2024-05-20 23:17:46] [INFO ] Deduced a trap composed of 63 places in 933 ms of which 9 ms to minimize.
[2024-05-20 23:17:47] [INFO ] Deduced a trap composed of 46 places in 853 ms of which 8 ms to minimize.
[2024-05-20 23:17:48] [INFO ] Deduced a trap composed of 46 places in 872 ms of which 8 ms to minimize.
[2024-05-20 23:17:49] [INFO ] Deduced a trap composed of 45 places in 871 ms of which 8 ms to minimize.
[2024-05-20 23:17:50] [INFO ] Deduced a trap composed of 63 places in 824 ms of which 7 ms to minimize.
[2024-05-20 23:17:51] [INFO ] Deduced a trap composed of 46 places in 795 ms of which 7 ms to minimize.
[2024-05-20 23:17:51] [INFO ] Deduced a trap composed of 56 places in 876 ms of which 8 ms to minimize.
SMT process timed out in 48202ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 168 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 1845/1845 places, 6523/6523 transitions.
RANDOM walk for 40000 steps (215 resets) in 639 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 114378 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 114378 steps, saw 32331 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-20 23:17:55] [INFO ] Invariant cache hit.
[2024-05-20 23:17:55] [INFO ] State equation strengthened by 6393 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/1841 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6523/8366 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8366 variables, 6393/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8366 variables, 0/8278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/8368 variables, 2/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/8368 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8368/8368 variables, and 8280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2559 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:17:58] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:17:59] [INFO ] Deduced a trap composed of 50 places in 1447 ms of which 11 ms to minimize.
[2024-05-20 23:18:01] [INFO ] Deduced a trap composed of 48 places in 1431 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6523/8366 variables, 1843/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8366 variables, 6393/8281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8366 variables, 1/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8366 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/8368 variables, 2/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8368 variables, 0/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/8368 variables, 0/8284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8368/8368 variables, and 8284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6953 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 9576ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 167 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 168 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
[2024-05-20 23:18:05] [INFO ] Invariant cache hit.
[2024-05-20 23:18:07] [INFO ] Implicit Places using invariants in 1871 ms returned []
[2024-05-20 23:18:07] [INFO ] Invariant cache hit.
[2024-05-20 23:18:08] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 23:18:39] [INFO ] Performed 681/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:19:09] [INFO ] Performed 1672/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:19:14] [INFO ] Implicit Places using invariants and state equation in 66962 ms returned []
Implicit Place search using SMT with State Equation took 68835 ms to find 0 implicit places.
[2024-05-20 23:19:14] [INFO ] Redundant transitions in 470 ms returned []
Running 6483 sub problems to find dead transitions.
[2024-05-20 23:19:14] [INFO ] Invariant cache hit.
[2024-05-20 23:19:14] [INFO ] State equation strengthened by 6393 read => feed constraints.
(s786 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6483 unsolved
SMT process timed out in 36114ms, After SMT, problems are : Problem set: 0 solved, 6483 unsolved
Search for dead transitions found 0 dead transitions in 36164ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105659 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p1), (X (AND p0 p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F p2), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 19 factoid took 449 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 101 reset in 1023 ms.
Product exploration explored 100000 steps with 105 reset in 1128 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 3683 transition count 9840
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 200 place count 3683 transition count 9840
Deduced a syphon composed of 240 places in 2 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 240 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 320 place count 3603 transition count 9760
Deduced a syphon composed of 160 places in 2 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 400 place count 3603 transition count 9760
Performed 1597 Post agglomeration using F-continuation condition.Transition count delta: -3034
Deduced a syphon composed of 1757 places in 3 ms
Iterating global reduction 1 with 1597 rules applied. Total rules applied 1997 place count 3603 transition count 12794
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 2157 place count 3443 transition count 12634
Deduced a syphon composed of 1597 places in 2 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 2317 place count 3443 transition count 12634
Deduced a syphon composed of 1597 places in 2 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 1 with 1479 rules applied. Total rules applied 3796 place count 3443 transition count 11155
Deduced a syphon composed of 1597 places in 2 ms
Applied a total of 3796 rules in 2095 ms. Remains 3443 /3683 variables (removed 240) and now considering 11155/9840 (removed -1315) transitions.
Running 11115 sub problems to find dead transitions.
// Phase 1: matrix 11155 rows 3443 cols
[2024-05-20 23:19:57] [INFO ] Computed 42 invariants in 386 ms
[2024-05-20 23:19:57] [INFO ] State equation strengthened by 4755 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 1.0)
(s470 0.0)
(s471 1.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3442 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 11115 unsolved
SMT process timed out in 42756ms, After SMT, problems are : Problem set: 0 solved, 11115 unsolved
Search for dead transitions found 0 dead transitions in 42838ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3443/3683 places, 11155/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44948 ms. Remains : 3443/3683 places, 11155/9840 transitions.
Built C files in :
/tmp/ltsmin3866863152529761927
[2024-05-20 23:20:39] [INFO ] Built C files in 203ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3866863152529761927
Running compilation step : cd /tmp/ltsmin3866863152529761927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3866863152529761927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3866863152529761927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 184 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:20:43] [INFO ] Computed 42 invariants in 380 ms
[2024-05-20 23:20:45] [INFO ] Implicit Places using invariants in 2542 ms returned []
[2024-05-20 23:20:45] [INFO ] Invariant cache hit.
[2024-05-20 23:20:48] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:21:18] [INFO ] Performed 308/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:21:34] [INFO ] Implicit Places using invariants and state equation in 49271 ms returned []
Implicit Place search using SMT with State Equation took 51813 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:21:34] [INFO ] Invariant cache hit.
[2024-05-20 23:21:34] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 0.0)
(s572 1.0)
(s573 1.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 1.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 1.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 1.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 timeout
0.0)
(s1167 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38859ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38933ms
Finished structural reductions in LTL mode , in 1 iterations and 90942 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Built C files in :
/tmp/ltsmin2873383856806028345
[2024-05-20 23:22:13] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2873383856806028345
Running compilation step : cd /tmp/ltsmin2873383856806028345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2873383856806028345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2873383856806028345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 23:22:17] [INFO ] Flatten gal took : 198 ms
[2024-05-20 23:22:17] [INFO ] Flatten gal took : 194 ms
[2024-05-20 23:22:17] [INFO ] Time to serialize gal into /tmp/LTL15050639302374799572.gal : 63 ms
[2024-05-20 23:22:17] [INFO ] Time to serialize properties into /tmp/LTL299621458249797436.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15050639302374799572.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4954152563836647578.hoa' '-atoms' '/tmp/LTL299621458249797436.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL299621458249797436.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4954152563836647578.hoa
Detected timeout of ITS tools.
[2024-05-20 23:22:32] [INFO ] Flatten gal took : 175 ms
[2024-05-20 23:22:33] [INFO ] Flatten gal took : 179 ms
[2024-05-20 23:22:33] [INFO ] Time to serialize gal into /tmp/LTL10436092525024501529.gal : 34 ms
[2024-05-20 23:22:33] [INFO ] Time to serialize properties into /tmp/LTL15636694998295522636.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10436092525024501529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15636694998295522636.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("(Node34requestsent22<=Node24requestsent27)")U((X(G("(Node6GiveAnswer21<1)")))||(F(("(Node34requestsent22>Node24requestsent27)")&&...261
Formula 0 simplified : !"(Node34requestsent22<=Node24requestsent27)" R (XF!"(Node6GiveAnswer21<1)" & G(!"(Node34requestsent22>Node24requestsent27)" | X(G!"...246
Detected timeout of ITS tools.
[2024-05-20 23:22:48] [INFO ] Flatten gal took : 167 ms
[2024-05-20 23:22:48] [INFO ] Applying decomposition
[2024-05-20 23:22:48] [INFO ] Flatten gal took : 169 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1889887733459308630.txt' '-o' '/tmp/graph1889887733459308630.bin' '-w' '/tmp/graph1889887733459308630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1889887733459308630.bin' '-l' '-1' '-v' '-w' '/tmp/graph1889887733459308630.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:22:48] [INFO ] Decomposing Gal with order
[2024-05-20 23:22:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:22:50] [INFO ] Removed a total of 4826 redundant transitions.
[2024-05-20 23:22:50] [INFO ] Flatten gal took : 857 ms
[2024-05-20 23:22:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 3036 labels/synchronizations in 312 ms.
[2024-05-20 23:22:51] [INFO ] Time to serialize gal into /tmp/LTL9529714158224108834.gal : 53 ms
[2024-05-20 23:22:51] [INFO ] Time to serialize properties into /tmp/LTL15750995971375150098.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9529714158224108834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15750995971375150098.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("(gu160.Node34requestsent22<=gu160.Node24requestsent27)")U((X(G("(gi0.gi11.gu86.Node6GiveAnswer21<1)")))||(F(("(gu160.Node34reques...323
Formula 0 simplified : !"(gu160.Node34requestsent22<=gu160.Node24requestsent27)" R (XF!"(gi0.gi11.gu86.Node6GiveAnswer21<1)" & G(!"(gu160.Node34requestsent...308
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-03 finished in 793568 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 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 185 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 23:23:06] [INFO ] Invariant cache hit.
[2024-05-20 23:23:08] [INFO ] Implicit Places using invariants in 2095 ms returned []
[2024-05-20 23:23:08] [INFO ] Invariant cache hit.
[2024-05-20 23:23:11] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:23:42] [INFO ] Performed 343/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:23:55] [INFO ] Implicit Places using invariants and state equation in 46731 ms returned []
Implicit Place search using SMT with State Equation took 48828 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:23:55] [INFO ] Invariant cache hit.
[2024-05-20 23:23:55] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38936ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39010ms
Finished structural reductions in LTL mode , in 1 iterations and 88034 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-04
Stuttering criterion allowed to conclude after 1044 steps with 0 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-04 finished in 88133 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((G((G(p1) U p2))||p0))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 828 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 23:24:35] [INFO ] Computed 42 invariants in 133 ms
[2024-05-20 23:24:36] [INFO ] Implicit Places using invariants in 1258 ms returned []
[2024-05-20 23:24:36] [INFO ] Invariant cache hit.
[2024-05-20 23:24:38] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:24:54] [INFO ] Implicit Places using invariants and state equation in 17581 ms returned []
Implicit Place search using SMT with State Equation took 18840 ms to find 0 implicit places.
[2024-05-20 23:24:55] [INFO ] Redundant transitions in 680 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-20 23:24:55] [INFO ] Invariant cache hit.
[2024-05-20 23:24:55] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34918ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 34966ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55331 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-07
Product exploration explored 100000 steps with 490 reset in 929 ms.
Product exploration explored 100000 steps with 491 reset in 962 ms.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Detected a total of 124/1845 stabilizing places and 201/6521 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 17 factoid took 201 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (194 resets) in 590 ms. (67 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
[2024-05-20 23:25:32] [INFO ] Invariant cache hit.
[2024-05-20 23:25:32] [INFO ] State equation strengthened by 4757 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/1841 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6521/8364 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8364 variables, 4757/6642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8364 variables, 0/6642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8366 variables, 2/6644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8366 variables, 0/6644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8366/8366 variables, and 6644 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:25:38] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
[2024-05-20 23:25:38] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:25:40] [INFO ] Deduced a trap composed of 46 places in 1281 ms of which 12 ms to minimize.
[2024-05-20 23:25:41] [INFO ] Deduced a trap composed of 56 places in 1455 ms of which 11 ms to minimize.
[2024-05-20 23:25:43] [INFO ] Deduced a trap composed of 46 places in 1356 ms of which 11 ms to minimize.
SMT process timed out in 10379ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 442 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 443 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (215 resets) in 2145 ms. (18 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 85747 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 7
Probabilistic random walk after 85747 steps, saw 23751 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-20 23:25:47] [INFO ] Computed 42 invariants in 176 ms
[2024-05-20 23:25:47] [INFO ] State equation strengthened by 6394 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/1839 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1839 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1841 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6519/8360 variables, 1841/1883 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8360 variables, 6394/8277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8360 variables, 0/8277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8362 variables, 2/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8362 variables, 0/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/8362 variables, 0/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8279 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6775 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:25:54] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:25:57] [INFO ] Deduced a trap composed of 57 places in 1435 ms of which 10 ms to minimize.
[2024-05-20 23:25:58] [INFO ] Deduced a trap composed of 53 places in 1373 ms of which 10 ms to minimize.
[2024-05-20 23:25:59] [INFO ] Deduced a trap composed of 57 places in 1331 ms of which 10 ms to minimize.
[2024-05-20 23:26:01] [INFO ] Deduced a trap composed of 56 places in 1408 ms of which 11 ms to minimize.
[2024-05-20 23:26:02] [INFO ] Deduced a trap composed of 60 places in 1410 ms of which 12 ms to minimize.
[2024-05-20 23:26:04] [INFO ] Deduced a trap composed of 55 places in 1362 ms of which 12 ms to minimize.
[2024-05-20 23:26:05] [INFO ] Deduced a trap composed of 58 places in 1380 ms of which 11 ms to minimize.
[2024-05-20 23:26:07] [INFO ] Deduced a trap composed of 56 places in 1333 ms of which 10 ms to minimize.
[2024-05-20 23:26:08] [INFO ] Deduced a trap composed of 59 places in 1269 ms of which 11 ms to minimize.
[2024-05-20 23:26:09] [INFO ] Deduced a trap composed of 58 places in 1354 ms of which 10 ms to minimize.
[2024-05-20 23:26:11] [INFO ] Deduced a trap composed of 59 places in 1299 ms of which 10 ms to minimize.
[2024-05-20 23:26:12] [INFO ] Deduced a trap composed of 55 places in 1290 ms of which 11 ms to minimize.
[2024-05-20 23:26:13] [INFO ] Deduced a trap composed of 57 places in 1330 ms of which 10 ms to minimize.
[2024-05-20 23:26:15] [INFO ] Deduced a trap composed of 55 places in 1321 ms of which 11 ms to minimize.
[2024-05-20 23:26:16] [INFO ] Deduced a trap composed of 58 places in 1323 ms of which 11 ms to minimize.
[2024-05-20 23:26:17] [INFO ] Deduced a trap composed of 50 places in 1316 ms of which 10 ms to minimize.
[2024-05-20 23:26:19] [INFO ] Deduced a trap composed of 53 places in 1268 ms of which 10 ms to minimize.
[2024-05-20 23:26:20] [INFO ] Deduced a trap composed of 45 places in 1214 ms of which 10 ms to minimize.
[2024-05-20 23:26:21] [INFO ] Deduced a trap composed of 55 places in 1184 ms of which 9 ms to minimize.
[2024-05-20 23:26:22] [INFO ] Deduced a trap composed of 58 places in 1181 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:26:23] [INFO ] Deduced a trap composed of 64 places in 1118 ms of which 9 ms to minimize.
[2024-05-20 23:26:24] [INFO ] Deduced a trap composed of 50 places in 1031 ms of which 8 ms to minimize.
[2024-05-20 23:26:25] [INFO ] Deduced a trap composed of 51 places in 995 ms of which 9 ms to minimize.
[2024-05-20 23:26:27] [INFO ] Deduced a trap composed of 56 places in 1053 ms of which 9 ms to minimize.
[2024-05-20 23:26:28] [INFO ] Deduced a trap composed of 54 places in 1051 ms of which 8 ms to minimize.
[2024-05-20 23:26:29] [INFO ] Deduced a trap composed of 58 places in 1011 ms of which 8 ms to minimize.
[2024-05-20 23:26:30] [INFO ] Deduced a trap composed of 54 places in 999 ms of which 9 ms to minimize.
[2024-05-20 23:26:31] [INFO ] Deduced a trap composed of 61 places in 944 ms of which 8 ms to minimize.
[2024-05-20 23:26:32] [INFO ] Deduced a trap composed of 47 places in 935 ms of which 8 ms to minimize.
[2024-05-20 23:26:33] [INFO ] Deduced a trap composed of 52 places in 908 ms of which 7 ms to minimize.
[2024-05-20 23:26:34] [INFO ] Deduced a trap composed of 83 places in 940 ms of which 9 ms to minimize.
[2024-05-20 23:26:34] [INFO ] Deduced a trap composed of 76 places in 898 ms of which 7 ms to minimize.
[2024-05-20 23:26:35] [INFO ] Deduced a trap composed of 61 places in 876 ms of which 7 ms to minimize.
[2024-05-20 23:26:36] [INFO ] Deduced a trap composed of 57 places in 870 ms of which 7 ms to minimize.
[2024-05-20 23:26:37] [INFO ] Deduced a trap composed of 53 places in 864 ms of which 8 ms to minimize.
[2024-05-20 23:26:38] [INFO ] Deduced a trap composed of 75 places in 867 ms of which 8 ms to minimize.
[2024-05-20 23:26:39] [INFO ] Deduced a trap composed of 58 places in 914 ms of which 8 ms to minimize.
[2024-05-20 23:26:40] [INFO ] Deduced a trap composed of 56 places in 876 ms of which 8 ms to minimize.
SMT process timed out in 52768ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 162 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 155 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-20 23:26:40] [INFO ] Invariant cache hit.
[2024-05-20 23:26:42] [INFO ] Implicit Places using invariants in 1852 ms returned []
[2024-05-20 23:26:42] [INFO ] Invariant cache hit.
[2024-05-20 23:26:44] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 23:27:14] [INFO ] Performed 830/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:27:44] [INFO ] Performed 1833/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:27:44] [INFO ] Implicit Places using invariants and state equation in 62133 ms returned []
Implicit Place search using SMT with State Equation took 63986 ms to find 0 implicit places.
[2024-05-20 23:27:45] [INFO ] Redundant transitions in 465 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-20 23:27:45] [INFO ] Invariant cache hit.
[2024-05-20 23:27:45] [INFO ] State equation strengthened by 6394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36115ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36165ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100790 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2)]
Knowledge based reduction with 17 factoid took 237 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 144 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 23:28:22] [INFO ] Computed 42 invariants in 124 ms
[2024-05-20 23:28:23] [INFO ] Implicit Places using invariants in 1349 ms returned []
[2024-05-20 23:28:23] [INFO ] Invariant cache hit.
[2024-05-20 23:28:24] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:28:40] [INFO ] Implicit Places using invariants and state equation in 17374 ms returned []
Implicit Place search using SMT with State Equation took 18724 ms to find 0 implicit places.
[2024-05-20 23:28:41] [INFO ] Redundant transitions in 441 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-20 23:28:41] [INFO ] Invariant cache hit.
[2024-05-20 23:28:41] [INFO ] State equation strengthened by 4757 read => feed constraints.
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/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 34990ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35040ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54366 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Detected a total of 124/1845 stabilizing places and 201/6521 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 17 factoid took 214 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (193 resets) in 1895 ms. (21 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
[2024-05-20 23:29:17] [INFO ] Invariant cache hit.
[2024-05-20 23:29:17] [INFO ] State equation strengthened by 4757 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/1841 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1841 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1843 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1843 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6521/8364 variables, 1843/1885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8364 variables, 4757/6642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8364 variables, 0/6642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8366 variables, 2/6644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8366 variables, 0/6644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8366/8366 variables, and 6644 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 4757/4757 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1765 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:29:22] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-20 23:29:22] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1765 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1765 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 76/1841 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:29:25] [INFO ] Deduced a trap composed of 46 places in 1453 ms of which 10 ms to minimize.
[2024-05-20 23:29:26] [INFO ] Deduced a trap composed of 56 places in 1414 ms of which 11 ms to minimize.
[2024-05-20 23:29:28] [INFO ] Deduced a trap composed of 46 places in 1392 ms of which 11 ms to minimize.
SMT process timed out in 10541ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions (Partial Free agglomeration) removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 448 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 448 ms. Remains : 1843/1845 places, 6519/6521 transitions.
RANDOM walk for 40000 steps (214 resets) in 2136 ms. (18 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 82606 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 7
Probabilistic random walk after 82606 steps, saw 23335 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-20 23:29:32] [INFO ] Computed 42 invariants in 154 ms
[2024-05-20 23:29:32] [INFO ] State equation strengthened by 6394 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 76/1839 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1839 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/1841 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6519/8360 variables, 1841/1883 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8360 variables, 6394/8277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8360 variables, 0/8277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/8362 variables, 2/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8362 variables, 0/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/8362 variables, 0/8279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8362/8362 variables, and 8279 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6376 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1843/1843 constraints, ReadFeed: 6394/6394 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1763 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:29:39] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 76/1839 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1839 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/1841 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:29:41] [INFO ] Deduced a trap composed of 57 places in 1453 ms of which 11 ms to minimize.
[2024-05-20 23:29:42] [INFO ] Deduced a trap composed of 53 places in 1409 ms of which 11 ms to minimize.
[2024-05-20 23:29:44] [INFO ] Deduced a trap composed of 57 places in 1401 ms of which 11 ms to minimize.
[2024-05-20 23:29:45] [INFO ] Deduced a trap composed of 56 places in 1415 ms of which 11 ms to minimize.
[2024-05-20 23:29:47] [INFO ] Deduced a trap composed of 60 places in 1394 ms of which 11 ms to minimize.
[2024-05-20 23:29:48] [INFO ] Deduced a trap composed of 55 places in 1353 ms of which 11 ms to minimize.
[2024-05-20 23:29:50] [INFO ] Deduced a trap composed of 58 places in 1315 ms of which 10 ms to minimize.
[2024-05-20 23:29:51] [INFO ] Deduced a trap composed of 56 places in 1295 ms of which 10 ms to minimize.
[2024-05-20 23:29:52] [INFO ] Deduced a trap composed of 59 places in 1344 ms of which 11 ms to minimize.
[2024-05-20 23:29:54] [INFO ] Deduced a trap composed of 58 places in 1343 ms of which 10 ms to minimize.
[2024-05-20 23:29:55] [INFO ] Deduced a trap composed of 59 places in 1297 ms of which 10 ms to minimize.
[2024-05-20 23:29:56] [INFO ] Deduced a trap composed of 55 places in 1277 ms of which 10 ms to minimize.
[2024-05-20 23:29:58] [INFO ] Deduced a trap composed of 57 places in 1316 ms of which 10 ms to minimize.
[2024-05-20 23:29:59] [INFO ] Deduced a trap composed of 55 places in 1289 ms of which 10 ms to minimize.
[2024-05-20 23:30:00] [INFO ] Deduced a trap composed of 58 places in 1274 ms of which 10 ms to minimize.
[2024-05-20 23:30:01] [INFO ] Deduced a trap composed of 50 places in 1262 ms of which 10 ms to minimize.
[2024-05-20 23:30:03] [INFO ] Deduced a trap composed of 53 places in 1179 ms of which 10 ms to minimize.
[2024-05-20 23:30:04] [INFO ] Deduced a trap composed of 45 places in 1183 ms of which 9 ms to minimize.
[2024-05-20 23:30:05] [INFO ] Deduced a trap composed of 55 places in 1148 ms of which 9 ms to minimize.
[2024-05-20 23:30:06] [INFO ] Deduced a trap composed of 58 places in 1128 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-20 23:30:07] [INFO ] Deduced a trap composed of 64 places in 1136 ms of which 9 ms to minimize.
[2024-05-20 23:30:08] [INFO ] Deduced a trap composed of 50 places in 1052 ms of which 9 ms to minimize.
[2024-05-20 23:30:10] [INFO ] Deduced a trap composed of 51 places in 1128 ms of which 9 ms to minimize.
[2024-05-20 23:30:11] [INFO ] Deduced a trap composed of 56 places in 1061 ms of which 9 ms to minimize.
[2024-05-20 23:30:12] [INFO ] Deduced a trap composed of 54 places in 1041 ms of which 9 ms to minimize.
[2024-05-20 23:30:13] [INFO ] Deduced a trap composed of 58 places in 1017 ms of which 8 ms to minimize.
[2024-05-20 23:30:14] [INFO ] Deduced a trap composed of 54 places in 936 ms of which 8 ms to minimize.
[2024-05-20 23:30:15] [INFO ] Deduced a trap composed of 61 places in 963 ms of which 9 ms to minimize.
[2024-05-20 23:30:16] [INFO ] Deduced a trap composed of 47 places in 954 ms of which 9 ms to minimize.
[2024-05-20 23:30:17] [INFO ] Deduced a trap composed of 52 places in 902 ms of which 8 ms to minimize.
[2024-05-20 23:30:18] [INFO ] Deduced a trap composed of 83 places in 957 ms of which 8 ms to minimize.
[2024-05-20 23:30:19] [INFO ] Deduced a trap composed of 76 places in 888 ms of which 8 ms to minimize.
[2024-05-20 23:30:19] [INFO ] Deduced a trap composed of 61 places in 884 ms of which 8 ms to minimize.
[2024-05-20 23:30:20] [INFO ] Deduced a trap composed of 57 places in 875 ms of which 8 ms to minimize.
[2024-05-20 23:30:21] [INFO ] Deduced a trap composed of 53 places in 875 ms of which 8 ms to minimize.
[2024-05-20 23:30:22] [INFO ] Deduced a trap composed of 75 places in 881 ms of which 8 ms to minimize.
[2024-05-20 23:30:23] [INFO ] Deduced a trap composed of 58 places in 926 ms of which 8 ms to minimize.
[2024-05-20 23:30:24] [INFO ] Deduced a trap composed of 56 places in 896 ms of which 8 ms to minimize.
SMT process timed out in 52120ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 157 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 153 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-20 23:30:24] [INFO ] Invariant cache hit.
[2024-05-20 23:30:26] [INFO ] Implicit Places using invariants in 1889 ms returned []
[2024-05-20 23:30:26] [INFO ] Invariant cache hit.
[2024-05-20 23:30:28] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 23:30:58] [INFO ] Performed 728/1843 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:31:28] [INFO ] Performed 1640/1843 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:31:34] [INFO ] Implicit Places using invariants and state equation in 68089 ms returned []
Implicit Place search using SMT with State Equation took 69980 ms to find 0 implicit places.
[2024-05-20 23:31:35] [INFO ] Redundant transitions in 464 ms returned []
Running 6479 sub problems to find dead transitions.
[2024-05-20 23:31:35] [INFO ] Invariant cache hit.
[2024-05-20 23:31:35] [INFO ] State equation strengthened by 6394 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6479 unsolved
SMT process timed out in 36165ms, After SMT, problems are : Problem set: 0 solved, 6479 unsolved
Search for dead transitions found 0 dead transitions in 36216ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106833 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p2)]
Knowledge based reduction with 17 factoid took 258 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 493 reset in 1058 ms.
Product exploration explored 100000 steps with 493 reset in 973 ms.
Built C files in :
/tmp/ltsmin1465549116258957644
[2024-05-20 23:32:14] [INFO ] Too many transitions (6521) to apply POR reductions. Disabling POR matrices.
[2024-05-20 23:32:14] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1465549116258957644
Running compilation step : cd /tmp/ltsmin1465549116258957644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1465549116258957644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1465549116258957644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 141 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 23:32:17] [INFO ] Computed 42 invariants in 123 ms
[2024-05-20 23:32:18] [INFO ] Implicit Places using invariants in 1272 ms returned []
[2024-05-20 23:32:18] [INFO ] Invariant cache hit.
[2024-05-20 23:32:20] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:32:36] [INFO ] Implicit Places using invariants and state equation in 17947 ms returned []
Implicit Place search using SMT with State Equation took 19221 ms to find 0 implicit places.
[2024-05-20 23:32:37] [INFO ] Redundant transitions in 436 ms returned []
Running 6481 sub problems to find dead transitions.
[2024-05-20 23:32:37] [INFO ] Invariant cache hit.
[2024-05-20 23:32:37] [INFO ] State equation strengthened by 4757 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 timeout
0.0)
(s492 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6481 unsolved
SMT process timed out in 35112ms, After SMT, problems are : Problem set: 0 solved, 6481 unsolved
Search for dead transitions found 0 dead transitions in 35161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54972 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Built C files in :
/tmp/ltsmin10336485400150144811
[2024-05-20 23:33:12] [INFO ] Too many transitions (6521) to apply POR reductions. Disabling POR matrices.
[2024-05-20 23:33:12] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10336485400150144811
Running compilation step : cd /tmp/ltsmin10336485400150144811;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10336485400150144811;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10336485400150144811;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 23:33:15] [INFO ] Flatten gal took : 227 ms
[2024-05-20 23:33:16] [INFO ] Flatten gal took : 181 ms
[2024-05-20 23:33:16] [INFO ] Time to serialize gal into /tmp/LTL4077925929417857331.gal : 19 ms
[2024-05-20 23:33:16] [INFO ] Time to serialize properties into /tmp/LTL6810333569033921876.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4077925929417857331.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4072792190682702471.hoa' '-atoms' '/tmp/LTL6810333569033921876.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6810333569033921876.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4072792190682702471.hoa
Detected timeout of ITS tools.
[2024-05-20 23:33:31] [INFO ] Flatten gal took : 97 ms
[2024-05-20 23:33:31] [INFO ] Flatten gal took : 100 ms
[2024-05-20 23:33:31] [INFO ] Time to serialize gal into /tmp/LTL17322270433753810235.gal : 27 ms
[2024-05-20 23:33:31] [INFO ] Time to serialize properties into /tmp/LTL17518189481142670152.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17322270433753810235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17518189481142670152.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((Node36requestsent20<=Node4requestsent9)||(Node7GiveAnswer18<3))")||(G((G("(Node0requestsent4>=2)"))U("(Node5IsInserted>=1)"...162
Formula 0 simplified : G(F(F!"(Node0requestsent4>=2)" R !"(Node5IsInserted>=1)") & FG!"((Node36requestsent20<=Node4requestsent9)||(Node7GiveAnswer18<3))")
Detected timeout of ITS tools.
[2024-05-20 23:33:46] [INFO ] Flatten gal took : 102 ms
[2024-05-20 23:33:46] [INFO ] Applying decomposition
[2024-05-20 23:33:46] [INFO ] Flatten gal took : 106 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15645839051315367548.txt' '-o' '/tmp/graph15645839051315367548.bin' '-w' '/tmp/graph15645839051315367548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15645839051315367548.bin' '-l' '-1' '-v' '-w' '/tmp/graph15645839051315367548.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:33:46] [INFO ] Decomposing Gal with order
[2024-05-20 23:33:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:33:47] [INFO ] Removed a total of 4819 redundant transitions.
[2024-05-20 23:33:47] [INFO ] Flatten gal took : 422 ms
[2024-05-20 23:33:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 3119 labels/synchronizations in 234 ms.
[2024-05-20 23:33:47] [INFO ] Time to serialize gal into /tmp/LTL5229614969895005177.gal : 27 ms
[2024-05-20 23:33:47] [INFO ] Time to serialize properties into /tmp/LTL16871618830361598552.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5229614969895005177.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16871618830361598552.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((gu41.Node36requestsent20<=gu41.Node4requestsent9)||(gi0.gu19.Node7GiveAnswer18<3))")||(G((G("(gi0.gu1.Node0requestsent4>=2)...197
Formula 0 simplified : G(F(F!"(gi0.gu1.Node0requestsent4>=2)" R !"(gi0.gu6.Node5IsInserted>=1)") & FG!"((gu41.Node36requestsent20<=gu41.Node4requestsent9)|...189
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-07 finished in 568406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(F(p1)))))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 189 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:34:03] [INFO ] Computed 42 invariants in 383 ms
[2024-05-20 23:34:05] [INFO ] Implicit Places using invariants in 2470 ms returned []
[2024-05-20 23:34:05] [INFO ] Invariant cache hit.
[2024-05-20 23:34:08] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:34:39] [INFO ] Performed 315/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:34:54] [INFO ] Implicit Places using invariants and state equation in 48360 ms returned []
Implicit Place search using SMT with State Equation took 50830 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:34:54] [INFO ] Invariant cache hit.
[2024-05-20 23:34:54] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38772ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38847ms
Finished structural reductions in LTL mode , in 1 iterations and 89879 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-08
Product exploration explored 100000 steps with 105 reset in 737 ms.
Product exploration explored 100000 steps with 100 reset in 720 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (39 resets) in 443 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 76556 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 1
Probabilistic random walk after 76556 steps, saw 48728 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-20 23:35:38] [INFO ] Invariant cache hit.
[2024-05-20 23:35:38] [INFO ] State equation strengthened by 3160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3600/3601 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:35:38] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-05-20 23:35:38] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-20 23:35:38] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-20 23:35:38] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-20 23:35:39] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2024-05-20 23:35:39] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-20 23:35:39] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-20 23:35:39] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2024-05-20 23:35:39] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-20 23:35:39] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-20 23:35:39] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-20 23:35:40] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-20 23:35:40] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-20 23:35:40] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-20 23:35:40] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-20 23:35:40] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 23:35:40] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 2 ms to minimize.
[2024-05-20 23:35:40] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-20 23:35:41] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-05-20 23:35:41] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3601 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:35:41] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 23:35:41] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 23:35:41] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-20 23:35:41] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-20 23:35:41] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-20 23:35:41] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-20 23:35:42] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-20 23:35:42] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2024-05-20 23:35:42] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-20 23:35:42] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 6 ms to minimize.
[2024-05-20 23:35:42] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-20 23:35:42] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-20 23:35:42] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-20 23:35:42] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-20 23:35:43] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
SMT process timed out in 5112ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5160 place count 1844 transition count 6519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5161 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1641 times.
Drop transitions (Partial Free agglomeration) removed 1641 transitions
Iterating global reduction 3 with 1641 rules applied. Total rules applied 6802 place count 1843 transition count 6519
Applied a total of 6802 rules in 1091 ms. Remains 1843 /3683 variables (removed 1840) and now considering 6519/9840 (removed 3321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1091 ms. Remains : 1843/3683 places, 6519/9840 transitions.
RANDOM walk for 30466 steps (162 resets) in 451 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 3683 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 750 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-20 23:35:45] [INFO ] Computed 42 invariants in 122 ms
[2024-05-20 23:35:46] [INFO ] Implicit Places using invariants in 1256 ms returned []
[2024-05-20 23:35:46] [INFO ] Invariant cache hit.
[2024-05-20 23:35:47] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:36:01] [INFO ] Implicit Places using invariants and state equation in 14694 ms returned []
Implicit Place search using SMT with State Equation took 15952 ms to find 0 implicit places.
[2024-05-20 23:36:01] [INFO ] Redundant transitions in 659 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-20 23:36:02] [INFO ] Invariant cache hit.
[2024-05-20 23:36:02] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34877ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34923ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52301 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 22503 steps (110 resets) in 239 ms. (93 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 501 reset in 909 ms.
Product exploration explored 100000 steps with 494 reset in 956 ms.
Built C files in :
/tmp/ltsmin12469233176042700011
[2024-05-20 23:36:39] [INFO ] Too many transitions (6520) to apply POR reductions. Disabling POR matrices.
[2024-05-20 23:36:39] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12469233176042700011
Running compilation step : cd /tmp/ltsmin12469233176042700011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12469233176042700011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12469233176042700011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 1844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1844/1844 places, 6520/6520 transitions.
Applied a total of 0 rules in 148 ms. Remains 1844 /1844 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2024-05-20 23:36:42] [INFO ] Invariant cache hit.
[2024-05-20 23:36:43] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2024-05-20 23:36:43] [INFO ] Invariant cache hit.
[2024-05-20 23:36:45] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:36:59] [INFO ] Implicit Places using invariants and state equation in 15240 ms returned []
Implicit Place search using SMT with State Equation took 16405 ms to find 0 implicit places.
[2024-05-20 23:36:59] [INFO ] Redundant transitions in 437 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-20 23:36:59] [INFO ] Invariant cache hit.
[2024-05-20 23:36:59] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34902ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34951ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51959 ms. Remains : 1844/1844 places, 6520/6520 transitions.
Built C files in :
/tmp/ltsmin13343145704327634228
[2024-05-20 23:37:34] [INFO ] Too many transitions (6520) to apply POR reductions. Disabling POR matrices.
[2024-05-20 23:37:34] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13343145704327634228
Running compilation step : cd /tmp/ltsmin13343145704327634228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13343145704327634228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13343145704327634228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 23:37:37] [INFO ] Flatten gal took : 103 ms
[2024-05-20 23:37:37] [INFO ] Flatten gal took : 106 ms
[2024-05-20 23:37:37] [INFO ] Time to serialize gal into /tmp/LTL6827865265831114487.gal : 20 ms
[2024-05-20 23:37:37] [INFO ] Time to serialize properties into /tmp/LTL490692911167841371.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6827865265831114487.gal' '-t' 'CGAL' '-hoa' '/tmp/aut596354971239037572.hoa' '-atoms' '/tmp/LTL490692911167841371.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL490692911167841371.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut596354971239037572.hoa
Detected timeout of ITS tools.
[2024-05-20 23:37:53] [INFO ] Flatten gal took : 101 ms
[2024-05-20 23:37:53] [INFO ] Flatten gal took : 106 ms
[2024-05-20 23:37:53] [INFO ] Time to serialize gal into /tmp/LTL15687277553093024096.gal : 19 ms
[2024-05-20 23:37:53] [INFO ] Time to serialize properties into /tmp/LTL2996941374200828728.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15687277553093024096.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2996941374200828728.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(Node3requestsent23<2)")&&(G(F("(Node37GiveAnswer6<1)"))))))))
Formula 0 simplified : XX(FG!"(Node37GiveAnswer6<1)" | G!"(Node3requestsent23<2)")
Detected timeout of ITS tools.
[2024-05-20 23:38:08] [INFO ] Flatten gal took : 111 ms
[2024-05-20 23:38:08] [INFO ] Applying decomposition
[2024-05-20 23:38:08] [INFO ] Flatten gal took : 103 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4853716418789064538.txt' '-o' '/tmp/graph4853716418789064538.bin' '-w' '/tmp/graph4853716418789064538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4853716418789064538.bin' '-l' '-1' '-v' '-w' '/tmp/graph4853716418789064538.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:38:08] [INFO ] Decomposing Gal with order
[2024-05-20 23:38:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:38:09] [INFO ] Removed a total of 4802 redundant transitions.
[2024-05-20 23:38:09] [INFO ] Flatten gal took : 367 ms
[2024-05-20 23:38:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 3121 labels/synchronizations in 212 ms.
[2024-05-20 23:38:09] [INFO ] Time to serialize gal into /tmp/LTL12284925540261186406.gal : 39 ms
[2024-05-20 23:38:09] [INFO ] Time to serialize properties into /tmp/LTL4553341336130829925.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12284925540261186406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4553341336130829925.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(u4.Node3requestsent23<2)")&&(G(F("(u7.Node37GiveAnswer6<1)"))))))))
Formula 0 simplified : XX(FG!"(u7.Node37GiveAnswer6<1)" | G!"(u4.Node3requestsent23<2)")
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-08 finished in 261503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 3404 transition count 9560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1481 Post agglomeration using F-continuation condition.Transition count delta: 1481
Deduced a syphon composed of 1481 places in 2 ms
Reduce places removed 1481 places and 0 transitions.
Iterating global reduction 3 with 2962 rules applied. Total rules applied 3522 place count 1922 transition count 8079
Drop transitions (Redundant composition of simpler transitions.) removed 1405 transitions
Redundant transition composition rules discarded 1405 transitions
Iterating global reduction 3 with 1405 rules applied. Total rules applied 4927 place count 1922 transition count 6674
Partial Post-agglomeration rule applied 154 times.
Drop transitions (Partial Post agglomeration) removed 154 transitions
Iterating global reduction 3 with 154 rules applied. Total rules applied 5081 place count 1922 transition count 6674
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 5157 place count 1846 transition count 6598
Iterating global reduction 3 with 76 rules applied. Total rules applied 5233 place count 1846 transition count 6598
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 5271 place count 1846 transition count 6560
Applied a total of 5271 rules in 1184 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6560/9840 (removed 3280) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2024-05-20 23:38:25] [INFO ] Computed 42 invariants in 124 ms
[2024-05-20 23:38:27] [INFO ] Implicit Places using invariants in 1274 ms returned []
[2024-05-20 23:38:27] [INFO ] Invariant cache hit.
[2024-05-20 23:38:28] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-20 23:38:43] [INFO ] Implicit Places using invariants and state equation in 16268 ms returned []
Implicit Place search using SMT with State Equation took 17544 ms to find 0 implicit places.
[2024-05-20 23:38:43] [INFO ] Redundant transitions in 683 ms returned []
Running 6520 sub problems to find dead transitions.
[2024-05-20 23:38:44] [INFO ] Invariant cache hit.
[2024-05-20 23:38:44] [INFO ] State equation strengthened by 4793 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6520 unsolved
SMT process timed out in 34913ms, After SMT, problems are : Problem set: 0 solved, 6520 unsolved
Search for dead transitions found 0 dead transitions in 34960ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1846/3683 places, 6560/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54398 ms. Remains : 1846/3683 places, 6560/9840 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-10
Product exploration explored 100000 steps with 482 reset in 915 ms.
Product exploration explored 100000 steps with 488 reset in 951 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (193 resets) in 596 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 112964 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 1
Probabilistic random walk after 112964 steps, saw 30988 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-20 23:39:24] [INFO ] Invariant cache hit.
[2024-05-20 23:39:24] [INFO ] State equation strengthened by 4793 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1761/1764 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:39:24] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1764 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1764 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1842 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:39:26] [INFO ] Deduced a trap composed of 77 places in 1470 ms of which 11 ms to minimize.
[2024-05-20 23:39:27] [INFO ] Deduced a trap composed of 52 places in 1466 ms of which 12 ms to minimize.
[2024-05-20 23:39:29] [INFO ] Deduced a trap composed of 66 places in 1420 ms of which 11 ms to minimize.
[2024-05-20 23:39:30] [INFO ] Deduced a trap composed of 57 places in 1327 ms of which 10 ms to minimize.
SMT process timed out in 6332ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 6559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 6559
Partial Free-agglomeration rule applied 1601 times.
Drop transitions (Partial Free agglomeration) removed 1601 transitions
Iterating global reduction 1 with 1601 rules applied. Total rules applied 1603 place count 1845 transition count 6559
Applied a total of 1603 rules in 498 ms. Remains 1845 /1846 variables (removed 1) and now considering 6559/6560 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 1845/1846 places, 6559/6560 transitions.
RANDOM walk for 40000 steps (213 resets) in 542 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 107670 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 107670 steps, saw 28466 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 6559 rows 1845 cols
[2024-05-20 23:39:34] [INFO ] Computed 42 invariants in 170 ms
[2024-05-20 23:39:34] [INFO ] State equation strengthened by 6393 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:39:34] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-20 23:39:34] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:39:36] [INFO ] Deduced a trap composed of 68 places in 1439 ms of which 11 ms to minimize.
[2024-05-20 23:39:38] [INFO ] Deduced a trap composed of 48 places in 1471 ms of which 11 ms to minimize.
[2024-05-20 23:39:38] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6559/8402 variables, 1843/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8402 variables, 6393/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8402 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8404 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8404 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8404 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8404/8404 variables, and 8285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6350 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:39:41] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-20 23:39:41] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:39:41] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:39:41] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:39:41] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-20 23:39:41] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:39:41] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-20 23:39:41] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:39:41] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:39:41] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-20 23:39:41] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 0 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:39:42] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:39:43] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:39:43] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:39:43] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:39:43] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-20 23:39:43] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:39:43] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:39:43] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:39:43] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:39:43] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:39:43] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:39:43] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1763 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1763 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1841 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1843 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1843 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6559/8402 variables, 1843/1927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8402 variables, 6393/8320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8402 variables, 1/8321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8402 variables, 0/8321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/8404 variables, 2/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8404 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/8404 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8404/8404 variables, and 8323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12619 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 42/42 constraints]
After SMT, in 19204ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 171 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 169 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
[2024-05-20 23:39:53] [INFO ] Invariant cache hit.
[2024-05-20 23:39:55] [INFO ] Implicit Places using invariants in 1868 ms returned []
[2024-05-20 23:39:55] [INFO ] Invariant cache hit.
[2024-05-20 23:39:57] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 23:40:27] [INFO ] Performed 745/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:40:57] [INFO ] Performed 1699/1845 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:41:01] [INFO ] Implicit Places using invariants and state equation in 65295 ms returned []
Implicit Place search using SMT with State Equation took 67164 ms to find 0 implicit places.
[2024-05-20 23:41:01] [INFO ] Redundant transitions in 455 ms returned []
Running 6519 sub problems to find dead transitions.
[2024-05-20 23:41:01] [INFO ] Invariant cache hit.
[2024-05-20 23:41:01] [INFO ] State equation strengthened by 6393 read => feed constraints.
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/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6519 unsolved
SMT process timed out in 36081ms, After SMT, problems are : Problem set: 0 solved, 6519 unsolved
Search for dead transitions found 0 dead transitions in 36132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103938 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Applied a total of 0 rules in 159 ms. Remains 1846 /1846 variables (removed 0) and now considering 6560/6560 (removed 0) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2024-05-20 23:41:38] [INFO ] Computed 42 invariants in 122 ms
[2024-05-20 23:41:39] [INFO ] Implicit Places using invariants in 1281 ms returned []
[2024-05-20 23:41:39] [INFO ] Invariant cache hit.
[2024-05-20 23:41:40] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-20 23:41:55] [INFO ] Implicit Places using invariants and state equation in 16169 ms returned []
Implicit Place search using SMT with State Equation took 17452 ms to find 0 implicit places.
[2024-05-20 23:41:56] [INFO ] Redundant transitions in 451 ms returned []
Running 6520 sub problems to find dead transitions.
[2024-05-20 23:41:56] [INFO ] Invariant cache hit.
[2024-05-20 23:41:56] [INFO ] State equation strengthened by 4793 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6520 unsolved
SMT process timed out in 34996ms, After SMT, problems are : Problem set: 0 solved, 6520 unsolved
Search for dead transitions found 0 dead transitions in 35045ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53124 ms. Remains : 1846/1846 places, 6560/6560 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (193 resets) in 501 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 113307 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 1
Probabilistic random walk after 113307 steps, saw 31055 distinct states, run finished after 3003 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-20 23:42:34] [INFO ] Invariant cache hit.
[2024-05-20 23:42:34] [INFO ] State equation strengthened by 4793 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1761/1764 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:42:34] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1764 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1764 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1842 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1842 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1844 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:42:36] [INFO ] Deduced a trap composed of 77 places in 1542 ms of which 12 ms to minimize.
[2024-05-20 23:42:38] [INFO ] Deduced a trap composed of 52 places in 1538 ms of which 11 ms to minimize.
[2024-05-20 23:42:39] [INFO ] Deduced a trap composed of 66 places in 1464 ms of which 12 ms to minimize.
SMT process timed out in 5137ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 6559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 6559
Partial Free-agglomeration rule applied 1601 times.
Drop transitions (Partial Free agglomeration) removed 1601 transitions
Iterating global reduction 1 with 1601 rules applied. Total rules applied 1603 place count 1845 transition count 6559
Applied a total of 1603 rules in 485 ms. Remains 1845 /1846 variables (removed 1) and now considering 6559/6560 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 486 ms. Remains : 1845/1846 places, 6559/6560 transitions.
RANDOM walk for 40000 steps (210 resets) in 481 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 106323 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 1
Probabilistic random walk after 106323 steps, saw 28301 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 6559 rows 1845 cols
[2024-05-20 23:42:43] [INFO ] Computed 42 invariants in 147 ms
[2024-05-20 23:42:43] [INFO ] State equation strengthened by 6393 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:42:43] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-20 23:42:43] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:42:45] [INFO ] Deduced a trap composed of 68 places in 1460 ms of which 12 ms to minimize.
[2024-05-20 23:42:46] [INFO ] Deduced a trap composed of 48 places in 1396 ms of which 11 ms to minimize.
[2024-05-20 23:42:47] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1843 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1843 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6559/8402 variables, 1843/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8402 variables, 6393/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8402 variables, 0/8283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8404 variables, 2/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8404 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8404 variables, 0/8285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8404/8404 variables, and 8285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6258 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1760/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:42:50] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:42:51] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-20 23:42:52] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:42:52] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:42:52] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-20 23:42:52] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:42:52] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:42:52] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:42:52] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1763 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1763 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1841 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1841 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1843 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1843 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1843 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6559/8402 variables, 1843/1927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8402 variables, 6393/8320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8402 variables, 1/8321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/8402 variables, 0/8321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/8404 variables, 2/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/8404 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/8404 variables, 0/8323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8404/8404 variables, and 8323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12050 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1845/1845 constraints, ReadFeed: 6393/6393 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 42/42 constraints]
After SMT, in 18528ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 180 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 173 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
[2024-05-20 23:43:02] [INFO ] Invariant cache hit.
[2024-05-20 23:43:04] [INFO ] Implicit Places using invariants in 1831 ms returned []
[2024-05-20 23:43:04] [INFO ] Invariant cache hit.
[2024-05-20 23:43:05] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 23:43:35] [INFO ] Performed 828/1845 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:44:02] [INFO ] Implicit Places using invariants and state equation in 58603 ms returned []
Implicit Place search using SMT with State Equation took 60438 ms to find 0 implicit places.
[2024-05-20 23:44:03] [INFO ] Redundant transitions in 488 ms returned []
Running 6519 sub problems to find dead transitions.
[2024-05-20 23:44:03] [INFO ] Invariant cache hit.
[2024-05-20 23:44:03] [INFO ] State equation strengthened by 6393 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6519 unsolved
SMT process timed out in 36155ms, After SMT, problems are : Problem set: 0 solved, 6519 unsolved
Search for dead transitions found 0 dead transitions in 36205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97323 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 486 reset in 1031 ms.
Product exploration explored 100000 steps with 484 reset in 940 ms.
Built C files in :
/tmp/ltsmin4442268169926551360
[2024-05-20 23:44:41] [INFO ] Too many transitions (6560) to apply POR reductions. Disabling POR matrices.
[2024-05-20 23:44:41] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4442268169926551360
Running compilation step : cd /tmp/ltsmin4442268169926551360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4442268169926551360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4442268169926551360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Applied a total of 0 rules in 157 ms. Remains 1846 /1846 variables (removed 0) and now considering 6560/6560 (removed 0) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2024-05-20 23:44:44] [INFO ] Computed 42 invariants in 124 ms
[2024-05-20 23:44:46] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2024-05-20 23:44:46] [INFO ] Invariant cache hit.
[2024-05-20 23:44:47] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-20 23:45:01] [INFO ] Implicit Places using invariants and state equation in 15687 ms returned []
Implicit Place search using SMT with State Equation took 16942 ms to find 0 implicit places.
[2024-05-20 23:45:02] [INFO ] Redundant transitions in 450 ms returned []
Running 6520 sub problems to find dead transitions.
[2024-05-20 23:45:02] [INFO ] Invariant cache hit.
[2024-05-20 23:45:02] [INFO ] State equation strengthened by 4793 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1845 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6520 unsolved
SMT process timed out in 35153ms, After SMT, problems are : Problem set: 0 solved, 6520 unsolved
Search for dead transitions found 0 dead transitions in 35202ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52767 ms. Remains : 1846/1846 places, 6560/6560 transitions.
Built C files in :
/tmp/ltsmin12781819032949388745
[2024-05-20 23:45:37] [INFO ] Too many transitions (6560) to apply POR reductions. Disabling POR matrices.
[2024-05-20 23:45:37] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12781819032949388745
Running compilation step : cd /tmp/ltsmin12781819032949388745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12781819032949388745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12781819032949388745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-20 23:45:40] [INFO ] Flatten gal took : 101 ms
[2024-05-20 23:45:40] [INFO ] Flatten gal took : 107 ms
[2024-05-20 23:45:40] [INFO ] Time to serialize gal into /tmp/LTL11623279453442718200.gal : 30 ms
[2024-05-20 23:45:40] [INFO ] Time to serialize properties into /tmp/LTL6109887494785866222.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11623279453442718200.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4806375074401720134.hoa' '-atoms' '/tmp/LTL6109887494785866222.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6109887494785866222.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4806375074401720134.hoa
Detected timeout of ITS tools.
[2024-05-20 23:45:56] [INFO ] Flatten gal took : 98 ms
[2024-05-20 23:45:56] [INFO ] Flatten gal took : 99 ms
[2024-05-20 23:45:56] [INFO ] Time to serialize gal into /tmp/LTL14368282311879557266.gal : 19 ms
[2024-05-20 23:45:56] [INFO ] Time to serialize properties into /tmp/LTL2034448142834718834.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14368282311879557266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2034448142834718834.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node17GiveAnswer2>Node37NOshare)||(Node39GiveAnswer0<2))"))))
Formula 0 simplified : FG!"((Node17GiveAnswer2>Node37NOshare)||(Node39GiveAnswer0<2))"
Detected timeout of ITS tools.
[2024-05-20 23:46:11] [INFO ] Flatten gal took : 98 ms
[2024-05-20 23:46:11] [INFO ] Applying decomposition
[2024-05-20 23:46:11] [INFO ] Flatten gal took : 100 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1832080233564016458.txt' '-o' '/tmp/graph1832080233564016458.bin' '-w' '/tmp/graph1832080233564016458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1832080233564016458.bin' '-l' '-1' '-v' '-w' '/tmp/graph1832080233564016458.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:46:11] [INFO ] Decomposing Gal with order
[2024-05-20 23:46:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:46:12] [INFO ] Removed a total of 4937 redundant transitions.
[2024-05-20 23:46:12] [INFO ] Flatten gal took : 371 ms
[2024-05-20 23:46:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 3202 labels/synchronizations in 206 ms.
[2024-05-20 23:46:12] [INFO ] Time to serialize gal into /tmp/LTL8434438896886168973.gal : 26 ms
[2024-05-20 23:46:12] [INFO ] Time to serialize properties into /tmp/LTL5458204218020894170.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8434438896886168973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5458204218020894170.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((gu41.Node17GiveAnswer2>gu41.Node37NOshare)||(gi0.gu1.Node39GiveAnswer0<2))"))))
Formula 0 simplified : FG!"((gu41.Node17GiveAnswer2>gu41.Node37NOshare)||(gi0.gu1.Node39GiveAnswer0<2))"
Detected timeout of ITS tools.
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-10 finished in 483171 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 214 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:46:28] [INFO ] Computed 42 invariants in 412 ms
[2024-05-20 23:46:30] [INFO ] Implicit Places using invariants in 2446 ms returned []
[2024-05-20 23:46:30] [INFO ] Invariant cache hit.
[2024-05-20 23:46:33] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:47:04] [INFO ] Performed 329/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:47:18] [INFO ] Implicit Places using invariants and state equation in 47637 ms returned []
Implicit Place search using SMT with State Equation took 50085 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:47:18] [INFO ] Invariant cache hit.
[2024-05-20 23:47:18] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 39450ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39523ms
Finished structural reductions in LTL mode , in 1 iterations and 89833 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-11 finished in 90044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 255 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 23:47:58] [INFO ] Invariant cache hit.
[2024-05-20 23:48:00] [INFO ] Implicit Places using invariants in 2059 ms returned []
[2024-05-20 23:48:00] [INFO ] Invariant cache hit.
[2024-05-20 23:48:02] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:48:33] [INFO ] Performed 357/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:48:43] [INFO ] Implicit Places using invariants and state equation in 43423 ms returned []
Implicit Place search using SMT with State Equation took 45484 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:48:43] [INFO ] Invariant cache hit.
[2024-05-20 23:48:43] [INFO ] State equation strengthened by 3160 read => feed constraints.
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/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38996ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 39069ms
Finished structural reductions in LTL mode , in 1 iterations and 84819 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-12
Stuttering criterion allowed to conclude after 922 steps with 0 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-12 finished in 84936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions (Redundant composition of simpler transitions.) removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 840 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-20 23:49:23] [INFO ] Computed 42 invariants in 118 ms
[2024-05-20 23:49:24] [INFO ] Implicit Places using invariants in 1244 ms returned []
[2024-05-20 23:49:24] [INFO ] Invariant cache hit.
[2024-05-20 23:49:26] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 23:49:40] [INFO ] Implicit Places using invariants and state equation in 15788 ms returned []
Implicit Place search using SMT with State Equation took 17032 ms to find 0 implicit places.
[2024-05-20 23:49:41] [INFO ] Redundant transitions in 677 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-20 23:49:41] [INFO ] Invariant cache hit.
[2024-05-20 23:49:41] [INFO ] State equation strengthened by 4757 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1843 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34927ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34973ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53568 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-13
Product exploration explored 100000 steps with 495 reset in 945 ms.
Stack based approach found an accepted trace after 45315 steps with 220 reset with depth 118 and stack size 118 in 431 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-13 finished in 55011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 214 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 23:50:18] [INFO ] Computed 42 invariants in 377 ms
[2024-05-20 23:50:20] [INFO ] Implicit Places using invariants in 2430 ms returned []
[2024-05-20 23:50:20] [INFO ] Invariant cache hit.
[2024-05-20 23:50:23] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 23:50:53] [INFO ] Performed 329/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:51:08] [INFO ] Implicit Places using invariants and state equation in 47855 ms returned []
Implicit Place search using SMT with State Equation took 50288 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-20 23:51:08] [INFO ] Invariant cache hit.
[2024-05-20 23:51:08] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 38879ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 38952ms
Finished structural reductions in LTL mode , in 1 iterations and 89464 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-14 finished in 89636 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)) U G(p1)))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 2 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 3 with 3120 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions (Redundant composition of simpler transitions.) removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 3 with 1482 rules applied. Total rules applied 5158 place count 1845 transition count 6520
Applied a total of 5158 rules in 826 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2024-05-20 23:51:48] [INFO ] Computed 42 invariants in 133 ms
[2024-05-20 23:51:49] [INFO ] Implicit Places using invariants in 1269 ms returned []
[2024-05-20 23:51:49] [INFO ] Invariant cache hit.
[2024-05-20 23:51:50] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-20 23:52:05] [INFO ] Implicit Places using invariants and state equation in 16312 ms returned []
Implicit Place search using SMT with State Equation took 17581 ms to find 0 implicit places.
[2024-05-20 23:52:06] [INFO ] Redundant transitions in 680 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-20 23:52:06] [INFO ] Invariant cache hit.
[2024-05-20 23:52:06] [INFO ] State equation strengthened by 4758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 34887ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 34936ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54042 ms. Remains : 1845/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-15
Product exploration explored 100000 steps with 495 reset in 947 ms.
Product exploration explored 100000 steps with 500 reset in 981 ms.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (196 resets) in 564 ms. (70 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
[2024-05-20 23:52:43] [INFO ] Invariant cache hit.
[2024-05-20 23:52:43] [INFO ] State equation strengthened by 4758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1761/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:52:44] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-20 23:52:44] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:52:45] [INFO ] Deduced a trap composed of 54 places in 1442 ms of which 11 ms to minimize.
[2024-05-20 23:52:47] [INFO ] Deduced a trap composed of 59 places in 1380 ms of which 11 ms to minimize.
[2024-05-20 23:52:48] [INFO ] Deduced a trap composed of 46 places in 1365 ms of which 11 ms to minimize.
[2024-05-20 23:52:49] [INFO ] Deduced a trap composed of 48 places in 1255 ms of which 10 ms to minimize.
SMT process timed out in 6112ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1639 times.
Drop transitions (Partial Free agglomeration) removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 1645 place count 1842 transition count 6517
Applied a total of 1645 rules in 515 ms. Remains 1842 /1845 variables (removed 3) and now considering 6517/6520 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 1842/1845 places, 6517/6520 transitions.
RANDOM walk for 40000 steps (215 resets) in 554 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 114693 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 114693 steps, saw 32378 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 6517 rows 1842 cols
[2024-05-20 23:52:53] [INFO ] Computed 42 invariants in 160 ms
[2024-05-20 23:52:53] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:52:54] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1838 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1838 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1840 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:52:55] [INFO ] Deduced a trap composed of 51 places in 1373 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1840 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6517/8357 variables, 1840/1884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8357 variables, 6396/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8357 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8359 variables, 2/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8359 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8359 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8359/8359 variables, and 8282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4154 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1842/1842 constraints, ReadFeed: 6396/6396 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:52:58] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:52:58] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:52:58] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:52:58] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-20 23:52:58] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:52:58] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:52:58] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-20 23:52:58] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:52:58] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:52:58] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 2 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:52:59] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:53:00] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:53:00] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-20 23:53:00] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
[2024-05-20 23:53:00] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 0 ms to minimize.
[2024-05-20 23:53:00] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:53:00] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-20 23:53:00] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:53:00] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:53:00] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:53:00] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-20 23:53:00] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-20 23:53:00] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1760 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1760 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1838 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1840 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1840 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:53:02] [INFO ] Deduced a trap composed of 47 places in 1407 ms of which 11 ms to minimize.
[2024-05-20 23:53:03] [INFO ] Deduced a trap composed of 52 places in 1412 ms of which 11 ms to minimize.
[2024-05-20 23:53:05] [INFO ] Deduced a trap composed of 62 places in 1413 ms of which 11 ms to minimize.
[2024-05-20 23:53:06] [INFO ] Deduced a trap composed of 83 places in 1411 ms of which 10 ms to minimize.
[2024-05-20 23:53:08] [INFO ] Deduced a trap composed of 63 places in 1464 ms of which 11 ms to minimize.
[2024-05-20 23:53:09] [INFO ] Deduced a trap composed of 51 places in 1419 ms of which 11 ms to minimize.
[2024-05-20 23:53:11] [INFO ] Deduced a trap composed of 58 places in 1418 ms of which 11 ms to minimize.
[2024-05-20 23:53:12] [INFO ] Deduced a trap composed of 47 places in 1431 ms of which 12 ms to minimize.
[2024-05-20 23:53:13] [INFO ] Deduced a trap composed of 49 places in 1398 ms of which 10 ms to minimize.
[2024-05-20 23:53:15] [INFO ] Deduced a trap composed of 61 places in 1432 ms of which 11 ms to minimize.
[2024-05-20 23:53:16] [INFO ] Deduced a trap composed of 64 places in 1309 ms of which 10 ms to minimize.
[2024-05-20 23:53:18] [INFO ] Deduced a trap composed of 48 places in 1488 ms of which 11 ms to minimize.
[2024-05-20 23:53:19] [INFO ] Deduced a trap composed of 59 places in 1292 ms of which 11 ms to minimize.
[2024-05-20 23:53:21] [INFO ] Deduced a trap composed of 56 places in 1463 ms of which 11 ms to minimize.
[2024-05-20 23:53:22] [INFO ] Deduced a trap composed of 52 places in 1499 ms of which 11 ms to minimize.
[2024-05-20 23:53:24] [INFO ] Deduced a trap composed of 81 places in 1499 ms of which 12 ms to minimize.
[2024-05-20 23:53:25] [INFO ] Deduced a trap composed of 93 places in 1501 ms of which 11 ms to minimize.
[2024-05-20 23:53:27] [INFO ] Deduced a trap composed of 62 places in 1529 ms of which 11 ms to minimize.
[2024-05-20 23:53:28] [INFO ] Deduced a trap composed of 48 places in 1457 ms of which 11 ms to minimize.
[2024-05-20 23:53:30] [INFO ] Deduced a trap composed of 57 places in 1406 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1840 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:53:31] [INFO ] Deduced a trap composed of 59 places in 1397 ms of which 11 ms to minimize.
[2024-05-20 23:53:33] [INFO ] Deduced a trap composed of 67 places in 1502 ms of which 11 ms to minimize.
[2024-05-20 23:53:34] [INFO ] Deduced a trap composed of 49 places in 1462 ms of which 11 ms to minimize.
[2024-05-20 23:53:36] [INFO ] Deduced a trap composed of 64 places in 1557 ms of which 11 ms to minimize.
[2024-05-20 23:53:37] [INFO ] Deduced a trap composed of 49 places in 1530 ms of which 11 ms to minimize.
[2024-05-20 23:53:39] [INFO ] Deduced a trap composed of 64 places in 1479 ms of which 11 ms to minimize.
[2024-05-20 23:53:40] [INFO ] Deduced a trap composed of 45 places in 1455 ms of which 11 ms to minimize.
[2024-05-20 23:53:42] [INFO ] Deduced a trap composed of 51 places in 1379 ms of which 10 ms to minimize.
[2024-05-20 23:53:43] [INFO ] Deduced a trap composed of 53 places in 1507 ms of which 12 ms to minimize.
SMT process timed out in 50048ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 179 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 179 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2024-05-20 23:53:44] [INFO ] Invariant cache hit.
[2024-05-20 23:53:45] [INFO ] Implicit Places using invariants in 1891 ms returned []
[2024-05-20 23:53:45] [INFO ] Invariant cache hit.
[2024-05-20 23:53:47] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-20 23:54:17] [INFO ] Performed 666/1842 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:54:47] [INFO ] Performed 1595/1842 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:54:54] [INFO ] Implicit Places using invariants and state equation in 68651 ms returned []
Implicit Place search using SMT with State Equation took 70544 ms to find 0 implicit places.
[2024-05-20 23:54:55] [INFO ] Redundant transitions in 489 ms returned []
Running 6477 sub problems to find dead transitions.
[2024-05-20 23:54:55] [INFO ] Invariant cache hit.
[2024-05-20 23:54:55] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1841 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6477 unsolved
SMT process timed out in 36074ms, After SMT, problems are : Problem set: 0 solved, 6477 unsolved
Search for dead transitions found 0 dead transitions in 36123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107351 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p0)]
Support contains 4 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 157 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2024-05-20 23:55:31] [INFO ] Computed 42 invariants in 126 ms
[2024-05-20 23:55:32] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2024-05-20 23:55:32] [INFO ] Invariant cache hit.
[2024-05-20 23:55:34] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-20 23:55:48] [INFO ] Implicit Places using invariants and state equation in 15357 ms returned []
Implicit Place search using SMT with State Equation took 16621 ms to find 0 implicit places.
[2024-05-20 23:55:48] [INFO ] Redundant transitions in 433 ms returned []
Running 6480 sub problems to find dead transitions.
[2024-05-20 23:55:48] [INFO ] Invariant cache hit.
[2024-05-20 23:55:48] [INFO ] State equation strengthened by 4758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1844 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6480 unsolved
SMT process timed out in 35593ms, After SMT, problems are : Problem set: 0 solved, 6480 unsolved
Search for dead transitions found 0 dead transitions in 35644ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52882 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (196 resets) in 709 ms. (56 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2024-05-20 23:56:24] [INFO ] Invariant cache hit.
[2024-05-20 23:56:24] [INFO ] State equation strengthened by 4758 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1761/1763 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:56:25] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-20 23:56:25] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1763 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1763 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1841 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1841 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1843 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:56:26] [INFO ] Deduced a trap composed of 54 places in 1454 ms of which 12 ms to minimize.
[2024-05-20 23:56:28] [INFO ] Deduced a trap composed of 59 places in 1380 ms of which 11 ms to minimize.
[2024-05-20 23:56:29] [INFO ] Deduced a trap composed of 46 places in 1371 ms of which 11 ms to minimize.
[2024-05-20 23:56:31] [INFO ] Deduced a trap composed of 48 places in 1856 ms of which 10 ms to minimize.
SMT process timed out in 6738ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1639 times.
Drop transitions (Partial Free agglomeration) removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 1645 place count 1842 transition count 6517
Applied a total of 1645 rules in 507 ms. Remains 1842 /1845 variables (removed 3) and now considering 6517/6520 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 1842/1845 places, 6517/6520 transitions.
RANDOM walk for 40000 steps (212 resets) in 558 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 114708 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 114708 steps, saw 32385 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 6517 rows 1842 cols
[2024-05-20 23:56:35] [INFO ] Computed 42 invariants in 156 ms
[2024-05-20 23:56:35] [INFO ] State equation strengthened by 6396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:56:35] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/1838 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1838 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/1840 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:56:37] [INFO ] Deduced a trap composed of 51 places in 1403 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1840 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6517/8357 variables, 1840/1884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8357 variables, 6396/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8357 variables, 0/8280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/8359 variables, 2/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8359 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/8359 variables, 0/8282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8359/8359 variables, and 8282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4311 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1842/1842 constraints, ReadFeed: 6396/6396 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1758/1760 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:56:40] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1760 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 0 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 0 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:56:41] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 0 ms to minimize.
[2024-05-20 23:56:42] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-20 23:56:42] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2024-05-20 23:56:42] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 23:56:42] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:56:42] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:56:42] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 0 ms to minimize.
[2024-05-20 23:56:42] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:56:42] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 23:56:42] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1760 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1760 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 78/1838 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1838 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/1840 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1840 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:56:44] [INFO ] Deduced a trap composed of 47 places in 1437 ms of which 11 ms to minimize.
[2024-05-20 23:56:45] [INFO ] Deduced a trap composed of 52 places in 1509 ms of which 11 ms to minimize.
[2024-05-20 23:56:47] [INFO ] Deduced a trap composed of 62 places in 1455 ms of which 11 ms to minimize.
[2024-05-20 23:56:48] [INFO ] Deduced a trap composed of 83 places in 1468 ms of which 11 ms to minimize.
[2024-05-20 23:56:50] [INFO ] Deduced a trap composed of 63 places in 1494 ms of which 11 ms to minimize.
[2024-05-20 23:56:51] [INFO ] Deduced a trap composed of 51 places in 1509 ms of which 11 ms to minimize.
[2024-05-20 23:56:53] [INFO ] Deduced a trap composed of 58 places in 1466 ms of which 11 ms to minimize.
[2024-05-20 23:56:54] [INFO ] Deduced a trap composed of 47 places in 1422 ms of which 12 ms to minimize.
[2024-05-20 23:56:56] [INFO ] Deduced a trap composed of 49 places in 1448 ms of which 11 ms to minimize.
[2024-05-20 23:56:57] [INFO ] Deduced a trap composed of 61 places in 1438 ms of which 11 ms to minimize.
[2024-05-20 23:56:59] [INFO ] Deduced a trap composed of 64 places in 1449 ms of which 12 ms to minimize.
[2024-05-20 23:57:00] [INFO ] Deduced a trap composed of 48 places in 1464 ms of which 11 ms to minimize.
[2024-05-20 23:57:02] [INFO ] Deduced a trap composed of 59 places in 1431 ms of which 11 ms to minimize.
[2024-05-20 23:57:03] [INFO ] Deduced a trap composed of 56 places in 1426 ms of which 11 ms to minimize.
[2024-05-20 23:57:05] [INFO ] Deduced a trap composed of 52 places in 1463 ms of which 11 ms to minimize.
[2024-05-20 23:57:06] [INFO ] Deduced a trap composed of 81 places in 1498 ms of which 11 ms to minimize.
[2024-05-20 23:57:08] [INFO ] Deduced a trap composed of 93 places in 1474 ms of which 12 ms to minimize.
[2024-05-20 23:57:09] [INFO ] Deduced a trap composed of 62 places in 1455 ms of which 12 ms to minimize.
[2024-05-20 23:57:10] [INFO ] Deduced a trap composed of 48 places in 1398 ms of which 10 ms to minimize.
[2024-05-20 23:57:12] [INFO ] Deduced a trap composed of 57 places in 1406 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1840 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 23:57:13] [INFO ] Deduced a trap composed of 59 places in 1413 ms of which 11 ms to minimize.
[2024-05-20 23:57:15] [INFO ] Deduced a trap composed of 67 places in 1442 ms of which 11 ms to minimize.
[2024-05-20 23:57:16] [INFO ] Deduced a trap composed of 49 places in 1437 ms of which 11 ms to minimize.
[2024-05-20 23:57:18] [INFO ] Deduced a trap composed of 64 places in 1458 ms of which 11 ms to minimize.
[2024-05-20 23:57:19] [INFO ] Deduced a trap composed of 49 places in 1458 ms of which 12 ms to minimize.
[2024-05-20 23:57:21] [INFO ] Deduced a trap composed of 64 places in 1460 ms of which 11 ms to minimize.
[2024-05-20 23:57:22] [INFO ] Deduced a trap composed of 45 places in 1410 ms of which 10 ms to minimize.
[2024-05-20 23:57:24] [INFO ] Deduced a trap composed of 51 places in 1442 ms of which 12 ms to minimize.
[2024-05-20 23:57:25] [INFO ] Deduced a trap composed of 53 places in 1450 ms of which 11 ms to minimize.
SMT process timed out in 50323ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 177 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 178 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2024-05-20 23:57:26] [INFO ] Invariant cache hit.
[2024-05-20 23:57:27] [INFO ] Implicit Places using invariants in 1880 ms returned []
[2024-05-20 23:57:27] [INFO ] Invariant cache hit.
[2024-05-20 23:57:29] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-20 23:57:59] [INFO ] Performed 673/1842 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-20 23:58:29] [INFO ] Performed 1591/1842 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-20 23:58:36] [INFO ] Implicit Places using invariants and state equation in 69006 ms returned []
Implicit Place search using SMT with State Equation took 70886 ms to find 0 implicit places.
[2024-05-20 23:58:37] [INFO ] Redundant transitions in 485 ms returned []
Running 6477 sub problems to find dead transitions.
[2024-05-20 23:58:37] [INFO ] Invariant cache hit.
[2024-05-20 23:58:37] [INFO ] State equation strengthened by 6396 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-040, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505200123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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