MCC'2024- Execution of r528-tall-171683760400131

About the Execution of LTSMin+red for ShieldIIPs-PT-040A

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1704.787	2392427.00	4892558.00	3654.90	TTT?FFFTTFFFF?FT	normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 338K 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 ShieldIIPs-PT-040A-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-040A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717228386189

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:53:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:53:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:53:07] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2024-06-01 07:53:07] [INFO ] Transformed 1003 places.
[2024-06-01 07:53:07] [INFO ] Transformed 963 transitions.
[2024-06-01 07:53:07] [INFO ] Found NUPN structural information;
[2024-06-01 07:53:07] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-040A-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 92 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-06-01 07:53:07] [INFO ] Computed 361 invariants in 33 ms
[2024-06-01 07:53:08] [INFO ] Implicit Places using invariants in 863 ms returned []
[2024-06-01 07:53:08] [INFO ] Invariant cache hit.
[2024-06-01 07:53:09] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 2019 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 07:53:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30038 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 17 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:53:55] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:53:55] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:53:55] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:53:55] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:53:55] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:53:56] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:53:56] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:53:56] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:53:56] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:53:56] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 12 ms to minimize.
[2024-06-01 07:53:57] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:53:57] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:53:57] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:53:57] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:53:58] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:53:58] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:53:58] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:53:59] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:54:02] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:54:02] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 5 ms to minimize.
[2024-06-01 07:54:02] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:54:03] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:54:03] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:54:03] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:54:04] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:54:04] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:54:04] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:54:05] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:54:05] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:54:05] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:54:06] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 4 ms to minimize.
[2024-06-01 07:54:06] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 7 ms to minimize.
[2024-06-01 07:54:07] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:54:07] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:54:07] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 3 ms to minimize.
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 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30018 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60519ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60548ms
Finished structural reductions in LTL mode , in 1 iterations and 62684 ms. Remains : 1003/1003 places, 963/963 transitions.
Support contains 32 out of 1003 places after structural reductions.
[2024-06-01 07:54:10] [INFO ] Flatten gal took : 163 ms
[2024-06-01 07:54:10] [INFO ] Flatten gal took : 78 ms
[2024-06-01 07:54:11] [INFO ] Input system was already deterministic with 963 transitions.
RANDOM walk for 40000 steps (16 resets) in 1700 ms. (23 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 1/1 properties
[2024-06-01 07:54:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 996/1003 variables, 359/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 996/1364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:54:12] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 1/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 0/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 963/1966 variables, 1003/2368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:54:12] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:54:12] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 4 ms to minimize.
[2024-06-01 07:54:12] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:54:13] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:54:13] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:54:13] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:54:13] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1966 variables, 7/2375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1966 variables, 0/2375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1966 variables, 0/2375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1966/1966 variables, and 2375 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2232 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 996/1003 variables, 359/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 996/1364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 8/1372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:54:14] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 1/1373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1003 variables, 0/1373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 963/1966 variables, 1003/2376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1966 variables, 1/2377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:54:14] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1966 variables, 1/2378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1966 variables, 0/2378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1966 variables, 0/2378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1966/1966 variables, and 2378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 945 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 1003/1003 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3190ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1574 ms.
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 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 1003 transition count 962
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 1002 transition count 962
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 1001 transition count 961
Partial Free-agglomeration rule applied 278 times.
Drop transitions (Partial Free agglomeration) removed 278 transitions
Iterating global reduction 0 with 278 rules applied. Total rules applied 282 place count 1001 transition count 961
Applied a total of 282 rules in 190 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 1001/1003 places, 961/963 transitions.
RANDOM walk for 10882 steps (0 resets) in 711 ms. (15 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-040A-LTLCardinality-05 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' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 21 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-06-01 07:54:17] [INFO ] Invariant cache hit.
[2024-06-01 07:54:17] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-06-01 07:54:17] [INFO ] Invariant cache hit.
[2024-06-01 07:54:18] [INFO ] Implicit Places using invariants and state equation in 1055 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 07:54:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30024 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:55:03] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 9 ms to minimize.
[2024-06-01 07:55:05] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:55:05] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:55:05] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 5 ms to minimize.
[2024-06-01 07:55:05] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:55:06] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:55:06] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:55:06] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:55:06] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:55:11] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:55:11] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:55:12] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:55:12] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:55:12] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:55:13] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:55:13] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:55:13] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:55:14] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:55:14] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:55:14] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:55:15] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:55:15] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:55:15] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:55:16] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:55:16] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:55:17] [INFO ] Deduced a trap composed of 47 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:55:17] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 3 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30018 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60356ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Finished structural reductions in LTL mode , in 1 iterations and 61975 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 2902 ms.
Product exploration explored 100000 steps with 50000 reset in 2799 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 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 24 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040A-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040A-LTLCardinality-02 finished in 68056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Reduce places removed 1 places and 1 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 1002 transition count 961
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
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 5 place count 999 transition count 960
Applied a total of 5 rules in 71 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
// Phase 1: matrix 960 rows 999 cols
[2024-06-01 07:55:25] [INFO ] Computed 360 invariants in 5 ms
[2024-06-01 07:55:25] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-06-01 07:55:25] [INFO ] Invariant cache hit.
[2024-06-01 07:55:26] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1547 ms to find 0 implicit places.
[2024-06-01 07:55:26] [INFO ] Redundant transitions in 149 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 958 sub problems to find dead transitions.
// Phase 1: matrix 959 rows 999 cols
[2024-06-01 07:55:26] [INFO ] Computed 360 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 07:55:41] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:55:41] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:55:41] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:55:41] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:55:41] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:55:41] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:55:44] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:55:44] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:55:44] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:55:44] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 07:55:48] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:55:48] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:55:49] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:55:49] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:55:49] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:55:49] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:55:50] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:55:50] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:55:51] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:55:51] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:55:51] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:55:52] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 4 ms to minimize.
[2024-06-01 07:55:52] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:55:53] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:55:53] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 4 ms to minimize.
[2024-06-01 07:55:53] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 3 ms to minimize.
[2024-06-01 07:55:54] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:55:54] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 3 ms to minimize.
[2024-06-01 07:55:55] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1958 variables, and 1398 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30033 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 07:56:15] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 1/1399 constraints. Problems are: Problem set: 0 solved, 958 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 999/1958 variables, and 1399 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30022 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 40/40 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Starting structural reductions in SI_LTL mode, iteration 1 : 999/1003 places, 959/963 transitions.
Applied a total of 0 rules in 27 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62094 ms. Remains : 999/1003 places, 959/963 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLCardinality-03
Product exploration explored 100000 steps with 79 reset in 800 ms.
Product exploration explored 100000 steps with 79 reset in 1032 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4997 steps (0 resets) in 93 ms. (53 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:56:29] [INFO ] Invariant cache hit.
[2024-06-01 07:56:30] [INFO ] [Real]Absence check using 360 positive place invariants in 168 ms returned sat
[2024-06-01 07:56:32] [INFO ] [Real]Absence check using state equation in 2030 ms returned sat
[2024-06-01 07:56:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:56:33] [INFO ] [Nat]Absence check using 360 positive place invariants in 155 ms returned sat
[2024-06-01 07:56:35] [INFO ] [Nat]Absence check using state equation in 2308 ms returned sat
[2024-06-01 07:56:35] [INFO ] Computed and/alt/rep : 958/2387/958 causal constraints (skipped 0 transitions) in 124 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 07:56:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 959/959 transitions.
Applied a total of 0 rules in 41 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-06-01 07:56:47] [INFO ] Invariant cache hit.
[2024-06-01 07:56:48] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-06-01 07:56:48] [INFO ] Invariant cache hit.
[2024-06-01 07:56:49] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1676 ms to find 0 implicit places.
[2024-06-01 07:56:49] [INFO ] Redundant transitions in 237 ms returned []
Running 958 sub problems to find dead transitions.
[2024-06-01 07:56:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 07:57:04] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:57:05] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:57:05] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:57:05] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:57:05] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:57:05] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:57:06] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:57:06] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 3 ms to minimize.
[2024-06-01 07:57:06] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:57:06] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:57:07] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:57:07] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:57:07] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:57:07] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:57:08] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:57:08] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:57:08] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:57:08] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 5 ms to minimize.
[2024-06-01 07:57:09] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:57:09] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 07:57:12] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:57:12] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:57:13] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:57:13] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:57:13] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:57:15] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:57:15] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 4 ms to minimize.
[2024-06-01 07:57:17] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:57:17] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 3 ms to minimize.
[2024-06-01 07:57:18] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:57:18] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 3 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 3 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1958 variables, and 1398 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30045 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 07:57:39] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 1/1399 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1958 variables, and 1399 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30026 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 40/40 constraints]
After SMT, in 60358ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60369ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62368 ms. Remains : 999/999 places, 959/959 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5063 steps (0 resets) in 62 ms. (80 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:57:50] [INFO ] Invariant cache hit.
[2024-06-01 07:57:51] [INFO ] [Real]Absence check using 360 positive place invariants in 171 ms returned sat
[2024-06-01 07:57:53] [INFO ] [Real]Absence check using state equation in 2043 ms returned sat
[2024-06-01 07:57:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:57:54] [INFO ] [Nat]Absence check using 360 positive place invariants in 134 ms returned sat
[2024-06-01 07:57:56] [INFO ] [Nat]Absence check using state equation in 2283 ms returned sat
[2024-06-01 07:57:56] [INFO ] Computed and/alt/rep : 958/2387/958 causal constraints (skipped 0 transitions) in 51 ms.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 79 reset in 807 ms.
Product exploration explored 100000 steps with 79 reset in 959 ms.
Support contains 1 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 959/959 transitions.
Applied a total of 0 rules in 27 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-06-01 07:58:10] [INFO ] Invariant cache hit.
[2024-06-01 07:58:10] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-06-01 07:58:10] [INFO ] Invariant cache hit.
[2024-06-01 07:58:11] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
[2024-06-01 07:58:11] [INFO ] Redundant transitions in 103 ms returned []
Running 958 sub problems to find dead transitions.
[2024-06-01 07:58:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 07:58:25] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:58:26] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:58:26] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:58:26] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:58:26] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:58:26] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:58:26] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-06-01 07:58:27] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:58:27] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:58:27] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:58:27] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:58:28] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 3 ms to minimize.
[2024-06-01 07:58:28] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:58:28] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:58:28] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:58:29] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:58:29] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:58:29] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:58:29] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:58:30] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 07:58:33] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:58:33] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:58:33] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:58:33] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:58:34] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:58:34] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:58:34] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:58:35] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:58:36] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:58:37] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:58:38] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:58:38] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 4 ms to minimize.
[2024-06-01 07:58:39] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:58:39] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 1.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 1.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 1.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 1.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 1.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 0.0)
(s558 1.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 1.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 1.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 1.0)
(s609 1.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 1.0)
(s632 0.0)
(s633 1.0)
(s634 1.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 1.0)
(s651 0.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 1.0)
(s659 1.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 1.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 1.0)
(s682 0.0)
(s683 1.0)
(s684 1.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 1.0)
(s707 0.0)
(s708 1.0)
(s709 1.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 1.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 1.0)
(s732 0.0)
(s733 1.0)
(s734 1.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 1.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 1.0)
(s751 0.0)
(s752 1.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 1.0)
(s757 0.0)
(s758 1.0)
(s759 1.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 1.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 1.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 1.0)
(s776 0.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 1.0)
(s782 0.0)
(s783 1.0)
(s784 1.0)
(s785 0.0)
(s786 1.0)
(s787 0.0)
(s788 1.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 1.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 1.0)
(s801 0.0)
(s802 1.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 1.0)
(s807 0.0)
(s808 1.0)
(s809 1.0)
(s810 0.0)
(s811 1.0)
(s812 0.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 1.0)
(s818 0.0)
(s819 1.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 1.0)
(s826 0.0)
(s827 1.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 1.0)
(s832 0.0)
(s833 1.0)
(s834 1.0)
(s835 0.0)
(s836 1.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 1.0)
(s843 0.0)
(s844 1.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 1.0)
(s851 0.0)
(s852 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1958 variables, and 1398 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30026 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 07:58:59] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 1/1399 constraints. Problems are: Problem set: 0 solved, 958 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 999/1958 variables, and 1399 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30019 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 40/40 constraints]
After SMT, in 60255ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60275ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61909 ms. Remains : 999/999 places, 959/959 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLCardinality-03 finished in 227130 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(p1)||X(p2)))))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-06-01 07:59:12] [INFO ] Computed 361 invariants in 5 ms
[2024-06-01 07:59:12] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-06-01 07:59:12] [INFO ] Invariant cache hit.
[2024-06-01 07:59:13] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 07:59:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30019 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 07:59:58] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:59:58] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:59:58] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:59:59] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:59:59] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:59:59] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:59:59] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-06-01 07:59:59] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:59:59] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:00:00] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 08:00:00] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:00:00] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:00:00] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:00:01] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 08:00:01] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:00:01] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:00:01] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 08:00:02] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:00:02] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:00:02] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:00:05] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:00:05] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-06-01 08:00:06] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-06-01 08:00:06] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 3 ms to minimize.
[2024-06-01 08:00:06] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-06-01 08:00:07] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-06-01 08:00:07] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 08:00:07] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
[2024-06-01 08:00:08] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-06-01 08:00:08] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-06-01 08:00:08] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 3 ms to minimize.
[2024-06-01 08:00:09] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-06-01 08:00:09] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 3 ms to minimize.
[2024-06-01 08:00:10] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 4 ms to minimize.
[2024-06-01 08:00:10] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 3 ms to minimize.
[2024-06-01 08:00:10] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 4 ms to minimize.
[2024-06-01 08:00:11] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 3 ms to minimize.
[2024-06-01 08:00:11] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 4 ms to minimize.
[2024-06-01 08:00:12] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 1)
(s361 0)
(s362 1)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 1)
(s411 0)
(s412 1)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 1)
(s436 0)
(s437 1)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 0)
(s443 1)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 1)
(s460 1)
(s461 0)
(s462 1)
(s463 0)
(s464 1)
(s465 0)
(s466 0)
(s467 0)
(s468 1)
(s469 0)
(s470 1)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 1)
(s485 1)
(s486 0)
(s487 1)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 1)
(s494 0)
(s495 1)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 1)
(s502 0)
(s503 1)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 1)
(s510 1)
(s511 0)
(s512 1)
(s513 0)
(s514 1)
(s515 0)
(s516 0)
(s517 0)
(s518 1)
(s519 0)
(s520 1)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 1)
(s535 1)
(s536 0)
(s537 1)
(s538 0)
(s539 1)
(s540 0)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 1)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 1)
(s552 0)
(s553 1)
(s554 0)
(s555 0)
(s556 0)
(s557 1)
(s558 0)
(s559 1)
(s560 1)
(s561 0)
(s562 1)
(s563 0)
(s564 1)
(s565 0)
(s566 0)
(s567 0)
(s568 1)
(s569 0)
(s570 1)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 1)
(s577 0)
(s578 1)
(s579 0)
(s580 0)
(s581 0)
(s582 1)
(s583 0)
(s584 1)
(s585 1)
(s586 0)
(s587 1)
(s588 0)
(s589 1)
(s590 0)
(s591 0)
(s592 0)
(s593 1)
(s594 0)
(s595 1)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 1)
(s602 0)
(s603 1)
(s604 0)
(s605 0)
(s606 0)
(s607 1)
(s608 0)
(s609 1)
(s610 1)
(s611 0)
(s612 1)
(s613 0)
(s614 1)
(s615 0)
(s616 0)
(s617 0)
(s618 1)
(s619 0)
(s620 1)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 1)
(s627 0)
(s628 1)
(s629 0)
(s630 0)
(s631 0)
(s632 1)
(s633 0)
(s634 1)
(s635 1)
(s636 0)
(s637 1)
(s638 0)
(s639 1)
(s640 0)
(s641 0)
(s642 0)
(s643 1)
(s644 0)
(s645 1)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 1)
(s652 0)
(s653 1)
(s654 0)
(s655 0)
(s656 0)
(s657 1)
(s658 0)
(s659 1)
(s660 1)
(s661 0)
(s662 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30026 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60313ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Finished structural reductions in LTL mode , in 1 iterations and 61941 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-040A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLCardinality-04 finished in 62258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0)) U !p1))))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 18 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-06-01 08:00:14] [INFO ] Invariant cache hit.
[2024-06-01 08:00:15] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-06-01 08:00:15] [INFO ] Invariant cache hit.
[2024-06-01 08:00:16] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 08:00:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30021 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:01:00] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:01:00] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
[2024-06-01 08:01:00] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:01:00] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:01:00] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:01:01] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:01:01] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-06-01 08:01:01] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:01:01] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-06-01 08:01:01] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:01:02] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:01:02] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:01:02] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 08:01:02] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:01:02] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 08:01:03] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:01:03] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:01:03] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:01:03] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:01:04] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:01:07] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 3 ms to minimize.
[2024-06-01 08:01:07] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:01:07] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:01:07] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-06-01 08:01:08] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 08:01:08] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-06-01 08:01:08] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-06-01 08:01:09] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-06-01 08:01:09] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-06-01 08:01:09] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-06-01 08:01:10] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-06-01 08:01:10] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 2 ms to minimize.
[2024-06-01 08:01:11] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 3 ms to minimize.
[2024-06-01 08:01:11] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-06-01 08:01:11] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 3 ms to minimize.
[2024-06-01 08:01:12] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-06-01 08:01:12] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 3 ms to minimize.
[2024-06-01 08:01:13] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 3 ms to minimize.
[2024-06-01 08:01:13] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30019 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60356ms
Finished structural reductions in LTL mode , in 1 iterations and 61854 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 172 ms :[p1, p1, p1, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLCardinality-06
Stuttering criterion allowed to conclude after 1999 steps with 0 reset in 23 ms.
FORMULA ShieldIIPs-PT-040A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLCardinality-06 finished in 62075 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(F(p0)))))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 14 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-06-01 08:01:16] [INFO ] Invariant cache hit.
[2024-06-01 08:01:17] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-06-01 08:01:17] [INFO ] Invariant cache hit.
[2024-06-01 08:01:18] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 08:01:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
(s984 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 1.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 1.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 1.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 0.0)
(s641 1.0)
(s642 0.0)
(s643 1.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 0.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 1.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 1.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 1.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 1.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 1.0)
(s733 0.0)
(s734 1.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 1.0)
(s742 0.0)
(s743 1.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 1.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 1.0)
(s752 0.0)
(s753 1.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 1.0)
(s758 0.0)
(s759 1.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 1.0)
(s764 0.0)
(s765 0.0)
(s766 1.0)
(s767 0.0)
(s768 1.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 1.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 0.0)
(s778 1.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 1.0)
(s783 0.0)
(s784 1.0)
(s785 0.0)
(s786 1.0)
(s787 0.0)
(s788 1.0)
(s789 0.0)
(s790 0.0)
(s791 1.0)
(s792 0.0)
(s793 1.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 1.0)
(s798 0.0)
(s799 0.0)
(s800 1.0)
(s801 0.0)
(s802 0.0)
(s803 1.0)
(s804 0.0)
(s805 1.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 1.0)
(s812 0.0)
(s813 1.0)
(s814 0.0)
(s815 1.0)
(s816 0.0)
(s817 0.0)
(s818 1.0)
(s819 0.0)
(s820 0.0)
(s821 1.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 1.0)
(s828 1.0)
(s829 0.0)
(s830 1.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 1.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 1.0)
(s844 0.0)
(s845 0.0)
(s846 1.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 1.0)
(s853 1.0)
(s854 0.0)
(s855 1.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 1.0)
(s862 0.0)
(s863 1.0)
(s864 0.0)
(s865 1.0)
(s866 0.0)
(s867 0.0)
(s868 1.0)
(s869 0.0)
(s870 0.0)
(s871 1.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 1.0)
(s878 1.0)
(s879 0.0)
(s880 1.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 1.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 0.0)
(s893 1.0)
(s894 0.0)
(s895 0.0)
(s896 1.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 1.0)
(s903 1.0)
(s904 0.0)
(s905 1.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 1.0)
(s912 0.0)
(s913 1.0)
(s914 0.0)
(s915 1.0)
(s916 0.0)
(s917 0.0)
(s918 1.0)
(s919 0.0)
(s920 0.0)
(s921 1.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 1.0)
(s928 1.0)
(s929 0.0)
(s930 1.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 1.0)
(s937 0.0)
(s938 1.0)
(s939 0.0)
(s940 1.0)
(s941 0.0)
(s942 0.0)
(s943 1.0)
(s944 0.0)
(s945 0.0)
(s946 1.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 1.0)
(s953 1.0)
(s954 0.0)
(s955 1.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 1.0)
(s962 0.0)
(s963 1.0)
(s964 0.0)
(s965 1.0)
(s966 0.0)
(s967 0.0)
(s968 1.0)
(s969 0.0)
(s970 0.0)
(s971 1.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 1.0)
(s978 1.0)
(s979 0.0)
(s980 1.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30026 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:02:02] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:02:02] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:02:03] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:02:03] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:02:03] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:02:03] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:02:03] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:02:03] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:02:04] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:02:04] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:02:04] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:02:04] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:02:05] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:02:05] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:02:05] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:02:05] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-06-01 08:02:05] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-06-01 08:02:06] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-06-01 08:02:06] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:02:06] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:02:09] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:02:09] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:02:10] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:02:10] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-06-01 08:02:10] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-06-01 08:02:11] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-01 08:02:11] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-01 08:02:11] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:02:12] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
[2024-06-01 08:02:12] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 3 ms to minimize.
[2024-06-01 08:02:12] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-06-01 08:02:13] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-06-01 08:02:13] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-06-01 08:02:14] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-06-01 08:02:14] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 3 ms to minimize.
[2024-06-01 08:02:14] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 3 ms to minimize.
[2024-06-01 08:02:15] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 3 ms to minimize.
[2024-06-01 08:02:15] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 4 ms to minimize.
[2024-06-01 08:02:16] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30022 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60324ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Finished structural reductions in LTL mode , in 1 iterations and 61923 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 1776 ms.
Product exploration explored 100000 steps with 25000 reset in 1825 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 8525 steps (2 resets) in 100 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 17 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-06-01 08:02:22] [INFO ] Invariant cache hit.
[2024-06-01 08:02:23] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-06-01 08:02:23] [INFO ] Invariant cache hit.
[2024-06-01 08:02:24] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 08:02:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30025 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:03:10] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:03:10] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:03:10] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:03:10] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:03:10] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:03:10] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:03:11] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:03:11] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:03:11] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:03:11] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-01 08:03:12] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:03:12] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-06-01 08:03:12] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 08:03:12] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-06-01 08:03:13] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 08:03:13] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 08:03:13] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2024-06-01 08:03:13] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:03:14] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-06-01 08:03:14] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:03:17] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:03:17] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:03:18] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:03:18] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 08:03:18] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-06-01 08:03:18] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-06-01 08:03:19] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-06-01 08:03:19] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-01 08:03:20] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:03:20] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-06-01 08:03:20] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-06-01 08:03:21] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:03:21] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-06-01 08:03:21] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-06-01 08:03:22] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 3 ms to minimize.
[2024-06-01 08:03:22] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-06-01 08:03:23] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 4 ms to minimize.
[2024-06-01 08:03:23] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 3 ms to minimize.
[2024-06-01 08:03:23] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 3 ms to minimize.
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 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30020 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60299ms
Finished structural reductions in LTL mode , in 1 iterations and 61818 ms. Remains : 1003/1003 places, 963/963 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]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 15990 steps (5 resets) in 172 ms. (92 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1709 ms.
Product exploration explored 100000 steps with 25000 reset in 1819 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 2 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 2 rules applied. Total rules applied 2 place count 1003 transition count 963
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 103 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-06-01 08:03:29] [INFO ] Redundant transitions in 94 ms returned [955]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 961 sub problems to find dead transitions.
// Phase 1: matrix 962 rows 1003 cols
[2024-06-01 08:03:29] [INFO ] Computed 361 invariants in 4 ms
[2024-06-01 08:03:29] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1965 variables, and 1364 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30021 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-06-01 08:04:14] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-01 08:04:15] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 08:04:16] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-06-01 08:04:17] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:04:17] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2024-06-01 08:04:17] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 08:04:18] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2024-06-01 08:04:18] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 08:04:21] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:04:21] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-06-01 08:04:21] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 3 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 3 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
[2024-06-01 08:04:25] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 3 ms to minimize.
[2024-06-01 08:04:25] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 3 ms to minimize.
[2024-06-01 08:04:26] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:04:26] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 3 ms to minimize.
[2024-06-01 08:04:26] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 3 ms to minimize.
[2024-06-01 08:04:27] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 3 ms to minimize.
[2024-06-01 08:04:27] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 3 ms to minimize.
[2024-06-01 08:04:28] [INFO ] Deduced a trap composed of 2 places in 219 ms of which 4 ms to minimize.
Problem TDEAD278 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1003 variables, 20/1404 constraints. Problems are: Problem set: 1 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1965 variables, and 1404 constraints, problems are : Problem set: 1 solved, 960 unsolved in 30025 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 40/40 constraints]
After SMT, in 60342ms problems are : Problem set: 1 solved, 960 unsolved
Search for dead transitions found 1 dead transitions in 60353ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1003 places, 961/963 transitions.
Graph (complete) has 3520 edges and 1003 vertex of which 1002 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 52 ms. Remains 1002 /1003 variables (removed 1) and now considering 961/961 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1002/1003 places, 961/963 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60617 ms. Remains : 1002/1003 places, 961/963 transitions.
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 36 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-06-01 08:04:30] [INFO ] Computed 361 invariants in 11 ms
[2024-06-01 08:04:30] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-06-01 08:04:30] [INFO ] Invariant cache hit.
[2024-06-01 08:04:31] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1714 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 08:04:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30023 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:05:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:05:16] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:05:16] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:05:16] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:05:16] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:05:17] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:05:17] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:05:17] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 08:05:17] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:05:17] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:05:18] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-06-01 08:05:18] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:05:18] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-06-01 08:05:18] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:05:23] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:05:23] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 2 ms to minimize.
[2024-06-01 08:05:27] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-06-01 08:05:27] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 3 ms to minimize.
[2024-06-01 08:05:27] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-06-01 08:05:28] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 5 ms to minimize.
[2024-06-01 08:05:28] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 3 ms to minimize.
[2024-06-01 08:05:29] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 4 ms to minimize.
[2024-06-01 08:05:29] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 4 ms to minimize.
[2024-06-01 08:05:30] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30025 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60343ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Finished structural reductions in LTL mode , in 1 iterations and 62108 ms. Remains : 1003/1003 places, 963/963 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLCardinality-07 finished in 255698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((p1&&X(p2))))))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 18 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-06-01 08:05:32] [INFO ] Invariant cache hit.
[2024-06-01 08:05:32] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-06-01 08:05:32] [INFO ] Invariant cache hit.
[2024-06-01 08:05:34] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 08:05:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30022 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:06:18] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:06:18] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:06:18] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:06:19] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:06:19] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:06:19] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:06:19] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:06:19] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:06:19] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:06:20] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:06:20] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:06:20] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:06:20] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:06:21] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:06:21] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 08:06:21] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:06:21] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:06:21] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:06:22] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:06:22] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:06:25] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-06-01 08:06:25] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-06-01 08:06:25] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-06-01 08:06:26] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:06:26] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-06-01 08:06:26] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
[2024-06-01 08:06:27] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-06-01 08:06:27] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:06:27] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2024-06-01 08:06:28] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-06-01 08:06:28] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 2 ms to minimize.
[2024-06-01 08:06:29] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 3 ms to minimize.
[2024-06-01 08:06:29] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-06-01 08:06:29] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-06-01 08:06:30] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 4 ms to minimize.
[2024-06-01 08:06:30] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 4 ms to minimize.
[2024-06-01 08:06:31] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 3 ms to minimize.
[2024-06-01 08:06:31] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 4 ms to minimize.
[2024-06-01 08:06:31] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30018 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60312ms
Finished structural reductions in LTL mode , in 1 iterations and 61998 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 1 ms.
FORMULA ShieldIIPs-PT-040A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLCardinality-10 finished in 62307 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)))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-06-01 08:06:34] [INFO ] Invariant cache hit.
[2024-06-01 08:06:35] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-06-01 08:06:35] [INFO ] Invariant cache hit.
[2024-06-01 08:06:36] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 08:06:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30024 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:07:27] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:07:27] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:07:28] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-06-01 08:07:28] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:07:28] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-06-01 08:07:29] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-06-01 08:07:29] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-06-01 08:07:29] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 2 ms to minimize.
[2024-06-01 08:07:30] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-06-01 08:07:30] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
[2024-06-01 08:07:30] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-06-01 08:07:31] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-06-01 08:07:31] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-06-01 08:07:31] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
[2024-06-01 08:07:32] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 3 ms to minimize.
[2024-06-01 08:07:32] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:07:33] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 3 ms to minimize.
[2024-06-01 08:07:33] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 4 ms to minimize.
[2024-06-01 08:07:34] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 3 ms to minimize.
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 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30021 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60330ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60341ms
Finished structural reductions in LTL mode , in 1 iterations and 61993 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 185 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-040A-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLCardinality-11 finished in 62109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 16 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-06-01 08:07:36] [INFO ] Invariant cache hit.
[2024-06-01 08:07:37] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-06-01 08:07:37] [INFO ] Invariant cache hit.
[2024-06-01 08:07:38] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 08:07:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30024 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:08:22] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:08:22] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:08:22] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:08:22] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:08:22] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:08:23] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:08:23] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:08:23] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:08:23] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:08:23] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:08:24] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-01 08:08:24] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:08:24] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:08:24] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:08:24] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 08:08:25] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 08:08:25] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:08:25] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-06-01 08:08:26] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 08:08:26] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:08:29] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:08:29] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:08:29] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:08:30] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 08:08:30] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 08:08:30] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-06-01 08:08:31] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-06-01 08:08:31] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
[2024-06-01 08:08:31] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-06-01 08:08:32] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
[2024-06-01 08:08:32] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-06-01 08:08:32] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
[2024-06-01 08:08:33] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-06-01 08:08:33] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2024-06-01 08:08:34] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:08:34] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
[2024-06-01 08:08:34] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:08:35] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 3 ms to minimize.
[2024-06-01 08:08:35] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30024 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60310ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60320ms
Finished structural reductions in LTL mode , in 1 iterations and 61953 ms. Remains : 1003/1003 places, 963/963 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLCardinality-13
Product exploration explored 100000 steps with 99 reset in 816 ms.
Product exploration explored 100000 steps with 100 reset in 953 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4059 steps (0 resets) in 63 ms. (63 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 08:08:41] [INFO ] Invariant cache hit.
[2024-06-01 08:08:41] [INFO ] [Real]Absence check using 361 positive place invariants in 172 ms returned sat
[2024-06-01 08:08:43] [INFO ] [Real]Absence check using state equation in 1973 ms returned sat
[2024-06-01 08:08:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:08:44] [INFO ] [Nat]Absence check using 361 positive place invariants in 148 ms returned sat
[2024-06-01 08:08:46] [INFO ] [Nat]Absence check using state equation in 2042 ms returned sat
[2024-06-01 08:08:46] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 49 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 08:08:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 12 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-06-01 08:08:59] [INFO ] Invariant cache hit.
[2024-06-01 08:08:59] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-06-01 08:08:59] [INFO ] Invariant cache hit.
[2024-06-01 08:09:00] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 08:09:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30025 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:09:44] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:09:45] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:09:45] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:09:45] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 08:09:45] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:09:45] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:09:46] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:09:46] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:09:46] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:09:46] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:09:46] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:09:47] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:09:47] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:09:47] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:09:47] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 08:09:47] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:09:48] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:09:48] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:09:48] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:09:49] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:09:52] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 08:09:52] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-01 08:09:52] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-01 08:09:53] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 5 ms to minimize.
[2024-06-01 08:09:54] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-06-01 08:09:55] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-06-01 08:09:55] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 3 ms to minimize.
[2024-06-01 08:09:55] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 3 ms to minimize.
[2024-06-01 08:09:56] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 3 ms to minimize.
[2024-06-01 08:09:56] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 4 ms to minimize.
[2024-06-01 08:09:56] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
[2024-06-01 08:09:57] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 3 ms to minimize.
[2024-06-01 08:09:57] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 4 ms to minimize.
[2024-06-01 08:09:58] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 3 ms to minimize.
[2024-06-01 08:09:58] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 1)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 1)
(s361 0)
(s362 1)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 1)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 1)
(s386 0)
(s387 1)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 1)
(s411 0)
(s412 1)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 1)
(s436 0)
(s437 1)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 0)
(s443 1)
(s444 0)
(s445 1)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30027 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60351ms
Finished structural reductions in LTL mode , in 1 iterations and 61928 ms. Remains : 1003/1003 places, 963/963 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3953 steps (0 resets) in 56 ms. (69 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 08:10:01] [INFO ] Invariant cache hit.
[2024-06-01 08:10:02] [INFO ] [Real]Absence check using 361 positive place invariants in 190 ms returned sat
[2024-06-01 08:10:04] [INFO ] [Real]Absence check using state equation in 2011 ms returned sat
[2024-06-01 08:10:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:05] [INFO ] [Nat]Absence check using 361 positive place invariants in 154 ms returned sat
[2024-06-01 08:10:07] [INFO ] [Nat]Absence check using state equation in 2254 ms returned sat
[2024-06-01 08:10:07] [INFO ] Computed and/alt/rep : 884/3063/884 causal constraints (skipped 78 transitions) in 52 ms.
[2024-06-01 08:10:19] [INFO ] Added : 650 causal constraints over 130 iterations in 11970 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 99 reset in 772 ms.
Product exploration explored 100000 steps with 98 reset in 925 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 2 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 2 rules applied. Total rules applied 2 place count 1003 transition count 963
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 48 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-06-01 08:10:21] [INFO ] Redundant transitions in 183 ms returned [955]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 961 sub problems to find dead transitions.
// Phase 1: matrix 962 rows 1003 cols
[2024-06-01 08:10:21] [INFO ] Computed 361 invariants in 3 ms
[2024-06-01 08:10:21] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1965 variables, and 1364 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30017 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 08:11:05] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:11:06] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:11:06] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:11:06] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:11:06] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-06-01 08:11:06] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:11:07] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:11:07] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:11:07] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:11:07] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:11:07] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:11:08] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:11:08] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:11:08] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:11:08] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 08:11:08] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-01 08:11:09] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 08:11:09] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:11:09] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:11:10] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-06-01 08:11:13] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:11:13] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:11:13] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-01 08:11:13] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-06-01 08:11:14] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
[2024-06-01 08:11:14] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-06-01 08:11:14] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 2 ms to minimize.
[2024-06-01 08:11:15] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-06-01 08:11:15] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-06-01 08:11:15] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-06-01 08:11:16] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
[2024-06-01 08:11:17] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 4 ms to minimize.
[2024-06-01 08:11:18] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 5 ms to minimize.
[2024-06-01 08:11:18] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 4 ms to minimize.
[2024-06-01 08:11:19] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 4 ms to minimize.
[2024-06-01 08:11:19] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 3 ms to minimize.
[2024-06-01 08:11:19] [INFO ] Deduced a trap composed of 2 places in 207 ms of which 4 ms to minimize.
Problem TDEAD278 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1003 variables, 20/1404 constraints. Problems are: Problem set: 1 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1965 variables, and 1404 constraints, problems are : Problem set: 1 solved, 960 unsolved in 30026 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 40/40 constraints]
After SMT, in 60353ms problems are : Problem set: 1 solved, 960 unsolved
Search for dead transitions found 1 dead transitions in 60362ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1003 places, 961/963 transitions.
Graph (complete) has 3520 edges and 1003 vertex of which 1002 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 1 rules in 36 ms. Remains 1002 /1003 variables (removed 1) and now considering 961/961 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1002/1003 places, 961/963 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60637 ms. Remains : 1002/1003 places, 961/963 transitions.
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 10 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-06-01 08:11:22] [INFO ] Computed 361 invariants in 9 ms
[2024-06-01 08:11:22] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-06-01 08:11:22] [INFO ] Invariant cache hit.
[2024-06-01 08:11:23] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-06-01 08:11:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1966 variables, and 1364 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30022 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1002 variables, 1002/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1002 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (OVERLAPS) 1/1003 variables, 361/1363 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 1/1364 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:12:07] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:12:08] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:12:08] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:12:08] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:12:08] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-06-01 08:12:08] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:12:08] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:12:09] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:12:09] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:12:09] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:12:09] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-06-01 08:12:10] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:12:10] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:12:10] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 08:12:10] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2024-06-01 08:12:11] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-06-01 08:12:11] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2024-06-01 08:12:11] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:12:11] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-06-01 08:12:12] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/1384 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-06-01 08:12:15] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 08:12:15] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:12:15] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:12:16] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 3 ms to minimize.
[2024-06-01 08:12:16] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 3 ms to minimize.
[2024-06-01 08:12:16] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 3 ms to minimize.
[2024-06-01 08:12:17] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-06-01 08:12:17] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-06-01 08:12:17] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
[2024-06-01 08:12:18] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 3 ms to minimize.
[2024-06-01 08:12:18] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 3 ms to minimize.
[2024-06-01 08:12:18] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 3 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
[2024-06-01 08:12:19] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 4 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 3 ms to minimize.
[2024-06-01 08:12:20] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 3 ms to minimize.
[2024-06-01 08:12:21] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 3 ms to minimize.
[2024-06-01 08:12:21] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1966 variables, and 1403 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30020 ms.
Refiners :[Domain max(s): 1003/1003 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 39/39 constraints]
After SMT, in 60276ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Finished structural reductions in LTL mode , in 1 iterations and 61935 ms. Remains : 1003/1003 places, 963/963 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLCardinality-13 finished in 287322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 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 1003 transition count 962
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 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 65 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-06-01 08:12:24] [INFO ] Computed 361 invariants in 7 ms
[2024-06-01 08:12:24] [INFO ] Implicit Places using invariants in 512 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 516 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 603 ms. Remains : 1000/1003 places, 961/963 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040A-LTLCardinality-14
Stuttering criterion allowed to conclude after 2164 steps with 0 reset in 21 ms.
FORMULA ShieldIIPs-PT-040A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040A-LTLCardinality-14 finished in 683 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)))'
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(F(p0)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-040A-LTLCardinality-07
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Reduce places removed 1 places and 1 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 1002 transition count 961
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
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 5 place count 999 transition count 960
Applied a total of 5 rules in 51 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
// Phase 1: matrix 960 rows 999 cols
[2024-06-01 08:12:25] [INFO ] Computed 360 invariants in 9 ms
[2024-06-01 08:12:25] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-06-01 08:12:25] [INFO ] Invariant cache hit.
[2024-06-01 08:12:26] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
Running 959 sub problems to find dead transitions.
[2024-06-01 08:12:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:12:40] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:12:40] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:12:40] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:12:40] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:12:40] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:12:41] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:12:41] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:12:41] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:12:41] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:12:41] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:12:42] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:12:42] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:12:42] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:12:42] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:12:42] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:12:43] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:12:43] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:12:43] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:12:44] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2024-06-01 08:12:44] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:12:47] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:12:47] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:12:47] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-06-01 08:12:48] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:12:48] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-06-01 08:12:48] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
[2024-06-01 08:12:49] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-06-01 08:12:49] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-06-01 08:12:49] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-06-01 08:12:50] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 3 ms to minimize.
[2024-06-01 08:12:50] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 3 ms to minimize.
[2024-06-01 08:12:50] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-06-01 08:12:51] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 3 ms to minimize.
[2024-06-01 08:12:51] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 3 ms to minimize.
[2024-06-01 08:12:51] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:12:52] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 4 ms to minimize.
[2024-06-01 08:12:52] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 3 ms to minimize.
[2024-06-01 08:12:53] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 4 ms to minimize.
[2024-06-01 08:12:53] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1959 variables, and 1398 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30021 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:13:02] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-06-01 08:13:14] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 2/1400 constraints. Problems are: Problem set: 0 solved, 959 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 999/1959 variables, and 1400 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30017 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 41/41 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Starting structural reductions in LI_LTL mode, iteration 1 : 999/1003 places, 960/963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61819 ms. Remains : 999/1003 places, 960/963 transitions.
Running random walk in product with property : ShieldIIPs-PT-040A-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 664 ms.
Product exploration explored 100000 steps with 25000 reset in 781 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 16960 steps (6 resets) in 159 ms. (106 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 960/960 transitions.
Applied a total of 0 rules in 15 ms. Remains 999 /999 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2024-06-01 08:13:29] [INFO ] Invariant cache hit.
[2024-06-01 08:13:29] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-06-01 08:13:29] [INFO ] Invariant cache hit.
[2024-06-01 08:13:30] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
Running 959 sub problems to find dead transitions.
[2024-06-01 08:13:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:13:44] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:13:44] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:13:45] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:13:45] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:13:45] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:13:45] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:13:45] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:13:46] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:13:46] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-06-01 08:13:46] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:13:46] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:13:46] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:13:47] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:13:47] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-06-01 08:13:47] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:13:47] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:13:48] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-06-01 08:13:48] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:13:48] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-06-01 08:13:48] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:13:52] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:13:52] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:13:52] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:13:52] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:13:53] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 3 ms to minimize.
[2024-06-01 08:13:53] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:13:53] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-01 08:13:54] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-06-01 08:13:54] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 3 ms to minimize.
[2024-06-01 08:13:54] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 2 ms to minimize.
[2024-06-01 08:13:55] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 2 ms to minimize.
[2024-06-01 08:13:55] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-06-01 08:13:55] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 2 ms to minimize.
[2024-06-01 08:13:56] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 3 ms to minimize.
[2024-06-01 08:13:56] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 4 ms to minimize.
[2024-06-01 08:13:57] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:13:57] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 4 ms to minimize.
[2024-06-01 08:13:57] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 4 ms to minimize.
[2024-06-01 08:13:58] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1959 variables, and 1398 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30020 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:14:06] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-06-01 08:14:18] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 2/1400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 1)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 1)
(s153 0)
timeout
(s154 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1959 variables, and 1400 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30019 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 41/41 constraints]
After SMT, in 60235ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Finished structural reductions in LTL mode , in 1 iterations and 61734 ms. Remains : 999/999 places, 960/960 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 16947 steps (6 resets) in 154 ms. (109 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 654 ms.
Product exploration explored 100000 steps with 25000 reset in 768 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 960/960 transitions.
Applied a total of 0 rules in 21 ms. Remains 999 /999 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2024-06-01 08:14:33] [INFO ] Redundant transitions in 94 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 958 sub problems to find dead transitions.
// Phase 1: matrix 959 rows 999 cols
[2024-06-01 08:14:33] [INFO ] Computed 360 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 08:14:47] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:14:47] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:14:47] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-06-01 08:14:47] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:14:48] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:14:48] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:14:48] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:14:48] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-06-01 08:14:48] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:14:49] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:14:49] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:14:49] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:14:49] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-06-01 08:14:50] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:14:50] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:14:50] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:14:50] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:14:51] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-06-01 08:14:51] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-06-01 08:14:51] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 08:14:54] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-06-01 08:14:55] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
[2024-06-01 08:14:55] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:14:55] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-06-01 08:14:56] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-06-01 08:14:56] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-06-01 08:14:56] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-06-01 08:14:57] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-06-01 08:14:57] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 8 ms to minimize.
[2024-06-01 08:14:57] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:14:58] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 3 ms to minimize.
[2024-06-01 08:14:58] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 3 ms to minimize.
[2024-06-01 08:14:58] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 3 ms to minimize.
[2024-06-01 08:14:59] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 3 ms to minimize.
[2024-06-01 08:14:59] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 3 ms to minimize.
[2024-06-01 08:15:00] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-06-01 08:15:00] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 3 ms to minimize.
[2024-06-01 08:15:00] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 3 ms to minimize.
[2024-06-01 08:15:01] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 1.0)
(s210 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1958 variables, and 1398 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30023 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 08:15:20] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 1/1399 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1958 variables, and 1399 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30018 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 40/40 constraints]
After SMT, in 60242ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Starting structural reductions in SI_LTL mode, iteration 1 : 999/999 places, 959/960 transitions.
Applied a total of 0 rules in 17 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60397 ms. Remains : 999/999 places, 959/960 transitions.
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 960/960 transitions.
Applied a total of 0 rules in 10 ms. Remains 999 /999 variables (removed 0) and now considering 960/960 (removed 0) transitions.
// Phase 1: matrix 960 rows 999 cols
[2024-06-01 08:15:33] [INFO ] Computed 360 invariants in 6 ms
[2024-06-01 08:15:34] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-06-01 08:15:34] [INFO ] Invariant cache hit.
[2024-06-01 08:15:35] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
Running 959 sub problems to find dead transitions.
[2024-06-01 08:15:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:15:49] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:15:49] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:15:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:15:49] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:15:50] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:15:50] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:15:50] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 08:15:50] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:15:50] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:15:51] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:15:51] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:15:51] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:15:51] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:15:51] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:15:52] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-06-01 08:15:52] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:15:52] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-06-01 08:15:52] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-06-01 08:15:53] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-06-01 08:15:53] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:15:56] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:15:56] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:15:57] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-06-01 08:15:57] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:15:57] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 3 ms to minimize.
[2024-06-01 08:15:58] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:15:58] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-06-01 08:15:58] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-06-01 08:15:59] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:15:59] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 2 ms to minimize.
[2024-06-01 08:15:59] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-06-01 08:16:00] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-06-01 08:16:00] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-06-01 08:16:01] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 3 ms to minimize.
[2024-06-01 08:16:01] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 3 ms to minimize.
[2024-06-01 08:16:01] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 4 ms to minimize.
[2024-06-01 08:16:02] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 3 ms to minimize.
[2024-06-01 08:16:02] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 3 ms to minimize.
[2024-06-01 08:16:03] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1959 variables, and 1398 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30021 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:16:11] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 3 ms to minimize.
[2024-06-01 08:16:23] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 2/1400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1959 variables, and 1400 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30026 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 41/41 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Finished structural reductions in LTL mode , in 1 iterations and 61793 ms. Remains : 999/999 places, 960/960 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLCardinality-07 finished in 250759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ShieldIIPs-PT-040A-LTLCardinality-13
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Reduce places removed 1 places and 1 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 1002 transition count 961
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 961
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 5 place count 999 transition count 960
Applied a total of 5 rules in 48 ms. Remains 999 /1003 variables (removed 4) and now considering 960/963 (removed 3) transitions.
[2024-06-01 08:16:35] [INFO ] Invariant cache hit.
[2024-06-01 08:16:36] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-06-01 08:16:36] [INFO ] Invariant cache hit.
[2024-06-01 08:16:37] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
Running 959 sub problems to find dead transitions.
[2024-06-01 08:16:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:16:52] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:16:52] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:16:52] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:16:52] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:16:52] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:16:53] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:16:53] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:16:53] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:16:53] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:16:53] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:16:54] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:16:54] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:16:54] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-06-01 08:16:54] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:16:55] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-06-01 08:16:55] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-06-01 08:16:55] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-06-01 08:16:56] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-06-01 08:16:56] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-06-01 08:16:56] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:16:59] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:17:00] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:17:00] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 2 ms to minimize.
[2024-06-01 08:17:00] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 2 ms to minimize.
[2024-06-01 08:17:01] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 2 ms to minimize.
[2024-06-01 08:17:01] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:17:01] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 3 ms to minimize.
[2024-06-01 08:17:02] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-06-01 08:17:02] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-06-01 08:17:02] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-06-01 08:17:03] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-06-01 08:17:03] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-06-01 08:17:03] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-06-01 08:17:04] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 3 ms to minimize.
[2024-06-01 08:17:04] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 3 ms to minimize.
[2024-06-01 08:17:05] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-06-01 08:17:05] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 3 ms to minimize.
[2024-06-01 08:17:06] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 3 ms to minimize.
[2024-06-01 08:17:06] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1959 variables, and 1398 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30027 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:17:13] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 3 ms to minimize.
[2024-06-01 08:17:25] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 2/1400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1959 variables, and 1400 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30021 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 41/41 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in LI_LTL mode, iteration 1 : 999/1003 places, 960/963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61934 ms. Remains : 999/1003 places, 960/963 transitions.
Running random walk in product with property : ShieldIIPs-PT-040A-LTLCardinality-13
Product exploration explored 100000 steps with 100 reset in 795 ms.
Product exploration explored 100000 steps with 99 reset in 947 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3901 steps (0 resets) in 51 ms. (75 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 08:17:40] [INFO ] Invariant cache hit.
[2024-06-01 08:17:40] [INFO ] [Real]Absence check using 360 positive place invariants in 180 ms returned sat
[2024-06-01 08:17:43] [INFO ] [Real]Absence check using state equation in 2208 ms returned sat
[2024-06-01 08:17:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:17:43] [INFO ] [Nat]Absence check using 360 positive place invariants in 143 ms returned sat
[2024-06-01 08:17:45] [INFO ] [Nat]Absence check using state equation in 1920 ms returned sat
[2024-06-01 08:17:45] [INFO ] Computed and/alt/rep : 959/2392/959 causal constraints (skipped 0 transitions) in 61 ms.
Could not prove EG (NOT p0)
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 960/960 transitions.
Applied a total of 0 rules in 10 ms. Remains 999 /999 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2024-06-01 08:17:58] [INFO ] Invariant cache hit.
[2024-06-01 08:17:58] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-06-01 08:17:58] [INFO ] Invariant cache hit.
[2024-06-01 08:17:59] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
Running 959 sub problems to find dead transitions.
[2024-06-01 08:17:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:18:14] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:18:14] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:18:14] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:18:14] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:18:14] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:18:15] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:18:15] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:18:15] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:18:15] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-06-01 08:18:15] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:18:16] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:18:16] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:18:16] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-06-01 08:18:16] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:18:16] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-06-01 08:18:17] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:18:17] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:18:17] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:18:17] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:18:18] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:18:21] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:18:21] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-06-01 08:18:21] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:18:22] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 3 ms to minimize.
[2024-06-01 08:18:22] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-06-01 08:18:22] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-06-01 08:18:23] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-06-01 08:18:23] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-06-01 08:18:23] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 3 ms to minimize.
[2024-06-01 08:18:24] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 2 ms to minimize.
[2024-06-01 08:18:24] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 2 ms to minimize.
[2024-06-01 08:18:24] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-06-01 08:18:25] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 3 ms to minimize.
[2024-06-01 08:18:25] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 3 ms to minimize.
[2024-06-01 08:18:25] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 3 ms to minimize.
[2024-06-01 08:18:26] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-06-01 08:18:26] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 3 ms to minimize.
[2024-06-01 08:18:27] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
[2024-06-01 08:18:27] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1959 variables, and 1398 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30019 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:18:35] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-06-01 08:18:47] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 2/1400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1959 variables, and 1400 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30026 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 41/41 constraints]
After SMT, in 60242ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Finished structural reductions in LTL mode , in 1 iterations and 61829 ms. Remains : 999/999 places, 960/960 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3977 steps (0 resets) in 47 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 08:19:00] [INFO ] Invariant cache hit.
[2024-06-01 08:19:01] [INFO ] [Real]Absence check using 360 positive place invariants in 176 ms returned sat
[2024-06-01 08:19:03] [INFO ] [Real]Absence check using state equation in 2216 ms returned sat
[2024-06-01 08:19:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:19:04] [INFO ] [Nat]Absence check using 360 positive place invariants in 144 ms returned sat
[2024-06-01 08:19:06] [INFO ] [Nat]Absence check using state equation in 1942 ms returned sat
[2024-06-01 08:19:06] [INFO ] Computed and/alt/rep : 959/2392/959 causal constraints (skipped 0 transitions) in 53 ms.
[2024-06-01 08:19:18] [INFO ] Added : 475 causal constraints over 95 iterations in 12271 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 101 reset in 788 ms.
Product exploration explored 100000 steps with 101 reset in 953 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 960/960 transitions.
Applied a total of 0 rules in 27 ms. Remains 999 /999 variables (removed 0) and now considering 960/960 (removed 0) transitions.
[2024-06-01 08:19:20] [INFO ] Redundant transitions in 104 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 958 sub problems to find dead transitions.
// Phase 1: matrix 959 rows 999 cols
[2024-06-01 08:19:20] [INFO ] Computed 360 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:19:35] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:19:36] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:19:36] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:19:36] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:19:36] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-06-01 08:19:36] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:19:37] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:19:37] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:19:37] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-06-01 08:19:37] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:19:38] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:19:38] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-06-01 08:19:38] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2024-06-01 08:19:38] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:19:39] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 08:19:42] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:19:42] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-06-01 08:19:43] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-06-01 08:19:43] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-06-01 08:19:43] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 3 ms to minimize.
[2024-06-01 08:19:43] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-06-01 08:19:44] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 3 ms to minimize.
[2024-06-01 08:19:44] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2024-06-01 08:19:44] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-06-01 08:19:45] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 2 ms to minimize.
[2024-06-01 08:19:45] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-06-01 08:19:46] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-06-01 08:19:46] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-06-01 08:19:46] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:19:47] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 3 ms to minimize.
[2024-06-01 08:19:47] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 4 ms to minimize.
[2024-06-01 08:19:48] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 4 ms to minimize.
[2024-06-01 08:19:48] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 4 ms to minimize.
[2024-06-01 08:19:48] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1958 variables, and 1398 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30029 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-06-01 08:20:08] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 1/1399 constraints. Problems are: Problem set: 0 solved, 958 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 999/1958 variables, and 1399 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30019 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 40/40 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Starting structural reductions in SI_LTL mode, iteration 1 : 999/999 places, 959/960 transitions.
Applied a total of 0 rules in 17 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60405 ms. Remains : 999/999 places, 959/960 transitions.
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 960/960 transitions.
Applied a total of 0 rules in 10 ms. Remains 999 /999 variables (removed 0) and now considering 960/960 (removed 0) transitions.
// Phase 1: matrix 960 rows 999 cols
[2024-06-01 08:20:21] [INFO ] Computed 360 invariants in 5 ms
[2024-06-01 08:20:21] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-06-01 08:20:21] [INFO ] Invariant cache hit.
[2024-06-01 08:20:22] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
Running 959 sub problems to find dead transitions.
[2024-06-01 08:20:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:20:36] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:20:36] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:20:36] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:20:36] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:20:37] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:20:37] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2024-06-01 08:20:37] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:20:37] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2024-06-01 08:20:37] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:20:38] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:20:38] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-06-01 08:20:38] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-06-01 08:20:38] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:20:39] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:20:39] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-06-01 08:20:39] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:20:39] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:20:40] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 2 ms to minimize.
[2024-06-01 08:20:40] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:20:40] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/1379 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:20:44] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:20:44] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:20:44] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 2 ms to minimize.
[2024-06-01 08:20:45] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-06-01 08:20:45] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-06-01 08:20:45] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
[2024-06-01 08:20:45] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-06-01 08:20:46] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-06-01 08:20:46] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 3 ms to minimize.
[2024-06-01 08:20:47] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
[2024-06-01 08:20:47] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-06-01 08:20:47] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-06-01 08:20:48] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:20:48] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 3 ms to minimize.
[2024-06-01 08:20:49] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 3 ms to minimize.
[2024-06-01 08:20:49] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 4 ms to minimize.
[2024-06-01 08:20:49] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 3 ms to minimize.
[2024-06-01 08:20:50] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 3 ms to minimize.
[2024-06-01 08:20:50] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1959 variables, and 1398 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30021 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 999/999 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 360/1359 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 39/1398 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-06-01 08:20:59] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-06-01 08:21:12] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 2/1400 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1959 variables, and 1400 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30030 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 41/41 constraints]
After SMT, in 60243ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Finished structural reductions in LTL mode , in 1 iterations and 61837 ms. Remains : 999/999 places, 960/960 transitions.
Treatment of property ShieldIIPs-PT-040A-LTLCardinality-13 finished in 287311 ms.
[2024-06-01 08:21:22] [INFO ] Flatten gal took : 78 ms
[2024-06-01 08:21:23] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 18 ms.
[2024-06-01 08:21:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1003 places, 963 transitions and 4326 arcs took 10 ms.
Total runtime 1695673 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ShieldIIPs-PT-040A-LTLCardinality-03
FORMULA ShieldIIPs-PT-040A-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldIIPs-PT-040A-LTLCardinality-13

BK_STOP 1717230778616

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPs-PT-040A-LTLCardinality-03
ltl formula formula --ltl=/tmp/4884/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1003 places, 963 transitions and 4326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.020 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4884/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4884/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4884/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4884/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1004, there are 968 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1856 levels ~10000 states ~69864 transitions
pnml2lts-mc( 1/ 4): ~1856 levels ~20000 states ~95012 transitions
pnml2lts-mc( 1/ 4): ~1856 levels ~40000 states ~157672 transitions
pnml2lts-mc( 1/ 4): ~1856 levels ~80000 states ~280328 transitions
pnml2lts-mc( 1/ 4): ~1860 levels ~160000 states ~532588 transitions
pnml2lts-mc( 3/ 4): ~2077 levels ~320000 states ~1131940 transitions
pnml2lts-mc( 0/ 4): ~1939 levels ~640000 states ~2243736 transitions
pnml2lts-mc( 0/ 4): ~1939 levels ~1280000 states ~4722948 transitions
pnml2lts-mc( 3/ 4): ~2077 levels ~2560000 states ~10024196 transitions
pnml2lts-mc( 0/ 4): ~1955 levels ~5120000 states ~19913456 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6687174
pnml2lts-mc( 0/ 4): unique states count: 6694833
pnml2lts-mc( 0/ 4): unique transitions count: 26955704
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 20190801
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6694846
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7743
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6694846 states 26955727 transitions, fanout: 4.026
pnml2lts-mc( 0/ 4): Total exploration time 209.110 sec (209.060 sec minimum, 209.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32016, Transitions per second: 128907
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 115.6MB, 17.9 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 993 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 115.6MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-040A-LTLCardinality-07
ltl formula formula --ltl=/tmp/4884/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1003 places, 963 transitions and 4326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.040 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4884/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4884/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4884/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4884/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1004, there are 970 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4
pnml2lts-mc( 0/ 4): unique states count: 4
pnml2lts-mc( 0/ 4): unique transitions count: 3
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 13
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13 states 16 transitions, fanout: 1.231
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 286.0 B/state, compr.: 7.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 993 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-040A-LTLCardinality-13
ltl formula formula --ltl=/tmp/4884/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1003 places, 963 transitions and 4326 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4884/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4884/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4884/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4884/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1004, there are 967 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~1017 levels ~10000 states ~49280 transitions
pnml2lts-mc( 0/ 4): ~1017 levels ~20000 states ~75288 transitions
pnml2lts-mc( 0/ 4): ~1037 levels ~40000 states ~123488 transitions
pnml2lts-mc( 0/ 4): ~1037 levels ~80000 states ~231228 transitions
pnml2lts-mc( 0/ 4): ~1037 levels ~160000 states ~474556 transitions
pnml2lts-mc( 0/ 4): ~1037 levels ~320000 states ~1020084 transitions
pnml2lts-mc( 1/ 4): ~1193 levels ~640000 states ~2125420 transitions
pnml2lts-mc( 0/ 4): ~1039 levels ~1280000 states ~4535332 transitions
pnml2lts-mc( 0/ 4): ~1039 levels ~2560000 states ~9193780 transitions
pnml2lts-mc( 3/ 4): ~1179 levels ~5120000 states ~19713044 transitions
pnml2lts-mc( 3/ 4): ~1179 levels ~10240000 states ~42175424 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 15839078
pnml2lts-mc( 0/ 4): unique states count: 15843572
pnml2lts-mc( 0/ 4): unique transitions count: 66074560
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 50191212
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 15843588
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4571
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15843588 states 66074593 transitions, fanout: 4.170
pnml2lts-mc( 0/ 4): Total exploration time 484.160 sec (484.150 sec minimum, 484.155 sec on average)
pnml2lts-mc( 0/ 4): States per second: 32724, Transitions per second: 136473
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 185.2MB, 12.2 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 47.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 993 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 185.2MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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