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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 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:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:17 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 426K 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-050A-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716912989065

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 16:16:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 16:16:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:16:30] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-28 16:16:30] [INFO ] Transformed 1253 places.
[2024-05-28 16:16:30] [INFO ] Transformed 1203 transitions.
[2024-05-28 16:16:30] [INFO ] Found NUPN structural information;
[2024-05-28 16:16:30] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-050A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 112 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:16:30] [INFO ] Computed 451 invariants in 33 ms
[2024-05-28 16:16:31] [INFO ] Implicit Places using invariants in 938 ms returned []
[2024-05-28 16:16:31] [INFO ] Invariant cache hit.
[2024-05-28 16:16:33] [INFO ] Implicit Places using invariants and state equation in 1582 ms returned []
Implicit Place search using SMT with State Equation took 2549 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:16:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30045 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:17:26] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 10 ms to minimize.
[2024-05-28 16:17:27] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:17:27] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
[2024-05-28 16:17:27] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:17:27] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:17:28] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:17:28] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:17:28] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:17:28] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:17:28] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:17:29] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:17:29] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:17:29] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-28 16:17:30] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:17:30] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:17:30] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:17:30] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:17:31] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:17:31] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:17:31] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30024 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60726ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60759ms
Finished structural reductions in LTL mode , in 1 iterations and 63448 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Support contains 25 out of 1253 places after structural reductions.
[2024-05-28 16:17:34] [INFO ] Flatten gal took : 193 ms
[2024-05-28 16:17:34] [INFO ] Flatten gal took : 100 ms
[2024-05-28 16:17:34] [INFO ] Input system was already deterministic with 1203 transitions.
Support contains 23 out of 1253 places (down from 25) after GAL structural reductions.
RANDOM walk for 40000 steps (12 resets) in 1621 ms. (24 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 468 ms. (85 steps per ms) remains 1/1 properties
[2024-05-28 16:17:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1239/1253 variables, 446/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1239/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:17:35] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:17:35] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:17:35] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 3/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1253 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1203/2456 variables, 1253/2960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:17:36] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 4 ms to minimize.
[2024-05-28 16:17:36] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 5 ms to minimize.
[2024-05-28 16:17:37] [INFO ] Deduced a trap composed of 18 places in 259 ms of which 4 ms to minimize.
[2024-05-28 16:17:37] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 4 ms to minimize.
[2024-05-28 16:17:37] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 4 ms to minimize.
[2024-05-28 16:17:37] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2456 variables, 6/2966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2456 variables, 0/2966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2456 variables, 0/2966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2456/2456 variables, and 2966 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2740 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1239/1253 variables, 446/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1239/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 9/1713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:17:38] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:17:38] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:17:38] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1253 variables, 3/1716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1253 variables, 0/1716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1203/2456 variables, 1253/2969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2456 variables, 1/2970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:17:39] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:17:39] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2456 variables, 2/2972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2456 variables, 0/2972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2456 variables, 0/2972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2456/2456 variables, and 2972 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1409 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 4172ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 115311 steps, including 970 resets, run visited all 1 properties in 1078 ms. (steps per millisecond=106 )
Parikh walk visited 1 properties in 1087 ms.
FORMULA ShieldIIPs-PT-050A-LTLCardinality-10 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' '!(F(G(p0)))'
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1252 transition count 1201
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 1201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 1249 transition count 1200
Applied a total of 5 rules in 190 ms. Remains 1249 /1253 variables (removed 4) and now considering 1200/1203 (removed 3) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2024-05-28 16:17:41] [INFO ] Computed 450 invariants in 5 ms
[2024-05-28 16:17:41] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-05-28 16:17:41] [INFO ] Invariant cache hit.
[2024-05-28 16:17:43] [INFO ] Implicit Places using invariants and state equation in 1388 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2024-05-28 16:17:43] [INFO ] Redundant transitions in 200 ms returned [1194]
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 1198 sub problems to find dead transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2024-05-28 16:17:43] [INFO ] Computed 450 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:18:04] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:18:05] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:18:05] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:18:05] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:18:05] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:18:05] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-28 16:18:06] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:18:06] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:18:06] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:18:06] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:18:07] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:18:07] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:18:07] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:18:08] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:18:08] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:18:08] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:18:08] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 3 ms to minimize.
[2024-05-28 16:18:09] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:18:09] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:18:09] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:18:13] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 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 1249/2448 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30027 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 21/1720 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:18:18] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 4 ms to minimize.
[2024-05-28 16:18:19] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:18:19] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:18:19] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:18:20] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:18:20] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:18:20] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:18:21] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:18:21] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:18:21] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 2 ms to minimize.
[2024-05-28 16:18:22] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:18:22] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:18:23] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:18:23] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:18:23] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:18:24] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 4 ms to minimize.
[2024-05-28 16:18:24] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:18:25] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:18:25] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 3 ms to minimize.
[2024-05-28 16:18:26] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1740 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:18:34] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 4 ms to minimize.
[2024-05-28 16:18:34] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 4 ms to minimize.
[2024-05-28 16:18:35] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 4 ms to minimize.
[2024-05-28 16:18:35] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 4 ms to minimize.
[2024-05-28 16:18:36] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 3 ms to minimize.
[2024-05-28 16:18:36] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 4 ms to minimize.
[2024-05-28 16:18:37] [INFO ] Deduced a trap composed of 14 places in 249 ms of which 4 ms to minimize.
[2024-05-28 16:18:37] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/2448 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30023 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 49/49 constraints]
After SMT, in 60460ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/1253 places, 1199/1203 transitions.
Applied a total of 0 rules in 48 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62999 ms. Remains : 1249/1253 places, 1199/1203 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-00
Stuttering criterion allowed to conclude after 2425 steps with 0 reset in 43 ms.
FORMULA ShieldIIPs-PT-050A-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-00 finished in 63286 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 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 20 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:18:44] [INFO ] Computed 451 invariants in 5 ms
[2024-05-28 16:18:44] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-05-28 16:18:44] [INFO ] Invariant cache hit.
[2024-05-28 16:18:46] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 2256 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:18:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30023 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:19:39] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:19:39] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-28 16:19:40] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:19:40] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:19:40] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:19:40] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:19:41] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:19:41] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:19:41] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:19:41] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:19:42] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-28 16:19:42] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-28 16:19:42] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:19:42] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:19:43] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:19:43] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:19:43] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:19:43] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:19:44] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:19:44] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30025 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60409ms
Finished structural reductions in LTL mode , in 1 iterations and 62688 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 490 steps with 0 reset in 6 ms.
FORMULA ShieldIIPs-PT-050A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-03 finished in 62795 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))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 81 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:19:46] [INFO ] Computed 451 invariants in 4 ms
[2024-05-28 16:19:47] [INFO ] Implicit Places using invariants in 716 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 719 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 39 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 840 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-04
Product exploration explored 100000 steps with 48 reset in 1012 ms.
Product exploration explored 100000 steps with 49 reset in 1185 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
RANDOM walk for 7983 steps (0 resets) in 187 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[p0]
Stuttering acceptance computed with spot in 39 ms :[p0]
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:19:50] [INFO ] Computed 450 invariants in 12 ms
[2024-05-28 16:19:51] [INFO ] [Real]Absence check using 450 positive place invariants in 311 ms returned sat
[2024-05-28 16:19:55] [INFO ] [Real]Absence check using state equation in 3990 ms returned sat
[2024-05-28 16:19:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:19:56] [INFO ] [Nat]Absence check using 450 positive place invariants in 316 ms returned sat
[2024-05-28 16:20:00] [INFO ] [Nat]Absence check using state equation in 3570 ms returned sat
[2024-05-28 16:20:00] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 62 ms.
[2024-05-28 16:20:10] [INFO ] Added : 410 causal constraints over 82 iterations in 10137 ms. Result :unknown
Could not prove EG p0
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 40 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:20:10] [INFO ] Invariant cache hit.
[2024-05-28 16:20:11] [INFO ] Implicit Places using invariants in 754 ms returned []
[2024-05-28 16:20:11] [INFO ] Invariant cache hit.
[2024-05-28 16:20:12] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
[2024-05-28 16:20:12] [INFO ] Redundant transitions in 131 ms returned [1195]
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 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:20:13] [INFO ] Computed 450 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30048 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:21:06] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:21:07] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:21:08] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:21:08] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:21:08] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:21:08] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:21:09] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:21:09] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:21:09] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:21:09] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:21:10] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 3 ms to minimize.
[2024-05-28 16:21:10] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:21:10] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
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 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(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 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(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 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(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 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(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 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(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 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(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 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(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 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(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 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(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 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(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 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(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 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(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 0)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(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 0)
(s363 1)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 1)
(s376 0)
(s377 0)
(s378 1)
(s379 0)
(s380 1)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 1)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 1)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 1)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 1)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 1)
(s429 0)
(s430 1)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 1)
(s441 0)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 1)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 1)
(s453 1)
(s454 0)
(s455 1)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 1)
(s466 0)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 1)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 1)
(s478 1)
(s479 0)
(s480 1)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 1)
(s491 0)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 1)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 1)
(s503 1)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 0)
(s515 1)
(s516 0)
(s517 0)
(s518 1)
(s519 0)
(s520 0)
(s521 1)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 1)
(s528 1)
(s529 0)
(s530 1)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 1)
(s537 0)
(s538 1)
(s539 0)
(s540 1)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 0)
(s546 1)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 1)
(s553 1)
(s554 0)
(s555 1)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 1)
(s562 0)
(s563 1)
(s564 0)
(s565 1)
(s566 0)
(s567 0)
(s568 1)
(s569 0)
(s570 0)
(s571 1)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 1)
(s578 1)
(s579 0)
(s580 1)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 1)
(s587 0)
(s588 1)
(s589 0)
(s590 1)
(s591 0)
(s592 0)
(s593 1)
(s594 0)
(s595 0)
(s596 1)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 1)
(s603 1)
(s604 0)
(s605 1)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 1)
(s614 0)
(s615 1)
(s616 0)
(s617 0)
(s618 1)
(s619 0)
(s620 0)
(s621 1)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 1)
(s628 1)
(s629 0)
(s630 1)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 1)
(s637 0)
(s638 1)
(s639 0)
(s640 1)
(s641 0)
(s642 0)
(s643 1)
(s644 0)
(s645 0)
(s646 1)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 1)
(s653 1)
(s654 0)
(s655 1)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 1)
(s662 0)
(s663 1)
(s664 0)
(s665 1)
(s666 0)
(s667 0)
(s668 1)
(s669 0)
(s670 0)
(s671 1)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 1)
(s678 1)
(s679 0)
(s680 1)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 1)
(s687 0)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 0)
(s693 1)
(s694 0)
(s695 0)
(s696 1)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 1)
(s703 1)
(s704 0)
(s705 1)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 0)
(s713 1)
(s714 0)
(s715 1)
(s716 0)
(s717 0)
(s718 1)
(s719 0)
(s720 0)
(s721 1)
(s722 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30026 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 20/20 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 43 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62788 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p0]
RANDOM walk for 8169 steps (0 resets) in 132 ms. (61 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Stuttering acceptance computed with spot in 36 ms :[p0]
[2024-05-28 16:21:13] [INFO ] Invariant cache hit.
[2024-05-28 16:21:15] [INFO ] [Real]Absence check using 450 positive place invariants in 324 ms returned sat
[2024-05-28 16:21:19] [INFO ] [Real]Absence check using state equation in 4325 ms returned sat
[2024-05-28 16:21:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:21:20] [INFO ] [Nat]Absence check using 450 positive place invariants in 316 ms returned sat
[2024-05-28 16:21:24] [INFO ] [Nat]Absence check using state equation in 3656 ms returned sat
[2024-05-28 16:21:24] [INFO ] Computed and/alt/rep : 1102/3826/1102 causal constraints (skipped 97 transitions) in 70 ms.
Could not prove EG p0
Stuttering acceptance computed with spot in 34 ms :[p0]
Product exploration explored 100000 steps with 48 reset in 898 ms.
Product exploration explored 100000 steps with 48 reset in 1087 ms.
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 28 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-28 16:21:36] [INFO ] Invariant cache hit.
[2024-05-28 16:21:37] [INFO ] Implicit Places using invariants in 659 ms returned []
[2024-05-28 16:21:37] [INFO ] Invariant cache hit.
[2024-05-28 16:21:38] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 2086 ms to find 0 implicit places.
[2024-05-28 16:21:38] [INFO ] Redundant transitions in 138 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-05-28 16:21:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 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 Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30022 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:22:32] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:22:32] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:22:32] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:22:32] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:22:32] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:22:33] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:22:33] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:22:33] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:22:33] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:22:34] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:22:34] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:22:34] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:22:34] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:22:35] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:22:35] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:22:35] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:22:35] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:22:36] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:22:36] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:22:36] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30019 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 20/20 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62673 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-04 finished in 172467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
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 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 87 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:22:39] [INFO ] Computed 451 invariants in 4 ms
[2024-05-28 16:22:40] [INFO ] Implicit Places using invariants in 716 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 718 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 27 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 833 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-05
Stuttering criterion allowed to conclude after 4693 steps with 1 reset in 43 ms.
FORMULA ShieldIIPs-PT-050A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-05 finished in 1008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 22 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:22:40] [INFO ] Computed 451 invariants in 7 ms
[2024-05-28 16:22:40] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-28 16:22:40] [INFO ] Invariant cache hit.
[2024-05-28 16:22:42] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:22:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30024 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:23:35] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:23:35] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:23:35] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:23:35] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:23:35] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:23:36] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-28 16:23:36] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:23:36] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:23:36] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:23:37] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:23:37] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:23:37] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:23:37] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:23:38] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:23:38] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:23:38] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:23:38] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:23:39] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:23:39] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:23:39] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30022 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60388ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60401ms
Finished structural reductions in LTL mode , in 1 iterations and 62513 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-07
Product exploration explored 100000 steps with 44 reset in 906 ms.
Product exploration explored 100000 steps with 44 reset in 1110 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8884 steps (0 resets) in 123 ms. (71 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 92 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2024-05-28 16:23:45] [INFO ] Invariant cache hit.
[2024-05-28 16:23:46] [INFO ] [Real]Absence check using 451 positive place invariants in 299 ms returned sat
[2024-05-28 16:23:50] [INFO ] [Real]Absence check using state equation in 4004 ms returned sat
[2024-05-28 16:23:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:23:51] [INFO ] [Nat]Absence check using 451 positive place invariants in 239 ms returned sat
[2024-05-28 16:23:54] [INFO ] [Nat]Absence check using state equation in 2987 ms returned sat
[2024-05-28 16:23:54] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 63 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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-05-28 16:24:05] [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: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1252 transition count 1201
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 1201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 1249 transition count 1200
Applied a total of 5 rules in 53 ms. Remains 1249 /1253 variables (removed 4) and now considering 1200/1203 (removed 3) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2024-05-28 16:24:05] [INFO ] Computed 450 invariants in 6 ms
[2024-05-28 16:24:06] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-05-28 16:24:06] [INFO ] Invariant cache hit.
[2024-05-28 16:24:07] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
[2024-05-28 16:24:07] [INFO ] Redundant transitions in 119 ms returned [1194]
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 1198 sub problems to find dead transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2024-05-28 16:24:07] [INFO ] Computed 450 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:24:29] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:24:29] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:24:30] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:24:30] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:24:30] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:24:30] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:24:30] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:24:31] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:24:31] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:24:31] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:24:31] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 4 ms to minimize.
[2024-05-28 16:24:32] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:24:32] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:24:32] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:24:33] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:24:33] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:24:33] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 3 ms to minimize.
[2024-05-28 16:24:33] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:24:34] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:24:34] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
(s824 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.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 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.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 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.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 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.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 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.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 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.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 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.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 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.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 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.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 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.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 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.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 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.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 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.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 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.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 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.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 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.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 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.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 0.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.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 0.0)
(s460 1.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.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 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.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 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 1.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 0.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 1.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 1.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 1.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 1.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 1.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 1.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 1.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 1.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 1.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 1.0)
(s740 0.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 1.0)
(s752 1.0)
(s753 0.0)
(s754 1.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 1.0)
(s761 0.0)
(s762 1.0)
(s763 0.0)
(s764 1.0)
(s765 0.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 1.0)
(s778 0.0)
(s779 1.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 1.0)
(s786 0.0)
(s787 1.0)
(s788 0.0)
(s789 1.0)
(s790 0.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 0.0)
(s795 1.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 1.0)
(s802 1.0)
(s803 0.0)
(s804 1.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 1.0)
(s811 0.0)
(s812 1.0)
(s813 0.0)
(s814 1.0)
(s815 0.0)
(s816 0.0)
(s817 1.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2448 variables, and 1719 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30029 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:24:42] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:24:43] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:24:43] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:24:43] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:24:44] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:24:44] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:24:44] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:24:45] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 2 ms to minimize.
[2024-05-28 16:24:45] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:24:45] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 4 ms to minimize.
[2024-05-28 16:24:46] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:24:46] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 4 ms to minimize.
[2024-05-28 16:24:47] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 4 ms to minimize.
[2024-05-28 16:24:47] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 4 ms to minimize.
[2024-05-28 16:24:47] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:24:48] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:24:48] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:24:49] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 4 ms to minimize.
[2024-05-28 16:24:49] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 4 ms to minimize.
[2024-05-28 16:24:50] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1739 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:24:58] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 4 ms to minimize.
[2024-05-28 16:24:58] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:24:59] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 3 ms to minimize.
[2024-05-28 16:24:59] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 4 ms to minimize.
[2024-05-28 16:25:00] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 4 ms to minimize.
[2024-05-28 16:25:00] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 4 ms to minimize.
[2024-05-28 16:25:01] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 4 ms to minimize.
[2024-05-28 16:25:01] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 4 ms to minimize.
[2024-05-28 16:25:02] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/2448 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30026 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 49/49 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/1253 places, 1199/1203 transitions.
Applied a total of 0 rules in 25 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62521 ms. Remains : 1249/1253 places, 1199/1203 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 75 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9104 steps (0 resets) in 112 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 97 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 75 ms :[(NOT p0), (NOT p0)]
[2024-05-28 16:25:08] [INFO ] Invariant cache hit.
[2024-05-28 16:25:09] [INFO ] [Real]Absence check using 450 positive place invariants in 251 ms returned sat
[2024-05-28 16:25:13] [INFO ] [Real]Absence check using state equation in 3360 ms returned sat
[2024-05-28 16:25:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:25:14] [INFO ] [Nat]Absence check using 450 positive place invariants in 225 ms returned sat
[2024-05-28 16:25:17] [INFO ] [Nat]Absence check using state equation in 3395 ms returned sat
[2024-05-28 16:25:17] [INFO ] Computed and/alt/rep : 1198/2987/1198 causal constraints (skipped 0 transitions) in 57 ms.
[2024-05-28 16:25:28] [INFO ] Added : 475 causal constraints over 95 iterations in 10448 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 44 reset in 887 ms.
Product exploration explored 100000 steps with 44 reset in 1191 ms.
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 24 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2024-05-28 16:25:30] [INFO ] Invariant cache hit.
[2024-05-28 16:25:31] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-05-28 16:25:31] [INFO ] Invariant cache hit.
[2024-05-28 16:25:32] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
[2024-05-28 16:25:32] [INFO ] Redundant transitions in 120 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-28 16:25:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:25:54] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:25:54] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:25:54] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:25:55] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:25:55] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:25:55] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:25:55] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:25:55] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:25:56] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:25:56] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-28 16:25:56] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:25:56] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:25:57] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:25:57] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:25:57] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:25:57] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:25:58] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:25:58] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:25:58] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:25:58] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:26:02] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 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 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.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 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.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 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.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 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.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 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.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 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.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 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.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 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.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 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.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 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.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 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.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 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.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 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.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 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.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 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.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 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.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 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.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 0.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.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 0.0)
(s460 1.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.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 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.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 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 1.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 0.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 1.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 0.0)
(s560 1.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 1.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 1.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 1.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 1.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 1.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 1.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 1.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 1.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 1.0)
(s740 0.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 1.0)
(s752 1.0)
(s753 0.0)
(s754 1.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 1.0)
(s761 0.0)
(s762 1.0)
(s763 0.0)
(s764 1.0)
(s765 0.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 1.0)
(s778 0.0)
(s779 1.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 1.0)
(s786 0.0)
(s787 1.0)
(s788 0.0)
(s789 1.0)
(s790 0.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 0.0)
(s795 1.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 1.0)
(s802 1.0)
(s803 0.0)
(s804 1.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 1.0)
(s811 0.0)
(s812 1.0)
(s813 0.0)
(s814 1.0)
(s815 0.0)
(s816 0.0)
(s817 1.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 1.0)
(s828 0.0)
(s829 1.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 1.0)
(s836 0.0)
(s837 1.0)
(s838 0.0)
(s839 1.0)
(s840 0.0)
(s841 0.0)
(s842 1.0)
(s843 0.0)
(s844 0.0)
(s845 1.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 1.0)
(s852 timeout
1.0)
(s853 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2448 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30024 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 21/1720 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:26:07] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:26:07] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:26:08] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:26:08] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:26:08] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:26:09] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:26:09] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:26:09] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:26:10] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:26:10] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:26:11] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:26:11] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:26:11] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:26:12] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:26:12] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:26:13] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 4 ms to minimize.
[2024-05-28 16:26:13] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:26:14] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 4 ms to minimize.
[2024-05-28 16:26:14] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 3 ms to minimize.
[2024-05-28 16:26:14] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1740 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:26:23] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 4 ms to minimize.
[2024-05-28 16:26:23] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 4 ms to minimize.
[2024-05-28 16:26:24] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 7 ms to minimize.
[2024-05-28 16:26:24] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 4 ms to minimize.
[2024-05-28 16:26:25] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 4 ms to minimize.
[2024-05-28 16:26:25] [INFO ] Deduced a trap composed of 22 places in 246 ms of which 4 ms to minimize.
[2024-05-28 16:26:26] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 4 ms to minimize.
[2024-05-28 16:26:26] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 4 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 1249/2448 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30021 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 49/49 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60299ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62449 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-07 finished in 232583 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)))&&F(p1)))||G(p2)))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 15 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:26:32] [INFO ] Computed 451 invariants in 7 ms
[2024-05-28 16:26:33] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-05-28 16:26:33] [INFO ] Invariant cache hit.
[2024-05-28 16:26:34] [INFO ] Implicit Places using invariants and state equation in 1362 ms returned []
Implicit Place search using SMT with State Equation took 1978 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:26:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30022 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:27:27] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:27:27] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:27:28] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:27:28] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:27:28] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:27:28] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:27:28] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:27:29] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:27:29] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:27:29] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:27:29] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:27:30] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:27:30] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:27:30] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:27:30] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:27:31] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:27:31] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:27:31] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:27:32] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:27:32] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30032 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60414ms
Finished structural reductions in LTL mode , in 1 iterations and 62410 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-12
Product exploration explored 100000 steps with 101 reset in 924 ms.
Product exploration explored 100000 steps with 109 reset in 1133 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 5688 steps (0 resets) in 108 ms. (52 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X p2))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
[2024-05-28 16:27:38] [INFO ] Invariant cache hit.
[2024-05-28 16:27:39] [INFO ] [Real]Absence check using 451 positive place invariants in 298 ms returned sat
[2024-05-28 16:27:43] [INFO ] [Real]Absence check using state equation in 3143 ms returned sat
[2024-05-28 16:27:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:27:44] [INFO ] [Nat]Absence check using 451 positive place invariants in 242 ms returned sat
[2024-05-28 16:27:46] [INFO ] [Nat]Absence check using state equation in 2504 ms returned sat
[2024-05-28 16:27:46] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 67 ms.
[2024-05-28 16:27:58] [INFO ] Added : 530 causal constraints over 106 iterations in 11293 ms. Result :unknown
Could not prove EG (NOT p1)
[2024-05-28 16:27:58] [INFO ] Invariant cache hit.
[2024-05-28 16:27:59] [INFO ] [Real]Absence check using 451 positive place invariants in 272 ms returned sat
[2024-05-28 16:28:02] [INFO ] [Real]Absence check using state equation in 3006 ms returned sat
[2024-05-28 16:28:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:28:03] [INFO ] [Nat]Absence check using 451 positive place invariants in 238 ms returned sat
[2024-05-28 16:28:06] [INFO ] [Nat]Absence check using state equation in 3131 ms returned sat
[2024-05-28 16:28:06] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:28:06] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:28:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2024-05-28 16:28:07] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 75 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:610)
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-05-28 16:28:17] [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 4 out of 1253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 15 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:28:17] [INFO ] Invariant cache hit.
[2024-05-28 16:28:18] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-28 16:28:18] [INFO ] Invariant cache hit.
[2024-05-28 16:28:19] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 2070 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:28:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30027 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:29:11] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:29:12] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:29:12] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:29:12] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:29:12] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:29:12] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:29:13] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:29:13] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:29:13] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:29:13] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:29:13] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:29:14] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:29:14] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:29:14] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:29:14] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:29:15] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:29:15] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:29:15] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:29:16] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:29:16] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60398ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60410ms
Finished structural reductions in LTL mode , in 1 iterations and 62499 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 5615 steps (0 resets) in 80 ms. (69 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
[2024-05-28 16:29:20] [INFO ] Invariant cache hit.
[2024-05-28 16:29:21] [INFO ] [Real]Absence check using 451 positive place invariants in 252 ms returned sat
[2024-05-28 16:29:24] [INFO ] [Real]Absence check using state equation in 2898 ms returned sat
[2024-05-28 16:29:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:29:25] [INFO ] [Nat]Absence check using 451 positive place invariants in 234 ms returned sat
[2024-05-28 16:29:28] [INFO ] [Nat]Absence check using state equation in 2452 ms returned sat
[2024-05-28 16:29:28] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 72 ms.
Could not prove EG (NOT p1)
[2024-05-28 16:29:39] [INFO ] Invariant cache hit.
[2024-05-28 16:29:40] [INFO ] [Real]Absence check using 451 positive place invariants in 267 ms returned sat
[2024-05-28 16:29:43] [INFO ] [Real]Absence check using state equation in 3077 ms returned sat
[2024-05-28 16:29:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:29:45] [INFO ] [Nat]Absence check using 451 positive place invariants in 248 ms returned sat
[2024-05-28 16:29:48] [INFO ] [Nat]Absence check using state equation in 3024 ms returned sat
[2024-05-28 16:29:48] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:29:48] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:29:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2024-05-28 16:29:48] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 64 ms.
[2024-05-28 16:29:59] [INFO ] Added : 410 causal constraints over 82 iterations in 10490 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 101 reset in 928 ms.
Product exploration explored 100000 steps with 120 reset in 1085 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1253 transition count 1203
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 128 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:30:01] [INFO ] Redundant transitions in 138 ms returned [1195]
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 1201 sub problems to find dead transitions.
// Phase 1: matrix 1202 rows 1253 cols
[2024-05-28 16:30:01] [INFO ] Computed 451 invariants in 3 ms
[2024-05-28 16:30:01] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2455 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30023 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1201/1201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-05-28 16:30:54] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:30:54] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:30:55] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:30:56] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:30:56] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:30:56] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:30:56] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:30:57] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:30:57] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:30:57] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:30:57] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:30:58] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:30:58] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:30:58] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:30:59] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-05-28 16:30:59] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-05-28 16:31:00] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2455 variables, and 1725 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30024 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1201 constraints, Known Traps: 21/21 constraints]
After SMT, in 60366ms problems are : Problem set: 0 solved, 1201 unsolved
Search for dead transitions found 0 dead transitions in 60376ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/1253 places, 1202/1203 transitions.
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 0 rules in 33 ms. Remains 1253 /1253 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60689 ms. Remains : 1253/1253 places, 1202/1203 transitions.
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 25 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:31:02] [INFO ] Computed 451 invariants in 8 ms
[2024-05-28 16:31:02] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-05-28 16:31:02] [INFO ] Invariant cache hit.
[2024-05-28 16:31:04] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:31:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30022 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:31:57] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:31:57] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:31:57] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:31:57] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:31:57] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-28 16:31:58] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:31:58] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:31:58] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:31:58] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:31:59] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:31:59] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:31:59] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:31:59] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:32:00] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:32:00] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:32:00] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-28 16:32:00] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:32:01] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:32:01] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:32:01] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30025 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Finished structural reductions in LTL mode , in 1 iterations and 62495 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-12 finished in 331908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
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 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 59 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:32:04] [INFO ] Computed 451 invariants in 9 ms
[2024-05-28 16:32:05] [INFO ] Implicit Places using invariants in 617 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 623 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 42 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 725 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-13
Product exploration explored 100000 steps with 39 reset in 891 ms.
Product exploration explored 100000 steps with 39 reset in 1112 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 11 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 30 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:32:08] [INFO ] Computed 450 invariants in 14 ms
[2024-05-28 16:32:08] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-05-28 16:32:08] [INFO ] Invariant cache hit.
[2024-05-28 16:32:10] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 2072 ms to find 0 implicit places.
[2024-05-28 16:32:10] [INFO ] Redundant transitions in 144 ms returned [1195]
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 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:32:10] [INFO ] Computed 450 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30025 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:33:02] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:33:02] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:33:03] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:33:03] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:33:03] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:33:03] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-28 16:33:03] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:33:04] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:33:04] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:33:04] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:33:04] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:33:05] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:33:05] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:33:05] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:33:05] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:33:06] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:33:06] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:33:06] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-05-28 16:33:06] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:33:07] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30040 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 20/20 constraints]
After SMT, in 60376ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60388ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 29 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62678 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39 reset in 1026 ms.
Product exploration explored 100000 steps with 39 reset in 1262 ms.
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 27 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-28 16:33:13] [INFO ] Invariant cache hit.
[2024-05-28 16:33:14] [INFO ] Implicit Places using invariants in 671 ms returned []
[2024-05-28 16:33:14] [INFO ] Invariant cache hit.
[2024-05-28 16:33:15] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 2171 ms to find 0 implicit places.
[2024-05-28 16:33:15] [INFO ] Redundant transitions in 102 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-05-28 16:33:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30022 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:34:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:34:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:34:07] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-28 16:34:08] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-28 16:34:08] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-28 16:34:08] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:34:08] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:34:09] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:34:09] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:34:09] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:34:09] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:34:09] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:34:10] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:34:10] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:34:10] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:34:11] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:34:11] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:34:11] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:34:11] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:34:12] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:34:15] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 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 1250/2450 variables, and 1721 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30025 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 21/21 constraints]
After SMT, in 60391ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60404ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62720 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-13 finished in 131289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 20 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:34:16] [INFO ] Computed 451 invariants in 6 ms
[2024-05-28 16:34:16] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-28 16:34:16] [INFO ] Invariant cache hit.
[2024-05-28 16:34:18] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:34:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:35:10] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:35:10] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:35:10] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-28 16:35:10] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:35:11] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:35:11] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:35:11] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:35:11] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:35:11] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:35:12] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:35:12] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:35:12] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:35:12] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:35:13] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:35:14] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:35:14] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:35:14] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-28 16:35:14] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30022 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Finished structural reductions in LTL mode , in 1 iterations and 62507 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-15
Product exploration explored 100000 steps with 170 reset in 895 ms.
Product exploration explored 100000 steps with 173 reset in 1110 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 78 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 67 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:35:21] [INFO ] Computed 451 invariants in 5 ms
[2024-05-28 16:35:21] [INFO ] Implicit Places using invariants in 653 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 654 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 25 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 747 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 175 reset in 900 ms.
Product exploration explored 100000 steps with 175 reset in 1104 ms.
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 33 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:35:24] [INFO ] Computed 450 invariants in 2 ms
[2024-05-28 16:35:25] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-05-28 16:35:25] [INFO ] Invariant cache hit.
[2024-05-28 16:35:26] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 2001 ms to find 0 implicit places.
[2024-05-28 16:35:26] [INFO ] Redundant transitions in 127 ms returned [1195]
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 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:35:26] [INFO ] Computed 450 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30019 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:36:18] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:36:19] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:36:19] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:36:19] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:36:19] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:36:19] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:36:20] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:36:20] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:36:20] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:36:20] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:36:21] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:36:21] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:36:21] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:36:21] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:36:22] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:36:22] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:36:22] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:36:22] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:36:23] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:36:23] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30019 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 20/20 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60404ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 24 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62594 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-15 finished in 130913 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))'
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)))'
Found a Shortening insensitive property : ShieldIIPs-PT-050A-LTLCardinality-07
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1252 transition count 1201
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 1201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 1249 transition count 1200
Applied a total of 5 rules in 63 ms. Remains 1249 /1253 variables (removed 4) and now considering 1200/1203 (removed 3) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2024-05-28 16:36:27] [INFO ] Computed 450 invariants in 5 ms
[2024-05-28 16:36:27] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-28 16:36:27] [INFO ] Invariant cache hit.
[2024-05-28 16:36:29] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
Running 1199 sub problems to find dead transitions.
[2024-05-28 16:36:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:36:51] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:36:51] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:36:51] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 4 ms to minimize.
[2024-05-28 16:36:51] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:36:51] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:36:52] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:36:52] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:36:52] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:36:52] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:36:53] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:36:53] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:36:53] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:36:53] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:36:53] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:36:54] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:36:54] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:36:54] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:36:54] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:36:55] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:36:55] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:36:59] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:36:59] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
SMT process timed out in 30336ms, After SMT, problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 30348ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1249/1253 places, 1200/1203 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 32330 ms. Remains : 1249/1253 places, 1200/1203 transitions.
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-07
Product exploration explored 100000 steps with 45 reset in 872 ms.
Product exploration explored 100000 steps with 44 reset in 1103 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8834 steps (0 resets) in 135 ms. (64 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 76 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-28 16:37:02] [INFO ] Invariant cache hit.
[2024-05-28 16:37:03] [INFO ] [Real]Absence check using 450 positive place invariants in 261 ms returned sat
[2024-05-28 16:37:05] [INFO ] [Real]Absence check using state equation in 2507 ms returned sat
[2024-05-28 16:37:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:37:06] [INFO ] [Nat]Absence check using 450 positive place invariants in 210 ms returned sat
[2024-05-28 16:37:09] [INFO ] [Nat]Absence check using state equation in 2655 ms returned sat
[2024-05-28 16:37:09] [INFO ] Computed and/alt/rep : 1199/2992/1199 causal constraints (skipped 0 transitions) in 59 ms.
Could not prove EG (NOT p0)
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1200/1200 transitions.
Applied a total of 0 rules in 33 ms. Remains 1249 /1249 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-28 16:37:20] [INFO ] Invariant cache hit.
[2024-05-28 16:37:21] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-28 16:37:21] [INFO ] Invariant cache hit.
[2024-05-28 16:37:22] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
[2024-05-28 16:37:22] [INFO ] Redundant transitions in 117 ms returned [1194]
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 1198 sub problems to find dead transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2024-05-28 16:37:22] [INFO ] Computed 450 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:37:43] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:37:44] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:37:44] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:37:44] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:37:44] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:37:44] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:37:45] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:37:45] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:37:45] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:37:45] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:37:46] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:37:46] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:37:46] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:37:46] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:37:47] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:37:47] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:37:47] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:37:47] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:37:48] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:37:48] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:37:52] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:37:52] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:37:52] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2448 variables, and 1722 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30022 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 23/1722 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:37:58] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:37:58] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:37:58] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
[2024-05-28 16:37:59] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:37:59] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:37:59] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:38:00] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:38:00] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:38:00] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:38:01] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:38:01] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:38:02] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 3 ms to minimize.
[2024-05-28 16:38:02] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:38:03] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 4 ms to minimize.
[2024-05-28 16:38:03] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 4 ms to minimize.
[2024-05-28 16:38:03] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:38:04] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 4 ms to minimize.
[2024-05-28 16:38:04] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 4 ms to minimize.
[2024-05-28 16:38:05] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 3 ms to minimize.
[2024-05-28 16:38:05] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1742 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:38:14] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 4 ms to minimize.
[2024-05-28 16:38:14] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 4 ms to minimize.
[2024-05-28 16:38:15] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 4 ms to minimize.
[2024-05-28 16:38:15] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 4 ms to minimize.
[2024-05-28 16:38:16] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 4 ms to minimize.
[2024-05-28 16:38:16] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/2448 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30020 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 49/49 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/1249 places, 1199/1200 transitions.
Applied a total of 0 rules in 33 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62395 ms. Remains : 1249/1249 places, 1199/1200 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 73 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 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9075 steps (0 resets) in 106 ms. (84 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 105 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)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-28 16:38:23] [INFO ] Invariant cache hit.
[2024-05-28 16:38:24] [INFO ] [Real]Absence check using 450 positive place invariants in 241 ms returned sat
[2024-05-28 16:38:27] [INFO ] [Real]Absence check using state equation in 3124 ms returned sat
[2024-05-28 16:38:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:38:28] [INFO ] [Nat]Absence check using 450 positive place invariants in 216 ms returned sat
[2024-05-28 16:38:32] [INFO ] [Nat]Absence check using state equation in 3238 ms returned sat
[2024-05-28 16:38:32] [INFO ] Computed and/alt/rep : 1198/2987/1198 causal constraints (skipped 0 transitions) in 61 ms.
[2024-05-28 16:38:42] [INFO ] Added : 470 causal constraints over 94 iterations in 10671 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 44 reset in 894 ms.
Product exploration explored 100000 steps with 45 reset in 1118 ms.
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 23 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2024-05-28 16:38:44] [INFO ] Invariant cache hit.
[2024-05-28 16:38:45] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-28 16:38:45] [INFO ] Invariant cache hit.
[2024-05-28 16:38:46] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2024-05-28 16:38:47] [INFO ] Redundant transitions in 128 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-28 16:38:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:39:09] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:39:09] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:39:09] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:39:09] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:39:10] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-28 16:39:10] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:39:10] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:39:10] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:39:11] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:39:11] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:39:11] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:39:11] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:39:12] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:39:12] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:39:12] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:39:12] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:39:13] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:39:13] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:39:13] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:39:14] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
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 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.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 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.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 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.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 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.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 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.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 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.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 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.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 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.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 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.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 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.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 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.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 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.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 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.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 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.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 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.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 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.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 0.0)
(s410 1.0)
(s411 1.0)
(s412 timeout
0.0)
(s413 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2448 variables, and 1719 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30022 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:39:22] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:39:22] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:39:22] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:39:23] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:39:23] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:39:23] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-05-28 16:39:24] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:39:24] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:39:24] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:39:25] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:39:25] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:39:25] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:39:26] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:39:26] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:39:27] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:39:27] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:39:27] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 4 ms to minimize.
[2024-05-28 16:39:28] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:39:28] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 4 ms to minimize.
[2024-05-28 16:39:29] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1739 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:39:37] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:39:37] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:39:38] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 4 ms to minimize.
[2024-05-28 16:39:38] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 4 ms to minimize.
[2024-05-28 16:39:39] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 4 ms to minimize.
[2024-05-28 16:39:39] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 4 ms to minimize.
[2024-05-28 16:39:40] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 4 ms to minimize.
[2024-05-28 16:39:40] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 5 ms to minimize.
[2024-05-28 16:39:41] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/2448 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30021 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 49/49 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60301ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62453 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-07 finished in 200293 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)))&&F(p1)))||G(p2)))'
Found a Shortening insensitive property : ShieldIIPs-PT-050A-LTLCardinality-12
Stuttering acceptance computed with spot in 359 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
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 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 55 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:39:47] [INFO ] Computed 451 invariants in 6 ms
[2024-05-28 16:39:48] [INFO ] Implicit Places using invariants in 647 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 648 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 24 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 727 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-12
Product exploration explored 100000 steps with 107 reset in 932 ms.
Product exploration explored 100000 steps with 101 reset in 1112 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 5088 steps (0 resets) in 71 ms. (70 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X p2))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 9 factoid took 157 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:39:51] [INFO ] Computed 450 invariants in 6 ms
[2024-05-28 16:39:52] [INFO ] [Real]Absence check using 450 positive place invariants in 274 ms returned sat
[2024-05-28 16:39:56] [INFO ] [Real]Absence check using state equation in 3435 ms returned sat
[2024-05-28 16:39:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:39:57] [INFO ] [Nat]Absence check using 450 positive place invariants in 248 ms returned sat
[2024-05-28 16:39:59] [INFO ] [Nat]Absence check using state equation in 2546 ms returned sat
[2024-05-28 16:40:00] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:40:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2024-05-28 16:40:00] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 61 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:610)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
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-05-28 16:40:11] [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 p1)
Could not prove EG (NOT p1)
[2024-05-28 16:40:11] [INFO ] Invariant cache hit.
[2024-05-28 16:40:12] [INFO ] [Real]Absence check using 450 positive place invariants in 283 ms returned sat
[2024-05-28 16:40:15] [INFO ] [Real]Absence check using state equation in 2940 ms returned sat
[2024-05-28 16:40:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:40:16] [INFO ] [Nat]Absence check using 450 positive place invariants in 246 ms returned sat
[2024-05-28 16:40:19] [INFO ] [Nat]Absence check using state equation in 2794 ms returned sat
[2024-05-28 16:40:19] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 63 ms.
[2024-05-28 16:40:30] [INFO ] Added : 520 causal constraints over 104 iterations in 10996 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 4 out of 1250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 18 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:40:30] [INFO ] Invariant cache hit.
[2024-05-28 16:40:31] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-05-28 16:40:31] [INFO ] Invariant cache hit.
[2024-05-28 16:40:32] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 2158 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-28 16:40:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 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 Real declared 1249/2451 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30021 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 16:41:24] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:41:25] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:41:25] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:41:25] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:41:25] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:41:25] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:41:26] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:41:26] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:41:26] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:41:26] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:41:27] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:41:27] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:41:27] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:41:27] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:41:28] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:41:28] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-28 16:41:28] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:41:28] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:41:29] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:41:29] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2451 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30026 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 20/20 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60417ms
Finished structural reductions in LTL mode , in 1 iterations and 62597 ms. Remains : 1250/1250 places, 1201/1201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 5742 steps (0 resets) in 71 ms. (79 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
[2024-05-28 16:41:33] [INFO ] Invariant cache hit.
[2024-05-28 16:41:35] [INFO ] [Real]Absence check using 450 positive place invariants in 284 ms returned sat
[2024-05-28 16:41:38] [INFO ] [Real]Absence check using state equation in 3298 ms returned sat
[2024-05-28 16:41:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:41:39] [INFO ] [Nat]Absence check using 450 positive place invariants in 245 ms returned sat
[2024-05-28 16:41:42] [INFO ] [Nat]Absence check using state equation in 2913 ms returned sat
[2024-05-28 16:41:42] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:41:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-05-28 16:41:42] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 59 ms.
[2024-05-28 16:41:53] [INFO ] Added : 450 causal constraints over 90 iterations in 10803 ms. Result :unknown
Could not prove EG (NOT p1)
[2024-05-28 16:41:53] [INFO ] Invariant cache hit.
[2024-05-28 16:41:54] [INFO ] [Real]Absence check using 450 positive place invariants in 259 ms returned sat
[2024-05-28 16:41:57] [INFO ] [Real]Absence check using state equation in 2756 ms returned sat
[2024-05-28 16:41:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:41:58] [INFO ] [Nat]Absence check using 450 positive place invariants in 220 ms returned sat
[2024-05-28 16:42:01] [INFO ] [Nat]Absence check using state equation in 2610 ms returned sat
[2024-05-28 16:42:01] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 55 ms.
[2024-05-28 16:42:12] [INFO ] Added : 530 causal constraints over 106 iterations in 11222 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 113 reset in 887 ms.
Product exploration explored 100000 steps with 108 reset in 1092 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 4 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 27 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:42:15] [INFO ] Redundant transitions in 120 ms returned [1195]
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 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:42:15] [INFO ] Computed 450 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 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 Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30026 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:43:07] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:43:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:43:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:43:08] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:43:08] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:43:08] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:43:08] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:43:08] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-28 16:43:09] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:43:10] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:43:10] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:43:10] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:43:10] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:43:11] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:43:12] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30025 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 20/20 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60598 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Support contains 4 out of 1250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 15 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:43:15] [INFO ] Computed 450 invariants in 6 ms
[2024-05-28 16:43:16] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-28 16:43:16] [INFO ] Invariant cache hit.
[2024-05-28 16:43:17] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 2104 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-28 16:43:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)timeout

