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.r356-tall-171683760900340.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 ShieldIIPt-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760900340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 13 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 00:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 00:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 539K May 18 16:43 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 ShieldIIPt-PT-100A-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-100A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716947934104

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 01:58:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 01:58:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 01:58:55] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-05-29 01:58:55] [INFO ] Transformed 1903 places.
[2024-05-29 01:58:55] [INFO ] Transformed 1403 transitions.
[2024-05-29 01:58:55] [INFO ] Found NUPN structural information;
[2024-05-29 01:58:55] [INFO ] Parsed PT model containing 1903 places and 1403 transitions and 6006 arcs in 320 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-100A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 211 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 01:58:56] [INFO ] Computed 901 invariants in 26 ms
[2024-05-29 01:58:57] [INFO ] Implicit Places using invariants in 1424 ms returned []
[2024-05-29 01:58:57] [INFO ] Invariant cache hit.
[2024-05-29 01:58:59] [INFO ] Implicit Places using invariants and state equation in 2028 ms returned []
Implicit Place search using SMT with State Equation took 3482 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 01:58:59] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30081 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30036 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 61003ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 61033ms
Finished structural reductions in LTL mode , in 1 iterations and 64757 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Support contains 69 out of 1903 places after structural reductions.
[2024-05-29 02:00:00] [INFO ] Flatten gal took : 263 ms
[2024-05-29 02:00:01] [INFO ] Flatten gal took : 138 ms
[2024-05-29 02:00:01] [INFO ] Input system was already deterministic with 1402 transitions.
Support contains 65 out of 1903 places (down from 69) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 35 to 33
RANDOM walk for 40000 steps (8 resets) in 2544 ms. (15 steps per ms) remains 24/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 93 ms. (42 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 124 ms. (32 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
[2024-05-29 02:00:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 59/106 variables, 49/96 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 59/155 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 1797/1903 variables, 852/1007 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1797/2804 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 24 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3305/3305 variables, and 4707 constraints, problems are : Problem set: 0 solved, 24 unsolved in 4650 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 59/106 variables, 49/96 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 59/155 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 1797/1903 variables, 852/1007 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1797/2804 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 24/4731 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3305 variables, 0/4731 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3305/3305 variables, and 4731 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5016 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 9700ms problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 191 times.
Drop transitions (Partial Free agglomeration) removed 191 transitions
Iterating global reduction 0 with 191 rules applied. Total rules applied 195 place count 1901 transition count 1400
Applied a total of 195 rules in 350 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 1901/1903 places, 1400/1402 transitions.
RANDOM walk for 40000 steps (8 resets) in 1788 ms. (22 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 80095 steps, run timeout after 3008 ms. (steps per millisecond=26 ) properties seen :15 out of 22
Probabilistic random walk after 80095 steps, saw 78709 distinct states, run finished after 3011 ms. (steps per millisecond=26 ) properties seen :15
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 02:00:16] [INFO ] Computed 901 invariants in 10 ms
[2024-05-29 02:00:16] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 19/32 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1869/1901 variables, 887/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1869/2802 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2802 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1400/3301 variables, 1901/4703 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/3301 variables, 97/4800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3301 variables, 0/4800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/3301 variables, 0/4800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3301/3301 variables, and 4800 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1956 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1901/1901 constraints, ReadFeed: 97/97 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/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 19/32 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1869/1901 variables, 887/933 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1869/2802 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2802 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1400/3301 variables, 1901/4703 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3301 variables, 97/4800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3301 variables, 7/4807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3301 variables, 0/4807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/3301 variables, 0/4807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3301/3301 variables, and 4807 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3938 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1901/1901 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 5933ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 158549 steps, including 989 resets, run visited all 1 properties in 2380 ms. (steps per millisecond=66 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 15820 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPt-PT-100A-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPt-PT-100A-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 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' '!(X(F((G(p1)||p0))))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 41 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 02:00:38] [INFO ] Computed 901 invariants in 9 ms
[2024-05-29 02:00:40] [INFO ] Implicit Places using invariants in 1225 ms returned []
[2024-05-29 02:00:40] [INFO ] Invariant cache hit.
[2024-05-29 02:00:42] [INFO ] Implicit Places using invariants and state equation in 2199 ms returned []
Implicit Place search using SMT with State Equation took 3425 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:00:42] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30032 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30030 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60794ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60810ms
Finished structural reductions in LTL mode , in 1 iterations and 64281 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 6450 ms.
Product exploration explored 100000 steps with 50000 reset in 6553 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100A-LTLFireability-00 finished in 77545 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||(G(p2)&&X(X(G(p3)))&&p1))))'
Support contains 8 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 47 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 02:01:56] [INFO ] Invariant cache hit.
[2024-05-29 02:01:57] [INFO ] Implicit Places using invariants in 1080 ms returned []
[2024-05-29 02:01:57] [INFO ] Invariant cache hit.
[2024-05-29 02:01:59] [INFO ] Implicit Places using invariants and state equation in 2160 ms returned []
Implicit Place search using SMT with State Equation took 3260 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:01:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30027 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30031 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60690ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60704ms
Finished structural reductions in LTL mode , in 1 iterations and 64014 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 1460 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-01 finished in 65822 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)) U (p1&&X(G((p1||X(G(p2))))))))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 40 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 02:03:02] [INFO ] Invariant cache hit.
[2024-05-29 02:03:03] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2024-05-29 02:03:03] [INFO ] Invariant cache hit.
[2024-05-29 02:03:05] [INFO ] Implicit Places using invariants and state equation in 2144 ms returned []
Implicit Place search using SMT with State Equation took 3225 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:03:05] [INFO ] Invariant cache hit.
(s405 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30027 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30028 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60666ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60682ms
Finished structural reductions in LTL mode , in 1 iterations and 63950 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 337 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 1522 ms.
Product exploration explored 100000 steps with 0 reset in 1959 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 167 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1129 ms. (35 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 471 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 535 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 565 ms. (70 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 580 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 528 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 463 ms. (86 steps per ms) remains 6/6 properties
[2024-05-29 02:04:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1896/1903 variables, 898/908 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1896/2804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3305/3305 variables, and 4707 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1373 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1896/1903 variables, 898/908 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1896/2804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 6/4713 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3305 variables, 0/4713 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/3305 variables, 0/4713 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3305/3305 variables, and 4713 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1808 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3198ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2497 ms.
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 198 times.
Drop transitions (Partial Free agglomeration) removed 198 transitions
Iterating global reduction 0 with 198 rules applied. Total rules applied 202 place count 1901 transition count 1400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 203 place count 1900 transition count 1399
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 205 place count 1898 transition count 1399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 205 place count 1898 transition count 1398
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 207 place count 1897 transition count 1398
Applied a total of 207 rules in 261 ms. Remains 1897 /1903 variables (removed 6) and now considering 1398/1402 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 1897/1903 places, 1398/1402 transitions.
RANDOM walk for 40000 steps (8 resets) in 859 ms. (46 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 481 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 489 ms. (81 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 477 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 476 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 53588 steps, run visited all 6 properties in 1683 ms. (steps per millisecond=31 )
Probabilistic random walk after 53588 steps, saw 52399 distinct states, run finished after 1688 ms. (steps per millisecond=31 ) properties seen :6
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (OR p1 p0 p2))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR p1 (NOT p2)))), (F p0), (F (NOT (OR p0 p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 14 factoid took 495 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 46 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 02:04:21] [INFO ] Invariant cache hit.
[2024-05-29 02:04:22] [INFO ] Implicit Places using invariants in 1172 ms returned []
[2024-05-29 02:04:22] [INFO ] Invariant cache hit.
[2024-05-29 02:04:25] [INFO ] Implicit Places using invariants and state equation in 2183 ms returned []
Implicit Place search using SMT with State Equation took 3357 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:04:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30035 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30025 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60580ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60594ms
Finished structural reductions in LTL mode , in 1 iterations and 64003 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 208 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 659 ms. (60 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 475 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 467 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 466 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 464 ms. (86 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 6/6 properties
[2024-05-29 02:05:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1896/1903 variables, 898/908 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1896/2804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3305/3305 variables, and 4707 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1403 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1896/1903 variables, 898/908 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1896/2804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 6/4713 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3305 variables, 0/4713 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/3305 variables, 0/4713 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3305/3305 variables, and 4713 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1679 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3096ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2592 ms.
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 198 times.
Drop transitions (Partial Free agglomeration) removed 198 transitions
Iterating global reduction 0 with 198 rules applied. Total rules applied 202 place count 1901 transition count 1400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 203 place count 1900 transition count 1399
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 205 place count 1898 transition count 1399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 205 place count 1898 transition count 1398
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 207 place count 1897 transition count 1398
Applied a total of 207 rules in 223 ms. Remains 1897 /1903 variables (removed 6) and now considering 1398/1402 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 1897/1903 places, 1398/1402 transitions.
RANDOM walk for 40000 steps (8 resets) in 816 ms. (48 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 685 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 553 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 508 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 573 ms. (69 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 528 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 518 ms. (77 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 53588 steps, run visited all 6 properties in 1606 ms. (steps per millisecond=33 )
Probabilistic random walk after 53588 steps, saw 52399 distinct states, run finished after 1608 ms. (steps per millisecond=33 ) properties seen :6
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (OR p1 p0 p2))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR p1 (NOT p2)))), (F p0), (F (NOT (OR p0 p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 14 factoid took 492 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 437 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1412 ms.
Product exploration explored 100000 steps with 0 reset in 1904 ms.
Applying partial POR strategy [false, true, true, false, true, false, false]
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1402
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 267 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 02:05:41] [INFO ] Redundant transitions in 84 ms returned []
Running 1401 sub problems to find dead transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 02:05:41] [INFO ] Computed 901 invariants in 5 ms
[2024-05-29 02:05:41] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30022 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30026 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60548ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60561ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/1903 places, 1402/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60925 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin18198316863769492279
[2024-05-29 02:06:42] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18198316863769492279
Running compilation step : cd /tmp/ltsmin18198316863769492279;'/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/ltsmin18198316863769492279;'/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/ltsmin18198316863769492279;'/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 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 41 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 02:06:45] [INFO ] Computed 901 invariants in 4 ms
[2024-05-29 02:06:46] [INFO ] Implicit Places using invariants in 1032 ms returned []
[2024-05-29 02:06:46] [INFO ] Invariant cache hit.
[2024-05-29 02:06:48] [INFO ] Implicit Places using invariants and state equation in 2082 ms returned []
Implicit Place search using SMT with State Equation took 3116 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:06:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30029 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
(s24 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30023 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60594ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60609ms
Finished structural reductions in LTL mode , in 1 iterations and 63769 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin2362167327608826743
[2024-05-29 02:07:49] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2362167327608826743
Running compilation step : cd /tmp/ltsmin2362167327608826743;'/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/ltsmin2362167327608826743;'/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/ltsmin2362167327608826743;'/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-29 02:07:52] [INFO ] Flatten gal took : 114 ms
[2024-05-29 02:07:52] [INFO ] Flatten gal took : 164 ms
[2024-05-29 02:07:52] [INFO ] Time to serialize gal into /tmp/LTL4197921286861062122.gal : 44 ms
[2024-05-29 02:07:52] [INFO ] Time to serialize properties into /tmp/LTL11350244716751703685.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/LTL4197921286861062122.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16526426295306454608.hoa' '-atoms' '/tmp/LTL11350244716751703685.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11350244716751703685.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16526426295306454608.hoa
Detected timeout of ITS tools.
[2024-05-29 02:08:07] [INFO ] Flatten gal took : 98 ms
[2024-05-29 02:08:07] [INFO ] Flatten gal took : 99 ms
[2024-05-29 02:08:07] [INFO ] Time to serialize gal into /tmp/LTL9050614510602643335.gal : 8 ms
[2024-05-29 02:08:07] [INFO ] Time to serialize properties into /tmp/LTL13325163464573934164.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9050614510602643335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13325163464573934164.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("(p892==1)")))U(("(p1840==0)")&&(X(G(("(p1840==0)")||(X(G("(p624==0)")))))))))
Formula 0 simplified : FG!"(p892==1)" R (!"(p1840==0)" | XF(!"(p1840==0)" & XF!"(p624==0)"))
Detected timeout of ITS tools.
[2024-05-29 02:08:22] [INFO ] Flatten gal took : 104 ms
[2024-05-29 02:08:22] [INFO ] Applying decomposition
[2024-05-29 02:08:23] [INFO ] Flatten gal took : 94 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/graph11418029046977467427.txt' '-o' '/tmp/graph11418029046977467427.bin' '-w' '/tmp/graph11418029046977467427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11418029046977467427.bin' '-l' '-1' '-v' '-w' '/tmp/graph11418029046977467427.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:08:23] [INFO ] Decomposing Gal with order
[2024-05-29 02:08:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:08:23] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 02:08:23] [INFO ] Flatten gal took : 139 ms
[2024-05-29 02:08:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 148 ms.
[2024-05-29 02:08:23] [INFO ] Time to serialize gal into /tmp/LTL519098629507961391.gal : 30 ms
[2024-05-29 02:08:23] [INFO ] Time to serialize properties into /tmp/LTL18022449141595813327.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/LTL519098629507961391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18022449141595813327.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...254
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i18.i2.i1.u375.p892==1)")))U(("(i41.u774.p1840==0)")&&(X(G(("(i41.u774.p1840==0)")||(X(G("(i12.u262.p624==0)")))))))))
Formula 0 simplified : FG!"(i18.i2.i1.u375.p892==1)" R (!"(i41.u774.p1840==0)" | XF(!"(i41.u774.p1840==0)" & XF!"(i12.u262.p624==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
201 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.28159,61068,1,0,82512,578,5958,158258,122,3035,144768
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-100A-LTLFireability-02 finished in 324239 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(X(G((F(p1)&&p0))))))'
Support contains 6 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 49 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 02:08:26] [INFO ] Invariant cache hit.
[2024-05-29 02:08:27] [INFO ] Implicit Places using invariants in 1085 ms returned []
[2024-05-29 02:08:27] [INFO ] Invariant cache hit.
[2024-05-29 02:08:29] [INFO ] Implicit Places using invariants and state equation in 2235 ms returned []
Implicit Place search using SMT with State Equation took 3325 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:08:29] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30023 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30027 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60658ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60672ms
Finished structural reductions in LTL mode , in 1 iterations and 64050 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-03 finished in 64320 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 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 116 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 02:09:30] [INFO ] Computed 901 invariants in 8 ms
[2024-05-29 02:09:32] [INFO ] Implicit Places using invariants in 1132 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1135 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 64 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 02:09:32] [INFO ] Computed 899 invariants in 13 ms
[2024-05-29 02:09:33] [INFO ] Implicit Places using invariants in 1156 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1157 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 94 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 02:09:33] [INFO ] Computed 898 invariants in 9 ms
[2024-05-29 02:09:34] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2024-05-29 02:09:34] [INFO ] Invariant cache hit.
[2024-05-29 02:09:36] [INFO ] Implicit Places using invariants and state equation in 2252 ms returned []
Implicit Place search using SMT with State Equation took 3414 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5981 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 1473 ms.
Product exploration explored 100000 steps with 0 reset in 1961 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 884 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 676 ms. (59 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21271 steps, run visited all 1 properties in 436 ms. (steps per millisecond=48 )
Probabilistic random walk after 21271 steps, saw 20664 distinct states, run finished after 438 ms. (steps per millisecond=48 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 51 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-29 02:09:41] [INFO ] Invariant cache hit.
[2024-05-29 02:09:42] [INFO ] Implicit Places using invariants in 1075 ms returned []
[2024-05-29 02:09:42] [INFO ] Invariant cache hit.
[2024-05-29 02:09:45] [INFO ] Implicit Places using invariants and state equation in 2320 ms returned []
Implicit Place search using SMT with State Equation took 3398 ms to find 0 implicit places.
[2024-05-29 02:09:45] [INFO ] Redundant transitions in 27 ms returned []
Running 1397 sub problems to find dead transitions.
[2024-05-29 02:09:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1895 variables, 1895/1895 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1895/3294 variables, and 1895 constraints, problems are : Problem set: 0 solved, 1397 unsolved in 30030 ms.
Refiners :[Domain max(s): 1895/1896 constraints, Positive P Invariants (semi-flows): 0/898 constraints, State Equation: 0/1896 constraints, PredecessorRefiner: 1397/1397 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1895 variables, 1895/1895 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1895/3294 variables, and 1895 constraints, problems are : Problem set: 0 solved, 1397 unsolved in 30030 ms.
Refiners :[Domain max(s): 1895/1896 constraints, Positive P Invariants (semi-flows): 0/898 constraints, State Equation: 0/1896 constraints, PredecessorRefiner: 0/1397 constraints, Known Traps: 0/0 constraints]
After SMT, in 60556ms problems are : Problem set: 0 solved, 1397 unsolved
Search for dead transitions found 0 dead transitions in 60568ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64051 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 615 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 475 ms. (84 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21271 steps, run visited all 1 properties in 425 ms. (steps per millisecond=50 )
Probabilistic random walk after 21271 steps, saw 20664 distinct states, run finished after 427 ms. (steps per millisecond=49 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1447 ms.
Product exploration explored 100000 steps with 0 reset in 1918 ms.
Built C files in :
/tmp/ltsmin14536669794649142777
[2024-05-29 02:10:50] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2024-05-29 02:10:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:10:50] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2024-05-29 02:10:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:10:50] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2024-05-29 02:10:50] [INFO ] Computation of Completed DNA matrix. took 61 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:10:50] [INFO ] Built C files in 401ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14536669794649142777
Running compilation step : cd /tmp/ltsmin14536669794649142777;'/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/ltsmin14536669794649142777;'/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/ltsmin14536669794649142777;'/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 2 out of 1896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1896/1896 places, 1398/1398 transitions.
Applied a total of 0 rules in 62 ms. Remains 1896 /1896 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-05-29 02:10:53] [INFO ] Invariant cache hit.
[2024-05-29 02:10:54] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2024-05-29 02:10:54] [INFO ] Invariant cache hit.
[2024-05-29 02:10:56] [INFO ] Implicit Places using invariants and state equation in 2141 ms returned []
Implicit Place search using SMT with State Equation took 3219 ms to find 0 implicit places.
[2024-05-29 02:10:56] [INFO ] Redundant transitions in 24 ms returned []
Running 1397 sub problems to find dead transitions.
[2024-05-29 02:10:56] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1895 variables, 1895/1895 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1895/3294 variables, and 1895 constraints, problems are : Problem set: 0 solved, 1397 unsolved in 30027 ms.
Refiners :[Domain max(s): 1895/1896 constraints, Positive P Invariants (semi-flows): 0/898 constraints, State Equation: 0/1896 constraints, PredecessorRefiner: 1397/1397 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1895 variables, 1895/1895 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1895/3294 variables, and 1895 constraints, problems are : Problem set: 0 solved, 1397 unsolved in 30027 ms.
Refiners :[Domain max(s): 1895/1896 constraints, Positive P Invariants (semi-flows): 0/898 constraints, State Equation: 0/1896 constraints, PredecessorRefiner: 0/1397 constraints, Known Traps: 0/0 constraints]
After SMT, in 60568ms problems are : Problem set: 0 solved, 1397 unsolved
Search for dead transitions found 0 dead transitions in 60582ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63893 ms. Remains : 1896/1896 places, 1398/1398 transitions.
Built C files in :
/tmp/ltsmin2361848331353825098
[2024-05-29 02:11:57] [INFO ] Computing symmetric may disable matrix : 1398 transitions.
[2024-05-29 02:11:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:11:57] [INFO ] Computing symmetric may enable matrix : 1398 transitions.
[2024-05-29 02:11:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:11:57] [INFO ] Computing Do-Not-Accords matrix : 1398 transitions.
[2024-05-29 02:11:57] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:11:57] [INFO ] Built C files in 345ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2361848331353825098
Running compilation step : cd /tmp/ltsmin2361848331353825098;'/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/ltsmin2361848331353825098;'/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/ltsmin2361848331353825098;'/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-29 02:12:00] [INFO ] Flatten gal took : 93 ms
[2024-05-29 02:12:01] [INFO ] Flatten gal took : 90 ms
[2024-05-29 02:12:01] [INFO ] Time to serialize gal into /tmp/LTL8687318734539435745.gal : 8 ms
[2024-05-29 02:12:01] [INFO ] Time to serialize properties into /tmp/LTL15292158584975652699.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/LTL8687318734539435745.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13338280760531592834.hoa' '-atoms' '/tmp/LTL15292158584975652699.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15292158584975652699.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13338280760531592834.hoa
Detected timeout of ITS tools.
[2024-05-29 02:12:16] [INFO ] Flatten gal took : 88 ms
[2024-05-29 02:12:16] [INFO ] Flatten gal took : 88 ms
[2024-05-29 02:12:16] [INFO ] Time to serialize gal into /tmp/LTL2996010313052456307.gal : 7 ms
[2024-05-29 02:12:16] [INFO ] Time to serialize properties into /tmp/LTL1353002417909428617.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/LTL2996010313052456307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1353002417909428617.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 : !((F(G("((p1353==0)||(p1366==0))"))))
Formula 0 simplified : GF!"((p1353==0)||(p1366==0))"
Detected timeout of ITS tools.
[2024-05-29 02:12:31] [INFO ] Flatten gal took : 90 ms
[2024-05-29 02:12:31] [INFO ] Applying decomposition
[2024-05-29 02:12:31] [INFO ] Flatten gal took : 89 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/graph4175302846694717877.txt' '-o' '/tmp/graph4175302846694717877.bin' '-w' '/tmp/graph4175302846694717877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4175302846694717877.bin' '-l' '-1' '-v' '-w' '/tmp/graph4175302846694717877.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:12:31] [INFO ] Decomposing Gal with order
[2024-05-29 02:12:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:12:31] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-29 02:12:31] [INFO ] Flatten gal took : 82 ms
[2024-05-29 02:12:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 58 ms.
[2024-05-29 02:12:32] [INFO ] Time to serialize gal into /tmp/LTL14615460210078804242.gal : 25 ms
[2024-05-29 02:12:32] [INFO ] Time to serialize properties into /tmp/LTL2915331618859429380.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/LTL14615460210078804242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2915331618859429380.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 : !((F(G("((i31.i1.i1.u569.p1353==0)||(i31.i1.i2.u574.p1366==0))"))))
Formula 0 simplified : GF!"((i31.i1.i1.u569.p1353==0)||(i31.i1.i2.u574.p1366==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property ShieldIIPt-PT-100A-LTLFireability-04 finished in 196395 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||G((X(p2)&&p1))||G(F(p3))))))'
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 44 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 02:12:47] [INFO ] Computed 901 invariants in 8 ms
[2024-05-29 02:12:48] [INFO ] Implicit Places using invariants in 1161 ms returned []
[2024-05-29 02:12:48] [INFO ] Invariant cache hit.
[2024-05-29 02:12:50] [INFO ] Implicit Places using invariants and state equation in 2249 ms returned []
Implicit Place search using SMT with State Equation took 3415 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:12:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30027 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30024 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60629ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60644ms
Finished structural reductions in LTL mode , in 1 iterations and 64107 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 1480 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-07 finished in 65765 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(X((p0&&(G((F(p2)&&p1))||F(p3)))))))'
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 45 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 02:13:52] [INFO ] Invariant cache hit.
[2024-05-29 02:13:54] [INFO ] Implicit Places using invariants in 1071 ms returned []
[2024-05-29 02:13:54] [INFO ] Invariant cache hit.
[2024-05-29 02:13:56] [INFO ] Implicit Places using invariants and state equation in 2278 ms returned []
Implicit Place search using SMT with State Equation took 3351 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:13:56] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30028 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30027 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60552ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Finished structural reductions in LTL mode , in 1 iterations and 63966 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 390 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-08
Product exploration explored 100000 steps with 25000 reset in 3892 ms.
Product exploration explored 100000 steps with 25000 reset in 4193 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 8 states, 13 edges and 4 AP (stutter sensitive) to 8 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2))]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40000 steps (8 resets) in 1007 ms. (39 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 811 ms. (49 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 768 ms. (52 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 750 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 724 ms. (55 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 775 ms. (51 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 727 ms. (54 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 745 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 761 ms. (52 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 874 ms. (45 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 194081 steps, run timeout after 6003 ms. (steps per millisecond=32 ) properties seen :4 out of 9
Probabilistic random walk after 194081 steps, saw 192318 distinct states, run finished after 6004 ms. (steps per millisecond=32 ) properties seen :4
[2024-05-29 02:15:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 11/18 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1885/1903 variables, 893/919 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1885/2804 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3305/3305 variables, and 4707 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1386 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Problem apf4 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 11/18 variables, 8/15 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 11/26 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1885/1903 variables, 893/919 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1885/2804 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 3/4710 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3305 variables, 0/4710 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/3305 variables, 0/4710 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3305/3305 variables, and 4710 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1904 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3303ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 17465 ms.
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 198 times.
Drop transitions (Partial Free agglomeration) removed 198 transitions
Iterating global reduction 0 with 198 rules applied. Total rules applied 202 place count 1901 transition count 1400
Applied a total of 202 rules in 160 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 1901/1903 places, 1400/1402 transitions.
RANDOM walk for 40000 steps (8 resets) in 1247 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 589 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 522 ms. (76 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 121697 steps, run timeout after 3002 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 121697 steps, saw 120011 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 02:15:38] [INFO ] Computed 901 invariants in 7 ms
[2024-05-29 02:15:38] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 11/18 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1883/1901 variables, 893/919 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1883/2802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1400/3301 variables, 1901/4703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3301 variables, 102/4805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3301 variables, 0/4805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/3301 variables, 0/4805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3301/3301 variables, and 4805 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1012 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1901/1901 constraints, ReadFeed: 102/102 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 11/18 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1883/1901 variables, 893/919 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1883/2802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1400/3301 variables, 1901/4703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3301 variables, 102/4805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3301 variables, 2/4807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3301 variables, 0/4807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3301 variables, 0/4807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3301/3301 variables, and 4807 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3508 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1901/1901 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4546ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30002 ms.
Support contains 7 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 56 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 45 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-05-29 02:16:13] [INFO ] Invariant cache hit.
[2024-05-29 02:16:14] [INFO ] Implicit Places using invariants in 1153 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1157 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 59 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 02:16:14] [INFO ] Computed 899 invariants in 9 ms
[2024-05-29 02:16:15] [INFO ] Implicit Places using invariants in 1122 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1123 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 188 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 02:16:16] [INFO ] Computed 898 invariants in 7 ms
[2024-05-29 02:16:17] [INFO ] Implicit Places using invariants in 925 ms returned []
[2024-05-29 02:16:17] [INFO ] Invariant cache hit.
[2024-05-29 02:16:17] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 02:16:21] [INFO ] Implicit Places using invariants and state equation in 4862 ms returned []
Implicit Place search using SMT with State Equation took 5788 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8361 ms. Remains : 1896/1901 places, 1398/1400 transitions.
RANDOM walk for 40000 steps (8 resets) in 1246 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 557 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 548 ms. (72 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 108004 steps, run timeout after 3002 ms. (steps per millisecond=35 ) properties seen :0 out of 2
Probabilistic random walk after 108004 steps, saw 106486 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-29 02:16:25] [INFO ] Invariant cache hit.
[2024-05-29 02:16:25] [INFO ] State equation strengthened by 99 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1878/1896 variables, 890/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1896 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1398/3294 variables, 1896/2794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3294 variables, 99/2893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3294 variables, 0/2893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3294 variables, 0/2893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3294/3294 variables, and 2893 constraints, problems are : Problem set: 0 solved, 2 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 898/898 constraints, State Equation: 1896/1896 constraints, ReadFeed: 99/99 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1878/1896 variables, 890/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1896 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1398/3294 variables, 1896/2794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3294 variables, 99/2893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3294 variables, 2/2895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3294 variables, 0/2895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/3294 variables, 0/2895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3294/3294 variables, and 2895 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2322 ms.
Refiners :[Positive P Invariants (semi-flows): 898/898 constraints, State Equation: 1896/1896 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3187ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 156385 steps, including 295 resets, run visited all 2 properties in 3833 ms. (steps per millisecond=40 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 3835 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), (G (OR (NOT p0) (NOT p1) p2 p3)), (G (OR (NOT p1) p2 p3))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT p3)), (F p2), (F (NOT (OR p2 p3))), (F (NOT (OR p1 p3))), (F p1)]
Knowledge based reduction with 3 factoid took 308 ms. Reduced automaton from 8 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 45 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 02:16:33] [INFO ] Computed 901 invariants in 11 ms
[2024-05-29 02:16:34] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2024-05-29 02:16:34] [INFO ] Invariant cache hit.
[2024-05-29 02:16:36] [INFO ] Implicit Places using invariants and state equation in 2108 ms returned []
Implicit Place search using SMT with State Equation took 3162 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:16:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30030 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(timeout
s306 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30021 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60611ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60625ms
Finished structural reductions in LTL mode , in 1 iterations and 63836 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
RANDOM walk for 40000 steps (8 resets) in 2157 ms. (18 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 797 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 655 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 631 ms. (63 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 676 ms. (59 steps per ms) remains 4/4 properties
[2024-05-29 02:17:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 11/18 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1885/1903 variables, 893/919 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1885/2804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/3305 variables, 0/4707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3305/3305 variables, and 4707 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1132 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 11/18 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1885/1903 variables, 893/919 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1885/2804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1402/3305 variables, 1903/4707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3305 variables, 4/4711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3305 variables, 0/4711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/3305 variables, 0/4711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3305/3305 variables, and 4711 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2459 ms.
Refiners :[Domain max(s): 1903/1903 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1903/1903 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3604ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 17404 ms.
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 198 times.
Drop transitions (Partial Free agglomeration) removed 198 transitions
Iterating global reduction 0 with 198 rules applied. Total rules applied 202 place count 1901 transition count 1400
Applied a total of 202 rules in 169 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 1901/1903 places, 1400/1402 transitions.
RANDOM walk for 40000 steps (8 resets) in 1249 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 544 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 534 ms. (74 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 115634 steps, run timeout after 3002 ms. (steps per millisecond=38 ) properties seen :0 out of 2
Probabilistic random walk after 115634 steps, saw 114015 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 02:18:03] [INFO ] Computed 901 invariants in 8 ms
[2024-05-29 02:18:03] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 11/18 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1883/1901 variables, 893/919 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1883/2802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1400/3301 variables, 1901/4703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3301 variables, 102/4805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3301 variables, 0/4805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/3301 variables, 0/4805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3301/3301 variables, and 4805 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1128 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1901/1901 constraints, ReadFeed: 102/102 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 11/18 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1883/1901 variables, 893/919 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1901 variables, 1883/2802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1901 variables, 0/2802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1400/3301 variables, 1901/4703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3301 variables, 102/4805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3301 variables, 2/4807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3301 variables, 0/4807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3301 variables, 0/4807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3301/3301 variables, and 4807 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3625 ms.
Refiners :[Domain max(s): 1901/1901 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 1901/1901 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4773ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 30002 ms.
Support contains 7 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 63 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 50 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-05-29 02:18:38] [INFO ] Invariant cache hit.
[2024-05-29 02:18:39] [INFO ] Implicit Places using invariants in 1188 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1191 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 63 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 02:18:40] [INFO ] Computed 899 invariants in 4 ms
[2024-05-29 02:18:41] [INFO ] Implicit Places using invariants in 1152 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1154 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1897/1901 places, 1399/1400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1896 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 91 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 02:18:41] [INFO ] Computed 898 invariants in 6 ms
[2024-05-29 02:18:42] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-05-29 02:18:42] [INFO ] Invariant cache hit.
[2024-05-29 02:18:43] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-29 02:18:47] [INFO ] Implicit Places using invariants and state equation in 4834 ms returned []
Implicit Place search using SMT with State Equation took 5736 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1896/1901 places, 1398/1400 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8285 ms. Remains : 1896/1901 places, 1398/1400 transitions.
RANDOM walk for 40000 steps (8 resets) in 1285 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 550 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 532 ms. (75 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 121006 steps, run timeout after 3003 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 121006 steps, saw 119341 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-29 02:18:50] [INFO ] Invariant cache hit.
[2024-05-29 02:18:50] [INFO ] State equation strengthened by 99 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1878/1896 variables, 890/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1896 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1398/3294 variables, 1896/2794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3294 variables, 99/2893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3294 variables, 0/2893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3294 variables, 0/2893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3294/3294 variables, and 2893 constraints, problems are : Problem set: 0 solved, 2 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 898/898 constraints, State Equation: 1896/1896 constraints, ReadFeed: 99/99 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1878/1896 variables, 890/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1896 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1398/3294 variables, 1896/2794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3294 variables, 99/2893 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3294 variables, 2/2895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3294 variables, 0/2895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/3294 variables, 0/2895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3294/3294 variables, and 2895 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2300 ms.
Refiners :[Positive P Invariants (semi-flows): 898/898 constraints, State Equation: 1896/1896 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3153ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 114842 steps, including 217 resets, run visited all 2 properties in 2511 ms. (steps per millisecond=45 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 2513 ms.
Knowledge obtained : [(AND p3 (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p1 p3))), (F (NOT (OR (NOT p0) p1 p3))), (F p1), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT p0)), (F (NOT (OR (NOT p1) p3)))]
Knowledge based reduction with 1 factoid took 281 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 25000 reset in 3831 ms.
Product exploration explored 100000 steps with 25000 reset in 4268 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 296 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Support contains 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1402
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1903 transition count 1402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1903 transition count 1402
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 118 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 02:19:06] [INFO ] Redundant transitions in 22 ms returned []
Running 1401 sub problems to find dead transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 02:19:06] [INFO ] Computed 901 invariants in 5 ms
[2024-05-29 02:19:06] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30026 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30025 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60711ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60723ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1903/1903 places, 1402/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60872 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin4933332331974540999
[2024-05-29 02:20:06] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4933332331974540999
Running compilation step : cd /tmp/ltsmin4933332331974540999;'/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/ltsmin4933332331974540999;'/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/ltsmin4933332331974540999;'/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 7 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 54 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 02:20:09] [INFO ] Computed 901 invariants in 2 ms
[2024-05-29 02:20:10] [INFO ] Implicit Places using invariants in 1015 ms returned []
[2024-05-29 02:20:10] [INFO ] Invariant cache hit.
[2024-05-29 02:20:13] [INFO ] Implicit Places using invariants and state equation in 2089 ms returned []
Implicit Place search using SMT with State Equation took 3106 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:20:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30035 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 timeout
1)
(s1649 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30028 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60655ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60668ms
Finished structural reductions in LTL mode , in 1 iterations and 63831 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin4617885086949584400
[2024-05-29 02:21:13] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4617885086949584400
Running compilation step : cd /tmp/ltsmin4617885086949584400;'/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/ltsmin4617885086949584400;'/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/ltsmin4617885086949584400;'/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-29 02:21:16] [INFO ] Flatten gal took : 97 ms
[2024-05-29 02:21:16] [INFO ] Flatten gal took : 88 ms
[2024-05-29 02:21:16] [INFO ] Time to serialize gal into /tmp/LTL12260492959256831025.gal : 6 ms
[2024-05-29 02:21:16] [INFO ] Time to serialize properties into /tmp/LTL13393804633519464250.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/LTL12260492959256831025.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14786176616715556650.hoa' '-atoms' '/tmp/LTL13393804633519464250.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...320
Loading property file /tmp/LTL13393804633519464250.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14786176616715556650.hoa
Detected timeout of ITS tools.
[2024-05-29 02:21:32] [INFO ] Flatten gal took : 86 ms
[2024-05-29 02:21:32] [INFO ] Flatten gal took : 89 ms
[2024-05-29 02:21:32] [INFO ] Time to serialize gal into /tmp/LTL17824960268397886942.gal : 7 ms
[2024-05-29 02:21:32] [INFO ] Time to serialize properties into /tmp/LTL10496265246264323538.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/LTL17824960268397886942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10496265246264323538.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 : !((X(X(X(("((p252==0)||(p263==0))")&&((G(("((p1096==1)&&(p1102==1))")&&(("(p1104==1)")&&(F("(((p1096==1)&&(p1102==1))&&(p1104==1))")))...196
Formula 0 simplified : XXX(!"((p252==0)||(p263==0))" | (F(!"((p1096==1)&&(p1102==1))" | !"(p1104==1)" | G!"(((p1096==1)&&(p1102==1))&&(p1104==1))") & G!"((...180
Detected timeout of ITS tools.
[2024-05-29 02:21:47] [INFO ] Flatten gal took : 87 ms
[2024-05-29 02:21:47] [INFO ] Applying decomposition
[2024-05-29 02:21:47] [INFO ] Flatten gal took : 87 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/graph2798616140304356641.txt' '-o' '/tmp/graph2798616140304356641.bin' '-w' '/tmp/graph2798616140304356641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2798616140304356641.bin' '-l' '-1' '-v' '-w' '/tmp/graph2798616140304356641.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:21:47] [INFO ] Decomposing Gal with order
[2024-05-29 02:21:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:21:47] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 02:21:47] [INFO ] Flatten gal took : 101 ms
[2024-05-29 02:21:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 53 ms.
[2024-05-29 02:21:47] [INFO ] Time to serialize gal into /tmp/LTL4724761187591755464.gal : 19 ms
[2024-05-29 02:21:47] [INFO ] Time to serialize properties into /tmp/LTL16416219701907507173.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/LTL4724761187591755464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16416219701907507173.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(X(("((i5.i1.i2.u106.p252==0)||(i5.i1.i0.u110.p263==0))")&&((G(("((i25.i0.i0.u460.p1096==1)&&(i24.i1.i2.u463.p1102==1))")&&(("(i...332
Formula 0 simplified : XXX(!"((i5.i1.i2.u106.p252==0)||(i5.i1.i0.u110.p263==0))" | (F(!"((i25.i0.i0.u460.p1096==1)&&(i24.i1.i2.u463.p1102==1))" | !"(i24.i1...316
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
183 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.08957,73920,1,0,106209,1246,4544,238839,117,11139,11377
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-100A-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-100A-LTLFireability-08 finished in 477187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1&&X(!p2))))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 44 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 02:21:50] [INFO ] Invariant cache hit.
[2024-05-29 02:21:51] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2024-05-29 02:21:51] [INFO ] Invariant cache hit.
[2024-05-29 02:21:53] [INFO ] Implicit Places using invariants and state equation in 2141 ms returned []
Implicit Place search using SMT with State Equation took 3179 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:21:53] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30024 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30022 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60635ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60648ms
Finished structural reductions in LTL mode , in 1 iterations and 63875 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 128 ms :[p2, true, (OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-10 finished in 64029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(G(p0)))&&G((p0 U X(p1))))))'
Support contains 3 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Applied a total of 4 rules in 114 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
// Phase 1: matrix 1400 rows 1901 cols
[2024-05-29 02:22:54] [INFO ] Computed 901 invariants in 8 ms
[2024-05-29 02:22:55] [INFO ] Implicit Places using invariants in 1088 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1093 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1899/1903 places, 1400/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1899 transition count 1399
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1399
Applied a total of 2 rules in 62 ms. Remains 1898 /1899 variables (removed 1) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 1898 cols
[2024-05-29 02:22:55] [INFO ] Computed 899 invariants in 5 ms
[2024-05-29 02:22:56] [INFO ] Implicit Places using invariants in 1060 ms returned [1887]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1062 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/1903 places, 1399/1402 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1896 transition count 1398
Applied a total of 2 rules in 105 ms. Remains 1896 /1897 variables (removed 1) and now considering 1398/1399 (removed 1) transitions.
// Phase 1: matrix 1398 rows 1896 cols
[2024-05-29 02:22:56] [INFO ] Computed 898 invariants in 3 ms
[2024-05-29 02:22:57] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2024-05-29 02:22:57] [INFO ] Invariant cache hit.
[2024-05-29 02:22:59] [INFO ] Implicit Places using invariants and state equation in 2168 ms returned []
Implicit Place search using SMT with State Equation took 3211 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1896/1903 places, 1398/1402 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5647 ms. Remains : 1896/1903 places, 1398/1402 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 1393 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 1 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-11 finished in 7404 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(((p0 U p1) U !p2))||(G(p1) U p0))))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 46 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 1903 cols
[2024-05-29 02:23:01] [INFO ] Computed 901 invariants in 7 ms
[2024-05-29 02:23:02] [INFO ] Implicit Places using invariants in 1063 ms returned []
[2024-05-29 02:23:02] [INFO ] Invariant cache hit.
[2024-05-29 02:23:04] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 3136 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:23:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30021 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30023 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60596ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60611ms
Finished structural reductions in LTL mode , in 1 iterations and 63796 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 4708 ms.
Product exploration explored 100000 steps with 33333 reset in 4976 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 17 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-100A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100A-LTLFireability-12 finished in 73772 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)&&X(X(F(p1))))))'
Support contains 5 out of 1903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Applied a total of 0 rules in 50 ms. Remains 1903 /1903 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2024-05-29 02:24:15] [INFO ] Invariant cache hit.
[2024-05-29 02:24:16] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2024-05-29 02:24:16] [INFO ] Invariant cache hit.
[2024-05-29 02:24:18] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 3242 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-05-29 02:24:18] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30023 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1902 variables, 1902/1902 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1902/3305 variables, and 1902 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30024 ms.
Refiners :[Domain max(s): 1902/1903 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/1903 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 60693ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 60705ms
Finished structural reductions in LTL mode , in 1 iterations and 63999 ms. Remains : 1903/1903 places, 1402/1402 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldIIPt-PT-100A-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100A-LTLFireability-15 finished in 64249 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)))'
[2024-05-29 02:25:19] [INFO ] Flatten gal took : 104 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8435176886380285060
[2024-05-29 02:25:19] [INFO ] Computing symmetric may disable matrix : 1402 transitions.
[2024-05-29 02:25:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:25:19] [INFO ] Computing symmetric may enable matrix : 1402 transitions.
[2024-05-29 02:25:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:25:19] [INFO ] Applying decomposition
[2024-05-29 02:25:19] [INFO ] Flatten gal took : 88 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/graph2704696737901768349.txt' '-o' '/tmp/graph2704696737901768349.bin' '-w' '/tmp/graph2704696737901768349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2704696737901768349.bin' '-l' '-1' '-v' '-w' '/tmp/graph2704696737901768349.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:25:20] [INFO ] Decomposing Gal with order
[2024-05-29 02:25:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:25:20] [INFO ] Computing Do-Not-Accords matrix : 1402 transitions.
[2024-05-29 02:25:20] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 02:25:20] [INFO ] Built C files in 360ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8435176886380285060
Running compilation step : cd /tmp/ltsmin8435176886380285060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
[2024-05-29 02:25:20] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 02:25:20] [INFO ] Flatten gal took : 85 ms
[2024-05-29 02:25:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 64 ms.
[2024-05-29 02:25:20] [INFO ] Time to serialize gal into /tmp/LTLFireability2652752566829807755.gal : 94 ms
[2024-05-29 02:25:20] [INFO ] Time to serialize properties into /tmp/LTLFireability20661987419867631.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/LTLFireability2652752566829807755.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability20661987419867631.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...274
Read 1 LTL properties
Checking formula 0 : !((F(G("((i31.i0.i1.u569.p1353!=1)||(i31.i0.i2.u574.p1366!=1))"))))
Formula 0 simplified : GF!"((i31.i0.i1.u569.p1353!=1)||(i31.i0.i2.u574.p1366!=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 6133 ms.
Running link step : cd /tmp/ltsmin8435176886380285060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin8435176886380285060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 405748 ms.
FORMULA ShieldIIPt-PT-100A-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1996995 ms.

BK_STOP 1716949932290

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100A.tgz
mv ShieldIIPt-PT-100A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;