(s395 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2451 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30054 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 16:44:10] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:44:10] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:44:10] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:44:10] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:44:11] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:44:11] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:44:11] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:44:11] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:44:12] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:44:12] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:44:12] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:44:12] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:44:13] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:44:13] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:44:13] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:44:13] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:44:14] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:44:14] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:44:14] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:44:15] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
(s101 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
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 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(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 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(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 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(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 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2451 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 20/20 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60412ms
Finished structural reductions in LTL mode , in 1 iterations and 62534 ms. Remains : 1250/1250 places, 1201/1201 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-12 finished in 270640 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)))'
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)))'
Found a Shortening insensitive property : ShieldIIPs-PT-050A-LTLCardinality-15
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
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 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 53 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:44:18] [INFO ] Computed 451 invariants in 5 ms
[2024-05-28 16:44:19] [INFO ] Implicit Places using invariants in 667 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 668 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 745 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-15
Product exploration explored 100000 steps with 177 reset in 906 ms.
Product exploration explored 100000 steps with 174 reset in 1126 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 77 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 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 27 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:44:21] [INFO ] Computed 450 invariants in 5 ms
[2024-05-28 16:44:22] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-28 16:44:22] [INFO ] Invariant cache hit.
[2024-05-28 16:44:23] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 2127 ms to find 0 implicit places.
[2024-05-28 16:44:23] [INFO ] Redundant transitions in 121 ms returned [1195]
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 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:44:23] [INFO ] Computed 450 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30022 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:45:16] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:45:17] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:45:17] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:45:17] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:45:17] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:45:17] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:45:18] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:45:18] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:45:18] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:45:18] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:45:19] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:45:19] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:45:19] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:45:19] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:45:20] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:45:20] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:45:20] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:45:20] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:45:21] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2024-05-28 16:45:21] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30026 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 20/20 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 26 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62686 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 174 reset in 888 ms.
Product exploration explored 100000 steps with 177 reset in 1107 ms.
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-28 16:45:26] [INFO ] Invariant cache hit.
[2024-05-28 16:45:27] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-05-28 16:45:27] [INFO ] Invariant cache hit.
[2024-05-28 16:45:28] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2024-05-28 16:45:28] [INFO ] Redundant transitions in 126 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-05-28 16:45:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30024 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:46:21] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:46:22] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:46:22] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:46:22] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:46:22] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-28 16:46:22] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-28 16:46:23] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-05-28 16:46:23] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:46:23] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:46:23] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:46:24] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:46:24] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:46:24] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:46:24] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:46:25] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:46:25] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:46:25] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:46:26] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:46:26] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:46:26] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30017 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 20/20 constraints]
After SMT, in 60385ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62512 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-15 finished in 131179 ms.
[2024-05-28 16:46:29] [INFO ] Flatten gal took : 72 ms
[2024-05-28 16:46:29] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-28 16:46:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1253 places, 1203 transitions and 5406 arcs took 14 ms.
Total runtime 1799291 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-050A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1253
TRANSITIONS: 1203
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.024s, Sys 0.008s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]


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

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

Process ID: 4150
MODEL NAME: /home/mcc/execution/411/model
1253 places, 1203 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPs-PT-050A, 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 r355-tall-171683758100147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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