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-171683758800475.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 ShieldPPPs-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758800475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 992K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.1K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 13 11:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 13 11:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 528K 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 ShieldPPPs-PT-030B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716979879087

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 10:51:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 10:51:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:51:20] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-05-29 10:51:20] [INFO ] Transformed 2043 places.
[2024-05-29 10:51:20] [INFO ] Transformed 1893 transitions.
[2024-05-29 10:51:20] [INFO ] Found NUPN structural information;
[2024-05-29 10:51:20] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 2043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Discarding 208 places :
Symmetric choice reduction at 0 with 208 rule applications. Total rules 208 place count 1835 transition count 1685
Iterating global reduction 0 with 208 rules applied. Total rules applied 416 place count 1835 transition count 1685
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 417 place count 1834 transition count 1684
Iterating global reduction 0 with 1 rules applied. Total rules applied 418 place count 1834 transition count 1684
Applied a total of 418 rules in 688 ms. Remains 1834 /2043 variables (removed 209) and now considering 1684/1893 (removed 209) transitions.
// Phase 1: matrix 1684 rows 1834 cols
[2024-05-29 10:51:21] [INFO ] Computed 331 invariants in 37 ms
[2024-05-29 10:51:22] [INFO ] Implicit Places using invariants in 824 ms returned []
[2024-05-29 10:51:22] [INFO ] Invariant cache hit.
[2024-05-29 10:51:23] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 2275 ms to find 0 implicit places.
Running 1683 sub problems to find dead transitions.
[2024-05-29 10:51:23] [INFO ] Invariant cache hit.
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 1833/3518 variables, and 0 constraints, problems are : Problem set: 0 solved, 1683 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1834 constraints, PredecessorRefiner: 1683/1683 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1683 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1833/3518 variables, and 0 constraints, problems are : Problem set: 0 solved, 1683 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1834 constraints, PredecessorRefiner: 0/1683 constraints, Known Traps: 0/0 constraints]
After SMT, in 60594ms problems are : Problem set: 0 solved, 1683 unsolved
Search for dead transitions found 0 dead transitions in 60631ms
Starting structural reductions in LTL mode, iteration 1 : 1834/2043 places, 1684/1893 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63638 ms. Remains : 1834/2043 places, 1684/1893 transitions.
Support contains 22 out of 1834 places after structural reductions.
[2024-05-29 10:52:24] [INFO ] Flatten gal took : 157 ms
[2024-05-29 10:52:25] [INFO ] Flatten gal took : 81 ms
[2024-05-29 10:52:25] [INFO ] Input system was already deterministic with 1684 transitions.
RANDOM walk for 40000 steps (8 resets) in 2567 ms. (15 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
[2024-05-29 10:52:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1757/1834 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1834 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1684/3518 variables, 1834/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3518 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3518 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3518/3518 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 1834/1834 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1757/1834 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:52:27] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 35 ms to minimize.
[2024-05-29 10:52:27] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 5 ms to minimize.
[2024-05-29 10:52:27] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 4 ms to minimize.
[2024-05-29 10:52:27] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-05-29 10:52:28] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-05-29 10:52:28] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-05-29 10:52:28] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
[2024-05-29 10:52:28] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-29 10:52:28] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-29 10:52:28] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
[2024-05-29 10:52:28] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-29 10:52:28] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-29 10:52:29] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-05-29 10:52:29] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-29 10:52:29] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-29 10:52:29] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-29 10:52:29] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-29 10:52:29] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-29 10:52:29] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1834 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1834 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1684/3518 variables, 1834/2184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3518 variables, 1/2185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:52:30] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 7 ms to minimize.
[2024-05-29 10:52:30] [INFO ] Deduced a trap composed of 21 places in 295 ms of which 6 ms to minimize.
[2024-05-29 10:52:31] [INFO ] Deduced a trap composed of 65 places in 294 ms of which 6 ms to minimize.
[2024-05-29 10:52:31] [INFO ] Deduced a trap composed of 48 places in 286 ms of which 5 ms to minimize.
[2024-05-29 10:52:31] [INFO ] Deduced a trap composed of 22 places in 296 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3518/3518 variables, and 2190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 1834/1834 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints]
After SMT, in 5847ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1834 transition count 1473
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1623 transition count 1473
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 422 place count 1623 transition count 1323
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 722 place count 1473 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 723 place count 1472 transition count 1322
Iterating global reduction 2 with 1 rules applied. Total rules applied 724 place count 1472 transition count 1322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 724 place count 1472 transition count 1321
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 726 place count 1471 transition count 1321
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 3 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 2 with 1070 rules applied. Total rules applied 1796 place count 936 transition count 786
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 267 times.
Drop transitions (Partial Free agglomeration) removed 267 transitions
Iterating global reduction 2 with 267 rules applied. Total rules applied 2063 place count 936 transition count 786
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2064 place count 935 transition count 785
Applied a total of 2064 rules in 489 ms. Remains 935 /1834 variables (removed 899) and now considering 785/1684 (removed 899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 ms. Remains : 935/1834 places, 785/1684 transitions.
RANDOM walk for 40000 steps (8 resets) in 738 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 26307 steps (4 resets) in 175 ms. (149 steps per ms) remains 0/1 properties
Computed a total of 361 stabilizing places and 361 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p1))||p0)))'
Support contains 4 out of 1834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1833 transition count 1683
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1833 transition count 1683
Applied a total of 2 rules in 136 ms. Remains 1833 /1834 variables (removed 1) and now considering 1683/1684 (removed 1) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2024-05-29 10:52:32] [INFO ] Computed 331 invariants in 18 ms
[2024-05-29 10:52:33] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-05-29 10:52:33] [INFO ] Invariant cache hit.
[2024-05-29 10:52:35] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
Running 1682 sub problems to find dead transitions.
[2024-05-29 10:52:35] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 0/1682 constraints, Known Traps: 0/0 constraints]
After SMT, in 60512ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Starting structural reductions in LTL mode, iteration 1 : 1833/1834 places, 1683/1684 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63025 ms. Remains : 1833/1834 places, 1683/1684 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-02
Product exploration explored 100000 steps with 326 reset in 705 ms.
Product exploration explored 100000 steps with 265 reset in 777 ms.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (8 resets) in 446 ms. (89 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
[2024-05-29 10:53:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1756/1833 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1833 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1683/3516 variables, 1833/2164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3516 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3516 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3516/3516 variables, and 2164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 1833/1833 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1756/1833 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:53:39] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-29 10:53:39] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 3 ms to minimize.
[2024-05-29 10:53:39] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 3 ms to minimize.
[2024-05-29 10:53:39] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 3 ms to minimize.
[2024-05-29 10:53:39] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2024-05-29 10:53:40] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 4 ms to minimize.
[2024-05-29 10:53:40] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-05-29 10:53:40] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-05-29 10:53:40] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-29 10:53:40] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 4 ms to minimize.
[2024-05-29 10:53:40] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-29 10:53:40] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-29 10:53:40] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-29 10:53:41] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2024-05-29 10:53:41] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-29 10:53:41] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-29 10:53:41] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-05-29 10:53:41] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-29 10:53:41] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1833 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1833 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1683/3516 variables, 1833/2183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3516 variables, 1/2184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:53:42] [INFO ] Deduced a trap composed of 22 places in 308 ms of which 6 ms to minimize.
[2024-05-29 10:53:42] [INFO ] Deduced a trap composed of 42 places in 292 ms of which 6 ms to minimize.
[2024-05-29 10:53:42] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 5 ms to minimize.
[2024-05-29 10:53:43] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 5 ms to minimize.
[2024-05-29 10:53:43] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 5 ms to minimize.
[2024-05-29 10:53:43] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 5 ms to minimize.
[2024-05-29 10:53:44] [INFO ] Deduced a trap composed of 56 places in 223 ms of which 5 ms to minimize.
SMT process timed out in 5917ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1833 transition count 1472
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1622 transition count 1472
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 422 place count 1622 transition count 1322
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 722 place count 1472 transition count 1322
Performed 536 Post agglomeration using F-continuation condition.Transition count delta: 536
Deduced a syphon composed of 536 places in 0 ms
Reduce places removed 536 places and 0 transitions.
Iterating global reduction 2 with 1072 rules applied. Total rules applied 1794 place count 936 transition count 786
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 267 times.
Drop transitions (Partial Free agglomeration) removed 267 transitions
Iterating global reduction 2 with 267 rules applied. Total rules applied 2061 place count 936 transition count 786
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2062 place count 935 transition count 785
Applied a total of 2062 rules in 314 ms. Remains 935 /1833 variables (removed 898) and now considering 785/1683 (removed 898) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 935/1833 places, 785/1683 transitions.
RANDOM walk for 40000 steps (8 resets) in 494 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 25155 steps (4 resets) in 125 ms. (199 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 1833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Applied a total of 0 rules in 58 ms. Remains 1833 /1833 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
[2024-05-29 10:53:45] [INFO ] Invariant cache hit.
[2024-05-29 10:53:45] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-05-29 10:53:45] [INFO ] Invariant cache hit.
[2024-05-29 10:53:47] [INFO ] Implicit Places using invariants and state equation in 1666 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
Running 1682 sub problems to find dead transitions.
[2024-05-29 10:53:47] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 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 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 0/1682 constraints, Known Traps: 0/0 constraints]
After SMT, in 60419ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 60434ms
Finished structural reductions in LTL mode , in 1 iterations and 62751 ms. Remains : 1833/1833 places, 1683/1683 transitions.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (8 resets) in 361 ms. (110 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2024-05-29 10:54:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1756/1833 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1833 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1683/3516 variables, 1833/2164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3516 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3516 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3516/3516 variables, and 2164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 1833/1833 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1756/1833 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:54:49] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-29 10:54:49] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 3 ms to minimize.
[2024-05-29 10:54:49] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-05-29 10:54:49] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 3 ms to minimize.
[2024-05-29 10:54:49] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 3 ms to minimize.
[2024-05-29 10:54:50] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-05-29 10:54:50] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-29 10:54:50] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 3 ms to minimize.
[2024-05-29 10:54:50] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-29 10:54:50] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-29 10:54:50] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-29 10:54:50] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-29 10:54:50] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-29 10:54:50] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-29 10:54:51] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-29 10:54:51] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-29 10:54:51] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-29 10:54:51] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-29 10:54:51] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1833 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1833 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1683/3516 variables, 1833/2183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3516 variables, 1/2184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:54:52] [INFO ] Deduced a trap composed of 22 places in 287 ms of which 6 ms to minimize.
[2024-05-29 10:54:52] [INFO ] Deduced a trap composed of 42 places in 274 ms of which 6 ms to minimize.
[2024-05-29 10:54:52] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 5 ms to minimize.
[2024-05-29 10:54:53] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 5 ms to minimize.
[2024-05-29 10:54:53] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 4 ms to minimize.
[2024-05-29 10:54:53] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 5 ms to minimize.
[2024-05-29 10:54:53] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 5 ms to minimize.
[2024-05-29 10:54:54] [INFO ] Deduced a trap composed of 56 places in 222 ms of which 6 ms to minimize.
SMT process timed out in 5962ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1833 transition count 1472
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1622 transition count 1472
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 422 place count 1622 transition count 1322
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 722 place count 1472 transition count 1322
Performed 536 Post agglomeration using F-continuation condition.Transition count delta: 536
Deduced a syphon composed of 536 places in 1 ms
Reduce places removed 536 places and 0 transitions.
Iterating global reduction 2 with 1072 rules applied. Total rules applied 1794 place count 936 transition count 786
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 267 times.
Drop transitions (Partial Free agglomeration) removed 267 transitions
Iterating global reduction 2 with 267 rules applied. Total rules applied 2061 place count 936 transition count 786
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2062 place count 935 transition count 785
Applied a total of 2062 rules in 210 ms. Remains 935 /1833 variables (removed 898) and now considering 785/1683 (removed 898) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 935/1833 places, 785/1683 transitions.
RANDOM walk for 40000 steps (8 resets) in 649 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32660 steps (6 resets) in 222 ms. (146 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 224 reset in 602 ms.
Product exploration explored 100000 steps with 335 reset in 668 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 1833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1683
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 62 Pre rules applied. Total rules applied 210 place count 1833 transition count 1685
Deduced a syphon composed of 272 places in 7 ms
Iterating global reduction 1 with 62 rules applied. Total rules applied 272 place count 1833 transition count 1685
Performed 625 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 897 places in 1 ms
Iterating global reduction 1 with 625 rules applied. Total rules applied 897 place count 1833 transition count 1685
Renaming transitions due to excessive name length > 1024 char.
Discarding 210 places :
Symmetric choice reduction at 1 with 210 rule applications. Total rules 1107 place count 1623 transition count 1475
Deduced a syphon composed of 687 places in 1 ms
Iterating global reduction 1 with 210 rules applied. Total rules applied 1317 place count 1623 transition count 1475
Deduced a syphon composed of 687 places in 1 ms
Applied a total of 1317 rules in 692 ms. Remains 1623 /1833 variables (removed 210) and now considering 1475/1683 (removed 208) transitions.
[2024-05-29 10:54:57] [INFO ] Redundant transitions in 117 ms returned []
Running 1474 sub problems to find dead transitions.
// Phase 1: matrix 1475 rows 1623 cols
[2024-05-29 10:54:57] [INFO ] Computed 331 invariants in 15 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1622/3098 variables, and 0 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1623 constraints, PredecessorRefiner: 1474/1474 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1474 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 1622/3098 variables, and 0 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1623 constraints, PredecessorRefiner: 0/1474 constraints, Known Traps: 0/0 constraints]
After SMT, in 61016ms problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 61027ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1623/1833 places, 1475/1683 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61861 ms. Remains : 1623/1833 places, 1475/1683 transitions.
Support contains 4 out of 1833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Applied a total of 0 rules in 49 ms. Remains 1833 /1833 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2024-05-29 10:55:58] [INFO ] Computed 331 invariants in 13 ms
[2024-05-29 10:55:59] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-05-29 10:55:59] [INFO ] Invariant cache hit.
[2024-05-29 10:56:00] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2253 ms to find 0 implicit places.
Running 1682 sub problems to find dead transitions.
[2024-05-29 10:56:00] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 timeout
1)
(s1698 1)
(s1699 1)
(s1700 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 0/1682 constraints, Known Traps: 0/0 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Finished structural reductions in LTL mode , in 1 iterations and 62695 ms. Remains : 1833/1833 places, 1683/1683 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-02 finished in 268537 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)&&F(p1)) U p0))'
Support contains 3 out of 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1473
Reduce places removed 210 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 211 rules applied. Total rules applied 421 place count 1623 transition count 1472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 422 place count 1622 transition count 1472
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 422 place count 1622 transition count 1322
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 722 place count 1472 transition count 1322
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 724 place count 1470 transition count 1320
Iterating global reduction 3 with 2 rules applied. Total rules applied 726 place count 1470 transition count 1320
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 726 place count 1470 transition count 1318
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 730 place count 1468 transition count 1318
Performed 533 Post agglomeration using F-continuation condition.Transition count delta: 533
Deduced a syphon composed of 533 places in 1 ms
Reduce places removed 533 places and 0 transitions.
Iterating global reduction 3 with 1066 rules applied. Total rules applied 1796 place count 935 transition count 785
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1798 place count 933 transition count 783
Applied a total of 1798 rules in 282 ms. Remains 933 /1834 variables (removed 901) and now considering 783/1684 (removed 901) transitions.
// Phase 1: matrix 783 rows 933 cols
[2024-05-29 10:57:01] [INFO ] Computed 331 invariants in 2 ms
[2024-05-29 10:57:02] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-29 10:57:02] [INFO ] Invariant cache hit.
[2024-05-29 10:57:02] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
[2024-05-29 10:57:02] [INFO ] Redundant transitions in 8 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 10:57:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 1/933 variables, 309/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:57:31] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 10:57:31] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-29 10:57:32] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2024-05-29 10:57:32] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:57:32] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-05-29 10:57:32] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 933/1716 variables, and 337 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 1/933 variables, 309/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/933 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:57:52] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 10:57:52] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
[2024-05-29 10:57:52] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2024-05-29 10:57:53] [INFO ] Deduced a trap composed of 102 places in 48 ms of which 1 ms to minimize.
[2024-05-29 10:57:53] [INFO ] Deduced a trap composed of 118 places in 61 ms of which 2 ms to minimize.
[2024-05-29 10:57:53] [INFO ] Deduced a trap composed of 135 places in 57 ms of which 1 ms to minimize.
[2024-05-29 10:57:54] [INFO ] Deduced a trap composed of 147 places in 67 ms of which 1 ms to minimize.
[2024-05-29 10:57:54] [INFO ] Deduced a trap composed of 161 places in 69 ms of which 1 ms to minimize.
[2024-05-29 10:57:54] [INFO ] Deduced a trap composed of 176 places in 71 ms of which 2 ms to minimize.
[2024-05-29 10:57:54] [INFO ] Deduced a trap composed of 190 places in 80 ms of which 1 ms to minimize.
[2024-05-29 10:57:55] [INFO ] Deduced a trap composed of 208 places in 84 ms of which 2 ms to minimize.
[2024-05-29 10:57:55] [INFO ] Deduced a trap composed of 224 places in 88 ms of which 2 ms to minimize.
[2024-05-29 10:57:55] [INFO ] Deduced a trap composed of 239 places in 89 ms of which 2 ms to minimize.
[2024-05-29 10:57:56] [INFO ] Deduced a trap composed of 251 places in 93 ms of which 2 ms to minimize.
[2024-05-29 10:57:56] [INFO ] Deduced a trap composed of 264 places in 107 ms of which 2 ms to minimize.
[2024-05-29 10:57:56] [INFO ] Deduced a trap composed of 279 places in 112 ms of which 2 ms to minimize.
[2024-05-29 10:57:57] [INFO ] Deduced a trap composed of 294 places in 117 ms of which 2 ms to minimize.
[2024-05-29 10:57:57] [INFO ] Deduced a trap composed of 308 places in 115 ms of which 2 ms to minimize.
[2024-05-29 10:57:57] [INFO ] Deduced a trap composed of 321 places in 133 ms of which 3 ms to minimize.
[2024-05-29 10:57:58] [INFO ] Deduced a trap composed of 339 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/357 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:57:58] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2024-05-29 10:57:58] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-29 10:57:58] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 3 ms to minimize.
[2024-05-29 10:57:58] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-29 10:57:59] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-29 10:57:59] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-29 10:57:59] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-29 10:57:59] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-29 10:57:59] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-29 10:57:59] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-05-29 10:57:59] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-29 10:57:59] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-29 10:57:59] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-05-29 10:58:00] [INFO ] Deduced a trap composed of 71 places in 90 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 933/1716 variables, and 371 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 40/40 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in SI_LTL mode, iteration 1 : 933/1834 places, 783/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61689 ms. Remains : 933/1834 places, 783/1684 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-03
Product exploration explored 100000 steps with 22755 reset in 218 ms.
Product exploration explored 100000 steps with 22552 reset in 229 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/933 stabilizing places and 2/783 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p1)]
RANDOM walk for 5244 steps (0 resets) in 54 ms. (95 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 326 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p1)]
[2024-05-29 10:58:04] [INFO ] Invariant cache hit.
[2024-05-29 10:58:05] [INFO ] [Real]Absence check using 331 positive place invariants in 177 ms returned sat
[2024-05-29 10:58:07] [INFO ] [Real]Absence check using state equation in 2035 ms returned sat
[2024-05-29 10:58:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:58:07] [INFO ] [Nat]Absence check using 331 positive place invariants in 85 ms returned sat
[2024-05-29 10:58:08] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2024-05-29 10:58:08] [INFO ] Computed and/alt/rep : 780/2113/780 causal constraints (skipped 0 transitions) in 43 ms.
[2024-05-29 10:58:08] [INFO ] Added : 32 causal constraints over 7 iterations in 543 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 18 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 10:58:08] [INFO ] Invariant cache hit.
[2024-05-29 10:58:09] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-05-29 10:58:09] [INFO ] Invariant cache hit.
[2024-05-29 10:58:10] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
[2024-05-29 10:58:10] [INFO ] Redundant transitions in 8 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 10:58:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 1/933 variables, 309/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:58:38] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-29 10:58:39] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-29 10:58:39] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:58:39] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:58:39] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-05-29 10:58:39] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2024-05-29 10:58:40] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 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 Real declared 933/1716 variables, and 338 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 1/933 variables, 309/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/933 variables, 7/338 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:58:50] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-05-29 10:58:59] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 10:58:59] [INFO ] Deduced a trap composed of 118 places in 53 ms of which 1 ms to minimize.
[2024-05-29 10:59:00] [INFO ] Deduced a trap composed of 135 places in 59 ms of which 1 ms to minimize.
[2024-05-29 10:59:00] [INFO ] Deduced a trap composed of 147 places in 63 ms of which 1 ms to minimize.
[2024-05-29 10:59:00] [INFO ] Deduced a trap composed of 161 places in 66 ms of which 2 ms to minimize.
[2024-05-29 10:59:00] [INFO ] Deduced a trap composed of 176 places in 76 ms of which 1 ms to minimize.
[2024-05-29 10:59:01] [INFO ] Deduced a trap composed of 190 places in 69 ms of which 1 ms to minimize.
[2024-05-29 10:59:01] [INFO ] Deduced a trap composed of 208 places in 83 ms of which 2 ms to minimize.
[2024-05-29 10:59:01] [INFO ] Deduced a trap composed of 224 places in 84 ms of which 2 ms to minimize.
[2024-05-29 10:59:02] [INFO ] Deduced a trap composed of 239 places in 90 ms of which 2 ms to minimize.
[2024-05-29 10:59:02] [INFO ] Deduced a trap composed of 251 places in 113 ms of which 2 ms to minimize.
[2024-05-29 10:59:02] [INFO ] Deduced a trap composed of 264 places in 102 ms of which 2 ms to minimize.
[2024-05-29 10:59:03] [INFO ] Deduced a trap composed of 279 places in 109 ms of which 2 ms to minimize.
[2024-05-29 10:59:03] [INFO ] Deduced a trap composed of 294 places in 105 ms of which 3 ms to minimize.
[2024-05-29 10:59:03] [INFO ] Deduced a trap composed of 308 places in 106 ms of which 3 ms to minimize.
[2024-05-29 10:59:04] [INFO ] Deduced a trap composed of 321 places in 119 ms of which 2 ms to minimize.
[2024-05-29 10:59:04] [INFO ] Deduced a trap composed of 339 places in 119 ms of which 4 ms to minimize.
[2024-05-29 10:59:04] [INFO ] Deduced a trap composed of 352 places in 132 ms of which 2 ms to minimize.
[2024-05-29 10:59:05] [INFO ] Deduced a trap composed of 373 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:59:05] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-29 10:59:05] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-29 10:59:05] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2024-05-29 10:59:05] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 2 ms to minimize.
[2024-05-29 10:59:06] [INFO ] Deduced a trap composed of 98 places in 74 ms of which 1 ms to minimize.
[2024-05-29 10:59:06] [INFO ] Deduced a trap composed of 154 places in 73 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 364 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 33/33 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61566 ms. Remains : 933/933 places, 783/783 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/933 stabilizing places and 2/783 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p1)]
RANDOM walk for 5112 steps (0 resets) in 67 ms. (75 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 327 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p1)]
[2024-05-29 10:59:11] [INFO ] Invariant cache hit.
[2024-05-29 10:59:11] [INFO ] [Real]Absence check using 331 positive place invariants in 181 ms returned sat
[2024-05-29 10:59:13] [INFO ] [Real]Absence check using state equation in 1986 ms returned sat
[2024-05-29 10:59:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:59:14] [INFO ] [Nat]Absence check using 331 positive place invariants in 87 ms returned sat
[2024-05-29 10:59:14] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2024-05-29 10:59:14] [INFO ] Computed and/alt/rep : 780/2113/780 causal constraints (skipped 0 transitions) in 43 ms.
[2024-05-29 10:59:15] [INFO ] Added : 32 causal constraints over 7 iterations in 545 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22465 reset in 216 ms.
Product exploration explored 100000 steps with 22575 reset in 229 ms.
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 17 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 10:59:15] [INFO ] Invariant cache hit.
[2024-05-29 10:59:16] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-29 10:59:16] [INFO ] Invariant cache hit.
[2024-05-29 10:59:16] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
[2024-05-29 10:59:16] [INFO ] Redundant transitions in 9 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 10:59:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 1/933 variables, 309/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:59:45] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-29 10:59:46] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-29 10:59:46] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:59:46] [INFO ] Deduced a trap composed of 59 places in 36 ms of which 1 ms to minimize.
[2024-05-29 10:59:46] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:59:46] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2024-05-29 10:59:47] [INFO ] Deduced a trap composed of 102 places in 51 ms of which 1 ms to minimize.
SMT process timed out in 30162ms, After SMT, problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 30169ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31395 ms. Remains : 933/933 places, 783/783 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-03 finished in 165869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G(!p1)))'
Support contains 4 out of 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1833 transition count 1471
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1621 transition count 1471
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1621 transition count 1321
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 724 place count 1471 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 725 place count 1470 transition count 1320
Iterating global reduction 2 with 1 rules applied. Total rules applied 726 place count 1470 transition count 1320
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 726 place count 1470 transition count 1319
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 728 place count 1469 transition count 1319
Performed 531 Post agglomeration using F-continuation condition.Transition count delta: 531
Deduced a syphon composed of 531 places in 1 ms
Reduce places removed 531 places and 0 transitions.
Iterating global reduction 2 with 1062 rules applied. Total rules applied 1790 place count 938 transition count 788
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1792 place count 936 transition count 786
Applied a total of 1792 rules in 189 ms. Remains 936 /1834 variables (removed 898) and now considering 786/1684 (removed 898) transitions.
// Phase 1: matrix 786 rows 936 cols
[2024-05-29 10:59:47] [INFO ] Computed 331 invariants in 2 ms
[2024-05-29 10:59:47] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-29 10:59:47] [INFO ] Invariant cache hit.
[2024-05-29 10:59:48] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
[2024-05-29 10:59:48] [INFO ] Redundant transitions in 8 ms returned []
Running 782 sub problems to find dead transitions.
[2024-05-29 10:59:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:00:07] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 11:00:07] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:00:07] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-05-29 11:00:07] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:00:08] [INFO ] Deduced a trap composed of 73 places in 38 ms of which 0 ms to minimize.
[2024-05-29 11:00:08] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:00:08] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:00:08] [INFO ] Deduced a trap composed of 113 places in 60 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 782 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 934/1722 variables, and 324 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 316/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 3 (OVERLAPS) 2/936 variables, 15/339 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:00:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:00:37] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-29 11:00:37] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-29 11:00:37] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:00:37] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-29 11:00:37] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/936 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 936/1722 variables, and 345 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 0/782 constraints, Known Traps: 14/14 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in SI_LTL mode, iteration 1 : 936/1834 places, 786/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61707 ms. Remains : 936/1834 places, 786/1684 transitions.
Stuttering acceptance computed with spot in 90 ms :[p1, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-06
Product exploration explored 100000 steps with 22645 reset in 514 ms.
Product exploration explored 100000 steps with 22805 reset in 676 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p1, (NOT p0)]
RANDOM walk for 4790 steps (0 resets) in 61 ms. (77 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[p1, (NOT p0)]
[2024-05-29 11:00:51] [INFO ] Invariant cache hit.
[2024-05-29 11:00:51] [INFO ] [Real]Absence check using 331 positive place invariants in 156 ms returned sat
[2024-05-29 11:00:53] [INFO ] [Real]Absence check using state equation in 1625 ms returned sat
[2024-05-29 11:00:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:00:53] [INFO ] [Nat]Absence check using 331 positive place invariants in 152 ms returned sat
[2024-05-29 11:00:55] [INFO ] [Nat]Absence check using state equation in 1424 ms returned sat
[2024-05-29 11:00:55] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:00:55] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:00:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2024-05-29 11:00:55] [INFO ] Computed and/alt/rep : 782/1521/782 causal constraints (skipped 0 transitions) in 36 ms.
[2024-05-29 11:01:08] [INFO ] Added : 675 causal constraints over 135 iterations in 12744 ms. Result :unknown
Could not prove EG p1
Support contains 4 out of 936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 936/936 places, 786/786 transitions.
Applied a total of 0 rules in 21 ms. Remains 936 /936 variables (removed 0) and now considering 786/786 (removed 0) transitions.
[2024-05-29 11:01:08] [INFO ] Invariant cache hit.
[2024-05-29 11:01:08] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-29 11:01:08] [INFO ] Invariant cache hit.
[2024-05-29 11:01:09] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2024-05-29 11:01:09] [INFO ] Redundant transitions in 8 ms returned []
Running 782 sub problems to find dead transitions.
[2024-05-29 11:01:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:01:27] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 11:01:28] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 3 ms to minimize.
[2024-05-29 11:01:28] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 0 ms to minimize.
[2024-05-29 11:01:28] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:01:28] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:01:28] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:01:29] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:01:29] [INFO ] Deduced a trap composed of 113 places in 57 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 934/1722 variables, and 324 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 316/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 3 (OVERLAPS) 2/936 variables, 15/339 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:01:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:01:58] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-29 11:01:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 11:01:58] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 11:01:58] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-29 11:01:58] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/936 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 936/1722 variables, and 345 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 0/782 constraints, Known Traps: 14/14 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61337 ms. Remains : 936/936 places, 786/786 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[p1, (NOT p0)]
RANDOM walk for 4935 steps (0 resets) in 45 ms. (107 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[p1, (NOT p0)]
[2024-05-29 11:02:10] [INFO ] Invariant cache hit.
[2024-05-29 11:02:11] [INFO ] [Real]Absence check using 331 positive place invariants in 170 ms returned sat
[2024-05-29 11:02:12] [INFO ] [Real]Absence check using state equation in 1621 ms returned sat
[2024-05-29 11:02:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:02:13] [INFO ] [Nat]Absence check using 331 positive place invariants in 146 ms returned sat
[2024-05-29 11:02:14] [INFO ] [Nat]Absence check using state equation in 1436 ms returned sat
[2024-05-29 11:02:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 11:02:14] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 11:02:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2024-05-29 11:02:15] [INFO ] Computed and/alt/rep : 782/1521/782 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-29 11:02:27] [INFO ] Added : 675 causal constraints over 135 iterations in 12750 ms. Result :unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 78 ms :[p1, (NOT p0)]
Product exploration explored 100000 steps with 22660 reset in 504 ms.
Product exploration explored 100000 steps with 22763 reset in 625 ms.
Support contains 4 out of 936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 936/936 places, 786/786 transitions.
Applied a total of 0 rules in 17 ms. Remains 936 /936 variables (removed 0) and now considering 786/786 (removed 0) transitions.
[2024-05-29 11:02:28] [INFO ] Invariant cache hit.
[2024-05-29 11:02:29] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-29 11:02:29] [INFO ] Invariant cache hit.
[2024-05-29 11:02:30] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2024-05-29 11:02:30] [INFO ] Redundant transitions in 8 ms returned []
Running 782 sub problems to find dead transitions.
[2024-05-29 11:02:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:02:48] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:02:48] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:02:48] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:02:48] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:02:49] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:02:49] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:02:49] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:02:49] [INFO ] Deduced a trap composed of 113 places in 55 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 934/1722 variables, and 324 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 316/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 3 (OVERLAPS) 2/936 variables, 15/339 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:03:18] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 11:03:18] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-29 11:03:18] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-29 11:03:18] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:03:18] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:03:18] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/936 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 936/1722 variables, and 345 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 0/782 constraints, Known Traps: 14/14 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61322 ms. Remains : 936/936 places, 786/786 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-06 finished in 223131 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 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1473
Reduce places removed 210 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 211 rules applied. Total rules applied 421 place count 1623 transition count 1472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 422 place count 1622 transition count 1472
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 422 place count 1622 transition count 1321
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 724 place count 1471 transition count 1321
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 726 place count 1469 transition count 1319
Iterating global reduction 3 with 2 rules applied. Total rules applied 728 place count 1469 transition count 1319
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 728 place count 1469 transition count 1317
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 732 place count 1467 transition count 1317
Performed 534 Post agglomeration using F-continuation condition.Transition count delta: 534
Deduced a syphon composed of 534 places in 0 ms
Reduce places removed 534 places and 0 transitions.
Iterating global reduction 3 with 1068 rules applied. Total rules applied 1800 place count 933 transition count 783
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1802 place count 931 transition count 781
Applied a total of 1802 rules in 226 ms. Remains 931 /1834 variables (removed 903) and now considering 781/1684 (removed 903) transitions.
// Phase 1: matrix 781 rows 931 cols
[2024-05-29 11:03:30] [INFO ] Computed 331 invariants in 8 ms
[2024-05-29 11:03:30] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-29 11:03:30] [INFO ] Invariant cache hit.
[2024-05-29 11:03:31] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
[2024-05-29 11:03:31] [INFO ] Redundant transitions in 10 ms returned []
Running 778 sub problems to find dead transitions.
[2024-05-29 11:03:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 328/328 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:03:50] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:03:50] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-29 11:03:50] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:03:50] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:03:50] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:03:51] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:03:51] [INFO ] Deduced a trap composed of 103 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:03:51] [INFO ] Deduced a trap composed of 113 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:03:51] [INFO ] Deduced a trap composed of 129 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:03:51] [INFO ] Deduced a trap composed of 144 places in 65 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 10/338 constraints. Problems are: Problem set: 0 solved, 778 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 930/1712 variables, and 338 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 328/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 778/778 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 778 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 328/328 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 10/338 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/930 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 3 (OVERLAPS) 1/931 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:04:25] [INFO ] Deduced a trap composed of 159 places in 68 ms of which 2 ms to minimize.
[2024-05-29 11:04:25] [INFO ] Deduced a trap composed of 176 places in 70 ms of which 2 ms to minimize.
[2024-05-29 11:04:25] [INFO ] Deduced a trap composed of 190 places in 74 ms of which 1 ms to minimize.
[2024-05-29 11:04:26] [INFO ] Deduced a trap composed of 204 places in 86 ms of which 1 ms to minimize.
[2024-05-29 11:04:26] [INFO ] Deduced a trap composed of 220 places in 86 ms of which 3 ms to minimize.
[2024-05-29 11:04:26] [INFO ] Deduced a trap composed of 234 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:04:27] [INFO ] Deduced a trap composed of 253 places in 99 ms of which 2 ms to minimize.
[2024-05-29 11:04:27] [INFO ] Deduced a trap composed of 262 places in 104 ms of which 3 ms to minimize.
[2024-05-29 11:04:27] [INFO ] Deduced a trap composed of 277 places in 105 ms of which 2 ms to minimize.
[2024-05-29 11:04:28] [INFO ] Deduced a trap composed of 292 places in 112 ms of which 3 ms to minimize.
[2024-05-29 11:04:28] [INFO ] Deduced a trap composed of 308 places in 117 ms of which 3 ms to minimize.
[2024-05-29 11:04:28] [INFO ] Deduced a trap composed of 315 places in 119 ms of which 2 ms to minimize.
[2024-05-29 11:04:29] [INFO ] Deduced a trap composed of 335 places in 126 ms of which 2 ms to minimize.
[2024-05-29 11:04:29] [INFO ] Deduced a trap composed of 353 places in 126 ms of which 3 ms to minimize.
[2024-05-29 11:04:30] [INFO ] Deduced a trap composed of 368 places in 134 ms of which 3 ms to minimize.
[2024-05-29 11:04:30] [INFO ] Deduced a trap composed of 378 places in 145 ms of which 3 ms to minimize.
[2024-05-29 11:04:30] [INFO ] Deduced a trap composed of 392 places in 148 ms of which 3 ms to minimize.
[2024-05-29 11:04:31] [INFO ] Deduced a trap composed of 408 places in 155 ms of which 4 ms to minimize.
[2024-05-29 11:04:31] [INFO ] Deduced a trap composed of 421 places in 161 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 931/1712 variables, and 360 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/778 constraints, Known Traps: 29/29 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 778 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in SI_LTL mode, iteration 1 : 931/1834 places, 781/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61577 ms. Remains : 931/1834 places, 781/1684 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-07
Stuttering criterion allowed to conclude after 2034 steps with 0 reset in 18 ms.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-07 finished in 61655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1473
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1623 transition count 1473
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 420 place count 1623 transition count 1323
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 720 place count 1473 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 721 place count 1472 transition count 1322
Iterating global reduction 2 with 1 rules applied. Total rules applied 722 place count 1472 transition count 1322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 722 place count 1472 transition count 1321
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 724 place count 1471 transition count 1321
Performed 536 Post agglomeration using F-continuation condition.Transition count delta: 536
Deduced a syphon composed of 536 places in 1 ms
Reduce places removed 536 places and 0 transitions.
Iterating global reduction 2 with 1072 rules applied. Total rules applied 1796 place count 935 transition count 785
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1798 place count 933 transition count 783
Applied a total of 1798 rules in 229 ms. Remains 933 /1834 variables (removed 901) and now considering 783/1684 (removed 901) transitions.
// Phase 1: matrix 783 rows 933 cols
[2024-05-29 11:04:32] [INFO ] Computed 331 invariants in 6 ms
[2024-05-29 11:04:32] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-29 11:04:32] [INFO ] Invariant cache hit.
[2024-05-29 11:04:33] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2024-05-29 11:04:33] [INFO ] Redundant transitions in 8 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:04:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:04:52] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:04:52] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-29 11:04:52] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:04:52] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:04:52] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:04:53] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:04:53] [INFO ] Deduced a trap composed of 103 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1716 variables, and 336 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 329/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (OVERLAPS) 2/933 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:05:23] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:05:23] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 11:05:23] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-05-29 11:05:27] [INFO ] Deduced a trap composed of 116 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:05:27] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:05:27] [INFO ] Deduced a trap composed of 143 places in 63 ms of which 2 ms to minimize.
[2024-05-29 11:05:27] [INFO ] Deduced a trap composed of 159 places in 69 ms of which 2 ms to minimize.
[2024-05-29 11:05:28] [INFO ] Deduced a trap composed of 177 places in 71 ms of which 1 ms to minimize.
[2024-05-29 11:05:28] [INFO ] Deduced a trap composed of 189 places in 79 ms of which 2 ms to minimize.
[2024-05-29 11:05:28] [INFO ] Deduced a trap composed of 203 places in 84 ms of which 3 ms to minimize.
[2024-05-29 11:05:28] [INFO ] Deduced a trap composed of 216 places in 87 ms of which 2 ms to minimize.
[2024-05-29 11:05:29] [INFO ] Deduced a trap composed of 233 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:05:29] [INFO ] Deduced a trap composed of 248 places in 97 ms of which 2 ms to minimize.
[2024-05-29 11:05:29] [INFO ] Deduced a trap composed of 262 places in 100 ms of which 3 ms to minimize.
[2024-05-29 11:05:30] [INFO ] Deduced a trap composed of 273 places in 106 ms of which 2 ms to minimize.
[2024-05-29 11:05:30] [INFO ] Deduced a trap composed of 300 places in 109 ms of which 3 ms to minimize.
[2024-05-29 11:05:31] [INFO ] Deduced a trap composed of 304 places in 118 ms of which 3 ms to minimize.
[2024-05-29 11:05:31] [INFO ] Deduced a trap composed of 324 places in 122 ms of which 3 ms to minimize.
[2024-05-29 11:05:31] [INFO ] Deduced a trap composed of 337 places in 118 ms of which 3 ms to minimize.
[2024-05-29 11:05:32] [INFO ] Deduced a trap composed of 347 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 779 unsolved
(s1 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 358 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 27/27 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in SI_LTL mode, iteration 1 : 933/1834 places, 783/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61561 ms. Remains : 933/1834 places, 783/1684 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-09
Product exploration explored 100000 steps with 74 reset in 701 ms.
Product exploration explored 100000 steps with 68 reset in 820 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4291 steps (2 resets) in 37 ms. (112 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 21 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 11:05:35] [INFO ] Invariant cache hit.
[2024-05-29 11:05:36] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-29 11:05:36] [INFO ] Invariant cache hit.
[2024-05-29 11:05:36] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
[2024-05-29 11:05:36] [INFO ] Redundant transitions in 13 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:05:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:05:55] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-29 11:05:55] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:05:55] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:05:55] [INFO ] Deduced a trap composed of 56 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:05:55] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:05:56] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:05:56] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1716 variables, and 336 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 329/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (OVERLAPS) 2/933 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:06:26] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 11:06:26] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 11:06:26] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 11:06:30] [INFO ] Deduced a trap composed of 116 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:06:30] [INFO ] Deduced a trap composed of 130 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:06:31] [INFO ] Deduced a trap composed of 143 places in 64 ms of which 1 ms to minimize.
[2024-05-29 11:06:31] [INFO ] Deduced a trap composed of 159 places in 68 ms of which 2 ms to minimize.
[2024-05-29 11:06:31] [INFO ] Deduced a trap composed of 177 places in 72 ms of which 1 ms to minimize.
[2024-05-29 11:06:31] [INFO ] Deduced a trap composed of 189 places in 78 ms of which 2 ms to minimize.
[2024-05-29 11:06:32] [INFO ] Deduced a trap composed of 203 places in 77 ms of which 2 ms to minimize.
[2024-05-29 11:06:32] [INFO ] Deduced a trap composed of 216 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:06:32] [INFO ] Deduced a trap composed of 233 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:06:33] [INFO ] Deduced a trap composed of 248 places in 97 ms of which 2 ms to minimize.
[2024-05-29 11:06:33] [INFO ] Deduced a trap composed of 262 places in 101 ms of which 3 ms to minimize.
[2024-05-29 11:06:33] [INFO ] Deduced a trap composed of 273 places in 99 ms of which 2 ms to minimize.
[2024-05-29 11:06:34] [INFO ] Deduced a trap composed of 300 places in 116 ms of which 2 ms to minimize.
[2024-05-29 11:06:34] [INFO ] Deduced a trap composed of 304 places in 113 ms of which 2 ms to minimize.
[2024-05-29 11:06:34] [INFO ] Deduced a trap composed of 324 places in 116 ms of which 2 ms to minimize.
[2024-05-29 11:06:35] [INFO ] Deduced a trap composed of 337 places in 117 ms of which 3 ms to minimize.
[2024-05-29 11:06:35] [INFO ] Deduced a trap composed of 347 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(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 1)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 1)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 1)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 0)timeout

(s283 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 358 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 27/27 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61330 ms. Remains : 933/933 places, 783/783 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 159 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 4317 steps (2 resets) in 46 ms. (91 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 73 reset in 642 ms.
Product exploration explored 100000 steps with 67 reset in 801 ms.
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 17 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 11:06:39] [INFO ] Invariant cache hit.
[2024-05-29 11:06:39] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-29 11:06:39] [INFO ] Invariant cache hit.
[2024-05-29 11:06:40] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2024-05-29 11:06:40] [INFO ] Redundant transitions in 7 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:06:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:06:58] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 11:06:59] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-29 11:06:59] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:06:59] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:06:59] [INFO ] Deduced a trap composed of 73 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:06:59] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:07:00] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1716 variables, and 336 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 329/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (OVERLAPS) 2/933 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:07:29] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:07:29] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 11:07:29] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-29 11:07:33] [INFO ] Deduced a trap composed of 116 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:07:34] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 2 ms to minimize.
[2024-05-29 11:07:34] [INFO ] Deduced a trap composed of 143 places in 56 ms of which 2 ms to minimize.
[2024-05-29 11:07:34] [INFO ] Deduced a trap composed of 159 places in 61 ms of which 2 ms to minimize.
[2024-05-29 11:07:34] [INFO ] Deduced a trap composed of 177 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:07:34] [INFO ] Deduced a trap composed of 189 places in 74 ms of which 1 ms to minimize.
[2024-05-29 11:07:35] [INFO ] Deduced a trap composed of 203 places in 78 ms of which 2 ms to minimize.
[2024-05-29 11:07:35] [INFO ] Deduced a trap composed of 216 places in 82 ms of which 2 ms to minimize.
[2024-05-29 11:07:35] [INFO ] Deduced a trap composed of 233 places in 93 ms of which 1 ms to minimize.
[2024-05-29 11:07:36] [INFO ] Deduced a trap composed of 248 places in 94 ms of which 3 ms to minimize.
[2024-05-29 11:07:36] [INFO ] Deduced a trap composed of 262 places in 101 ms of which 2 ms to minimize.
[2024-05-29 11:07:36] [INFO ] Deduced a trap composed of 273 places in 125 ms of which 2 ms to minimize.
[2024-05-29 11:07:37] [INFO ] Deduced a trap composed of 300 places in 122 ms of which 2 ms to minimize.
[2024-05-29 11:07:37] [INFO ] Deduced a trap composed of 304 places in 116 ms of which 3 ms to minimize.
[2024-05-29 11:07:37] [INFO ] Deduced a trap composed of 324 places in 122 ms of which 3 ms to minimize.
[2024-05-29 11:07:38] [INFO ] Deduced a trap composed of 337 places in 123 ms of which 3 ms to minimize.
[2024-05-29 11:07:38] [INFO ] Deduced a trap composed of 347 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 1)
(s9 0)
(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 1)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 1)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 1)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 1)
(s284 0)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 1)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 0)
(s335 1)
(s336 0)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 1)
(s346 0)
(s347 1)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 1)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 0)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 1)
(s381 0)
(s382 0)
(s383 1)
(s384 0)
(s385 1)
(s386 0)
(s387 0)
(s388 1)
(s389 0)
(s390 1)
(s391 0)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 0)
(s414 1)
(s415 0)
(s416 1)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 1)
(s422 0)
(s423 0)
(s424 1)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 1)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 1)
(s441 0)
(s442 1)
(s443 0)
(s444 0)
(s445 1)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 1)
(s451 0)
(s452 1)
(s453 0)
(s454 0)
(s455 1)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 0)
(s461 0)
(s462 1)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 1)
(s468 0)
(s469 1)
(s470 0)
(s471 1)
(s472 0)
(s473 1)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 1)
(s482 0)
(s483 1)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 0)
(s489 0)
(s490 1)
(s491 0)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 1)
(s499 0)
(s500 1)
(s501 0)
(s502 1)
(s503 0)
(s504 1)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 1)
(s510 0)
(s511 0)
(s512 1)
(s513 0)
(s514 1)
(s515 0)
(s516 0)
(s517 1)
(s518 0)
(s519 0)
(s520 0)
(s521 1)
(s522 0)
(s523 0)
(s524 1)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 1)
(s530 0)
(s531 1)
(s532 0)
(s533 1)
(s534 0)
(s535 1)
(s536 0)
(s537 0)
(s538 1)
(s539 0)
(s540 1)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 1)
(s546 0)
(s547 0)
(s548 1)
(s549 0)
(s550 0)
(s551 0)
(s552 1)
(s553 0)
(s554 0)
(s555 0)
(s556 1)
(s557 0)
(s558 0)
(s559 0)
(s560 1)
(s561 0)
(s562 1)
(s563 0)
(s564 1)
(s565 0)
(s566 1)
(s567 0)
(s568 0)
(s569 1)
(s570 0)
(s571 1)
(s572 0)
(s573 0)
(s574 1)
(s575 0)
(s576 1)
(s577 0)
(s578 0)
(s579 1)
(s580 0)
(s581 0)
(s582 0)
(s583 1)
(s584 0)
(s585 0)
(s586 1)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 1)
(s592 0)
(s593 1)
(s594 0)
(s595 1)
(s596 0)
(s597 1)
(s598 0)
(s599 0)
(s600 1)
(s601 0)
(s602 1)
(s603 0)
(s604 0)
(s605 1)
(s606 0)
(s607 1)
(s608 0)
(s609 0)
(s610 1)
(s611 0)
(s612 0)
(s613 0)
(s614 1)
(s615 0)
(s616 0)
(s617 1)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 1)
(s623 0)
(s624 1)
(s625 0)
(s626 1)
(s627 0)
(s628 1)
(s629 0)
(s630 0)
(s631 1)
(s632 0)
(s633 1)
(s634 0)
(s635 0)
(s636 1)
(s637 0)
(s638 1)
(s639 0)
(s640 0)
(s641 1)
(s642 0)
(s643 0)
(s644 0)
(s645 1)
(s646 0)
(s647 0)
(s648 1)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 1)
(s654 0)
(s655 1)
(s656 0)
(s657 1)
(s658 0)
(s659 1)
(s660 0)
(s661 0)
(s662 1)
(s663 0)
(s664 1)
(s665 0)
(s666 0)
(s667 1)
(s668 0)
(s669 1)
(s670 0)
(s671 0)
(s672 1)
(s673 0)
(s674 0)
(s675 0)
(s676 1)
(s677 0)
(s678 0)
(s679 1)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 1)
(s685 0)
(s686 1)
(s687 0)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 0)
(s693 1)
(s694 0)
(s695 1)
(s696 0)
(s697 0)
(s698 1)
(s699 0)
(s700 1)
(s701 0)
(s702 0)
(s703 1)
(s704 0)
(s705 0)
(s706 0)
(s707 1)
(s708 0)
(s709 0)
(s710 1)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 1)
(s716 0)
(s717 1)
(s718 0)
(s719 1)
(s720 0)
(s721 1)
(s722 0)
(s723 0)
(s724 1)
(s725 0)
(s726 1)
(s727 0)
(s728 0)
(s729 1)
(s730 0)
(s731 1)
(s732 0)
(s733 0)
(s734 1)
(s735 0)
(s736 0)
(s737 0)
(s738 1)
(s739 0)
(s740 0)
(s741 1)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 1)
(s747 0)
(s748 1)
(s749 0)
(s750 1)
(s751 0)
(s752 1)
(s753 0)
(s754 0)
(s755 1)
(s756 0)
(s757 1)
(s758 0)
(s759 0)
(s760 1)
(s761 0)
(s762 1)
(s763 0)
(s764 0)
(s765 1)
(s766 0)
(s767 0)
(s768 0)
(s769 1)
(s770 0)
(s771 0)
(s772 1)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 1)
(s778 0)
(s779 1)
(s780 0)
(s781 1)
(s782 0)
(s783 1)
(s784 0)
(s785 0)
(s786 1)
(s787 0)
(s788 1)
(s789 0)
(s790 0)
(s791 1)
(s792 0)
(s793 1)
(s794 0)
(s795 0)
(s796 1)
(s797 0)
(s798 0)
(s799 0)
(s800 1)
(s801 0)
(s802 0)
(s803 1)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 1)
(s809 0)
(s810 1)
(s811 0)
(s812 1)
(s813 0)
(s814 1)
(s815 0)
(s816 0)
(s817 1)
(s818 0)
(s819 1)
(s820 0)
(s821 0)
(s822 1)
(s823 0)
(s824 1)
(s825 0)
(s826 0)
(s827 1)
(s828 0)
(s829 0)
(s830 0)
(s831 1)
(s832 0)
(s833 0)
(s834 1)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 1)
(s840 0)
(s841 1)
(s842 0)
(s843 1)
(s844 0)
(s845 1)
(s846 0)
(s847 0)
(s848 1)
(s849 0)
(s850 1)
(s851 0)
(s852 0)
(s853 1)
(s854 0)
(s855 1)
(s856 0)
(s857 0)
(s858 1)
(s859 0)
(s860 0)
(s861 0)
(s862 1)
(s863 0)
(s864 0)
(s865 1)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 1)
(s871 0)
(s872 1)
(s873 0)
(s874 1)
(s875 0)
(s876 1)
(s877 0)
(s878 0)
(s879 1)
(s880 0)
(s881 1)
(s882 0)
(s883 0)
(s884 1)
(s885 0)
(s886 1)
(s887 0)
(s888 0)
(s889 1)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 1)
(s896 0)
(s897 0)
(s898 1)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 1)
(s904 0)
(s905 1)
(s906 0)
(s907 1)
(s908 0)
(s909 1)
(s910 0)
(s911 0)
(timeout
s912 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 358 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 27/27 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61285 ms. Remains : 933/933 places, 783/783 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-09 finished in 188543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1833 transition count 1471
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1621 transition count 1471
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 424 place count 1621 transition count 1322
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 722 place count 1472 transition count 1322
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 724 place count 1470 transition count 1320
Iterating global reduction 2 with 2 rules applied. Total rules applied 726 place count 1470 transition count 1320
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 726 place count 1470 transition count 1318
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 730 place count 1468 transition count 1318
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 1 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 2 with 1070 rules applied. Total rules applied 1800 place count 933 transition count 783
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1802 place count 931 transition count 781
Applied a total of 1802 rules in 214 ms. Remains 931 /1834 variables (removed 903) and now considering 781/1684 (removed 903) transitions.
// Phase 1: matrix 781 rows 931 cols
[2024-05-29 11:07:40] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 11:07:41] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-29 11:07:41] [INFO ] Invariant cache hit.
[2024-05-29 11:07:41] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
[2024-05-29 11:07:41] [INFO ] Redundant transitions in 7 ms returned []
Running 778 sub problems to find dead transitions.
[2024-05-29 11:07:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:07:59] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 11:07:59] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-29 11:07:59] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:07:59] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:08:00] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:08:00] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:08:00] [INFO ] Deduced a trap composed of 103 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:08:00] [INFO ] Deduced a trap composed of 113 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:08:00] [INFO ] Deduced a trap composed of 129 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:08:01] [INFO ] Deduced a trap composed of 144 places in 60 ms of which 1 ms to minimize.
[2024-05-29 11:08:01] [INFO ] Deduced a trap composed of 159 places in 64 ms of which 1 ms to minimize.
[2024-05-29 11:08:01] [INFO ] Deduced a trap composed of 175 places in 73 ms of which 2 ms to minimize.
[2024-05-29 11:08:01] [INFO ] Deduced a trap composed of 190 places in 77 ms of which 1 ms to minimize.
[2024-05-29 11:08:02] [INFO ] Deduced a trap composed of 206 places in 72 ms of which 2 ms to minimize.
[2024-05-29 11:08:02] [INFO ] Deduced a trap composed of 219 places in 81 ms of which 2 ms to minimize.
[2024-05-29 11:08:02] [INFO ] Deduced a trap composed of 232 places in 85 ms of which 1 ms to minimize.
[2024-05-29 11:08:03] [INFO ] Deduced a trap composed of 252 places in 84 ms of which 3 ms to minimize.
[2024-05-29 11:08:03] [INFO ] Deduced a trap composed of 267 places in 96 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 930/1712 variables, and 348 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 778/778 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 778 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:08:20] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:08:21] [INFO ] Deduced a trap composed of 101 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:08:21] [INFO ] Deduced a trap composed of 105 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:08:21] [INFO ] Deduced a trap composed of 99 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:08:21] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:08:21] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:08:21] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:08:21] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:08:21] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:08:21] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:08:21] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:08:21] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:08:21] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:08:22] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:08:22] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:08:22] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2024-05-29 11:08:22] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:08:22] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 2 ms to minimize.
[2024-05-29 11:08:22] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:08:22] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/930 variables, 20/368 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:08:30] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:08:31] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:08:31] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:08:31] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:08:31] [INFO ] Deduced a trap composed of 69 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:08:31] [INFO ] Deduced a trap composed of 130 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:08:32] [INFO ] Deduced a trap composed of 130 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:08:32] [INFO ] Deduced a trap composed of 132 places in 54 ms of which 2 ms to minimize.
[2024-05-29 11:08:32] [INFO ] Deduced a trap composed of 131 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/930 variables, 9/377 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 930/1712 variables, and 377 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/778 constraints, Known Traps: 47/47 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 778 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 931/1834 places, 781/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61453 ms. Remains : 931/1834 places, 781/1684 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-10
Product exploration explored 100000 steps with 181 reset in 645 ms.
Product exploration explored 100000 steps with 185 reset in 781 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 269 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 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 22 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2024-05-29 11:08:44] [INFO ] Invariant cache hit.
[2024-05-29 11:08:44] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-29 11:08:44] [INFO ] Invariant cache hit.
[2024-05-29 11:08:45] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
[2024-05-29 11:08:45] [INFO ] Redundant transitions in 10 ms returned []
Running 778 sub problems to find dead transitions.
[2024-05-29 11:08:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:09:04] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:09:04] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:09:04] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:09:04] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:09:04] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:09:05] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:09:05] [INFO ] Deduced a trap composed of 103 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:09:05] [INFO ] Deduced a trap composed of 113 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:09:05] [INFO ] Deduced a trap composed of 129 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:09:06] [INFO ] Deduced a trap composed of 144 places in 65 ms of which 2 ms to minimize.
[2024-05-29 11:09:06] [INFO ] Deduced a trap composed of 159 places in 68 ms of which 2 ms to minimize.
[2024-05-29 11:09:06] [INFO ] Deduced a trap composed of 175 places in 76 ms of which 2 ms to minimize.
[2024-05-29 11:09:06] [INFO ] Deduced a trap composed of 190 places in 80 ms of which 2 ms to minimize.
[2024-05-29 11:09:07] [INFO ] Deduced a trap composed of 206 places in 84 ms of which 2 ms to minimize.
[2024-05-29 11:09:07] [INFO ] Deduced a trap composed of 219 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:09:07] [INFO ] Deduced a trap composed of 232 places in 89 ms of which 2 ms to minimize.
[2024-05-29 11:09:08] [INFO ] Deduced a trap composed of 252 places in 104 ms of which 2 ms to minimize.
[2024-05-29 11:09:08] [INFO ] Deduced a trap composed of 267 places in 98 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 778 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 930/1712 variables, and 348 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 778/778 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 778 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:09:24] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:09:25] [INFO ] Deduced a trap composed of 101 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:09:25] [INFO ] Deduced a trap composed of 105 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:09:25] [INFO ] Deduced a trap composed of 99 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:09:25] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:09:25] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
[2024-05-29 11:09:25] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:09:25] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:09:25] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:09:25] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:09:25] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:09:25] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:09:26] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:09:26] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:09:26] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:09:26] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 2 ms to minimize.
[2024-05-29 11:09:26] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:09:26] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:09:26] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:09:26] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/930 variables, 20/368 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:09:35] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:09:35] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:09:35] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
[2024-05-29 11:09:35] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:09:35] [INFO ] Deduced a trap composed of 69 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:09:36] [INFO ] Deduced a trap composed of 130 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:09:36] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:09:36] [INFO ] Deduced a trap composed of 132 places in 60 ms of which 2 ms to minimize.
[2024-05-29 11:09:36] [INFO ] Deduced a trap composed of 131 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/930 variables, 9/377 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 930/1712 variables, and 377 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/778 constraints, Known Traps: 47/47 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 778 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61379 ms. Remains : 931/931 places, 781/781 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 187 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 202 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 115 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 185 reset in 642 ms.
Product exploration explored 100000 steps with 185 reset in 777 ms.
Support contains 1 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 19 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2024-05-29 11:09:47] [INFO ] Invariant cache hit.
[2024-05-29 11:09:48] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-29 11:09:48] [INFO ] Invariant cache hit.
[2024-05-29 11:09:49] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2024-05-29 11:09:49] [INFO ] Redundant transitions in 8 ms returned []
Running 778 sub problems to find dead transitions.
[2024-05-29 11:09:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:10:06] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:10:06] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 11:10:07] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:10:07] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:10:07] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:10:07] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:10:07] [INFO ] Deduced a trap composed of 103 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:10:08] [INFO ] Deduced a trap composed of 113 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:10:08] [INFO ] Deduced a trap composed of 129 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:10:08] [INFO ] Deduced a trap composed of 144 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:10:08] [INFO ] Deduced a trap composed of 159 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:10:09] [INFO ] Deduced a trap composed of 175 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:10:09] [INFO ] Deduced a trap composed of 190 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:10:09] [INFO ] Deduced a trap composed of 206 places in 75 ms of which 2 ms to minimize.
[2024-05-29 11:10:09] [INFO ] Deduced a trap composed of 219 places in 85 ms of which 1 ms to minimize.
[2024-05-29 11:10:10] [INFO ] Deduced a trap composed of 232 places in 93 ms of which 1 ms to minimize.
[2024-05-29 11:10:10] [INFO ] Deduced a trap composed of 252 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:10:10] [INFO ] Deduced a trap composed of 267 places in 98 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 778 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 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.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 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.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 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.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 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.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 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 0.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 1.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 1.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 0.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 1.0)
(s446 0.0)
(s447 1.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 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 1.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 1.0)
(s572 0.0)timeout

(s573 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 930/1712 variables, and 348 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 778/778 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 778 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 72 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 101 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 105 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 99 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:10:29] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:10:29] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:10:29] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:10:29] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:10:29] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:10:29] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:10:29] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:10:29] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:10:29] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/930 variables, 20/368 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:10:37] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:10:37] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:10:37] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:10:37] [INFO ] Deduced a trap composed of 72 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:10:37] [INFO ] Deduced a trap composed of 69 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:10:38] [INFO ] Deduced a trap composed of 130 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:10:38] [INFO ] Deduced a trap composed of 130 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:10:38] [INFO ] Deduced a trap composed of 132 places in 50 ms of which 2 ms to minimize.
[2024-05-29 11:10:38] [INFO ] Deduced a trap composed of 131 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/930 variables, 9/377 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 930/1712 variables, and 377 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/778 constraints, Known Traps: 47/47 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 778 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61374 ms. Remains : 931/931 places, 781/781 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-10 finished in 188835 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 4 out of 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1473
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1623 transition count 1473
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 420 place count 1623 transition count 1321
Deduced a syphon composed of 152 places in 2 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 724 place count 1471 transition count 1321
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 726 place count 1469 transition count 1319
Iterating global reduction 2 with 2 rules applied. Total rules applied 728 place count 1469 transition count 1319
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 728 place count 1469 transition count 1317
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 732 place count 1467 transition count 1317
Performed 531 Post agglomeration using F-continuation condition.Transition count delta: 531
Deduced a syphon composed of 531 places in 1 ms
Reduce places removed 531 places and 0 transitions.
Iterating global reduction 2 with 1062 rules applied. Total rules applied 1794 place count 936 transition count 786
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1796 place count 934 transition count 784
Applied a total of 1796 rules in 203 ms. Remains 934 /1834 variables (removed 900) and now considering 784/1684 (removed 900) transitions.
// Phase 1: matrix 784 rows 934 cols
[2024-05-29 11:10:49] [INFO ] Computed 331 invariants in 5 ms
[2024-05-29 11:10:49] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-29 11:10:49] [INFO ] Invariant cache hit.
[2024-05-29 11:10:50] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
[2024-05-29 11:10:50] [INFO ] Redundant transitions in 13 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:10:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 317/317 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:11:07] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:11:08] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:11:08] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:11:08] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:11:08] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 0 ms to minimize.
[2024-05-29 11:11:08] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:11:09] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:11:09] [INFO ] Deduced a trap composed of 113 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:11:09] [INFO ] Deduced a trap composed of 129 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:11:09] [INFO ] Deduced a trap composed of 144 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:11:10] [INFO ] Deduced a trap composed of 159 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:11:10] [INFO ] Deduced a trap composed of 175 places in 66 ms of which 1 ms to minimize.
[2024-05-29 11:11:10] [INFO ] Deduced a trap composed of 190 places in 76 ms of which 2 ms to minimize.
[2024-05-29 11:11:10] [INFO ] Deduced a trap composed of 206 places in 78 ms of which 2 ms to minimize.
[2024-05-29 11:11:11] [INFO ] Deduced a trap composed of 219 places in 82 ms of which 2 ms to minimize.
[2024-05-29 11:11:11] [INFO ] Deduced a trap composed of 232 places in 84 ms of which 2 ms to minimize.
[2024-05-29 11:11:11] [INFO ] Deduced a trap composed of 252 places in 84 ms of which 2 ms to minimize.
[2024-05-29 11:11:11] [INFO ] Deduced a trap composed of 267 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:11:12] [INFO ] Deduced a trap composed of 277 places in 96 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1718 variables, and 336 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 317/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 317/317 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:11:29] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 142 places in 62 ms of which 2 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 146 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:11:42] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:11:42] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:11:43] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:11:43] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:11:43] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:11:43] [INFO ] Deduced a trap composed of 104 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:11:43] [INFO ] Deduced a trap composed of 101 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:11:43] [INFO ] Deduced a trap composed of 99 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/932 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/1718 variables, and 347 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 317/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 30/30 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in SI_LTL mode, iteration 1 : 934/1834 places, 784/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61532 ms. Remains : 934/1834 places, 784/1684 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-13
Product exploration explored 100000 steps with 242 reset in 648 ms.
Product exploration explored 100000 steps with 250 reset in 791 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 3286 steps (0 resets) in 49 ms. (65 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 19 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2024-05-29 11:11:53] [INFO ] Invariant cache hit.
[2024-05-29 11:11:53] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-29 11:11:53] [INFO ] Invariant cache hit.
[2024-05-29 11:11:54] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2024-05-29 11:11:54] [INFO ] Redundant transitions in 24 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:11:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 317/317 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:12:12] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:12:12] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:12:12] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-05-29 11:12:12] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
[2024-05-29 11:12:13] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:12:13] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:12:13] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:12:13] [INFO ] Deduced a trap composed of 113 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:12:13] [INFO ] Deduced a trap composed of 129 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:12:14] [INFO ] Deduced a trap composed of 144 places in 66 ms of which 1 ms to minimize.
[2024-05-29 11:12:14] [INFO ] Deduced a trap composed of 159 places in 66 ms of which 1 ms to minimize.
[2024-05-29 11:12:14] [INFO ] Deduced a trap composed of 175 places in 71 ms of which 2 ms to minimize.
[2024-05-29 11:12:15] [INFO ] Deduced a trap composed of 190 places in 78 ms of which 2 ms to minimize.
[2024-05-29 11:12:15] [INFO ] Deduced a trap composed of 206 places in 82 ms of which 1 ms to minimize.
[2024-05-29 11:12:15] [INFO ] Deduced a trap composed of 219 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:12:15] [INFO ] Deduced a trap composed of 232 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:12:16] [INFO ] Deduced a trap composed of 252 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:12:16] [INFO ] Deduced a trap composed of 267 places in 98 ms of which 2 ms to minimize.
[2024-05-29 11:12:16] [INFO ] Deduced a trap composed of 277 places in 104 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1718 variables, and 336 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 317/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 317/317 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:12:33] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:12:34] [INFO ] Deduced a trap composed of 142 places in 62 ms of which 2 ms to minimize.
[2024-05-29 11:12:34] [INFO ] Deduced a trap composed of 146 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:12:46] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-05-29 11:12:46] [INFO ] Deduced a trap composed of 41 places in 25 ms of which 0 ms to minimize.
[2024-05-29 11:12:47] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:12:47] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:12:47] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:12:47] [INFO ] Deduced a trap composed of 104 places in 64 ms of which 15 ms to minimize.
[2024-05-29 11:12:47] [INFO ] Deduced a trap composed of 101 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:12:47] [INFO ] Deduced a trap composed of 99 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/932 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/1718 variables, and 347 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 317/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 30/30 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61336 ms. Remains : 934/934 places, 784/784 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 4654 steps (1 resets) in 45 ms. (101 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 230 reset in 650 ms.
Product exploration explored 100000 steps with 240 reset in 818 ms.
Support contains 4 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 16 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2024-05-29 11:12:57] [INFO ] Invariant cache hit.
[2024-05-29 11:12:57] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-29 11:12:57] [INFO ] Invariant cache hit.
[2024-05-29 11:12:58] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2024-05-29 11:12:58] [INFO ] Redundant transitions in 8 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:12:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 317/317 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:13:16] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:13:16] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:13:16] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2024-05-29 11:13:16] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 0 ms to minimize.
[2024-05-29 11:13:17] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:13:17] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:13:17] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:13:17] [INFO ] Deduced a trap composed of 113 places in 44 ms of which 2 ms to minimize.
[2024-05-29 11:13:17] [INFO ] Deduced a trap composed of 129 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:13:18] [INFO ] Deduced a trap composed of 144 places in 64 ms of which 1 ms to minimize.
[2024-05-29 11:13:18] [INFO ] Deduced a trap composed of 159 places in 67 ms of which 2 ms to minimize.
[2024-05-29 11:13:18] [INFO ] Deduced a trap composed of 175 places in 69 ms of which 2 ms to minimize.
[2024-05-29 11:13:18] [INFO ] Deduced a trap composed of 190 places in 67 ms of which 2 ms to minimize.
[2024-05-29 11:13:19] [INFO ] Deduced a trap composed of 206 places in 80 ms of which 2 ms to minimize.
[2024-05-29 11:13:19] [INFO ] Deduced a trap composed of 219 places in 75 ms of which 2 ms to minimize.
[2024-05-29 11:13:19] [INFO ] Deduced a trap composed of 232 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:13:20] [INFO ] Deduced a trap composed of 252 places in 93 ms of which 2 ms to minimize.
[2024-05-29 11:13:20] [INFO ] Deduced a trap composed of 267 places in 98 ms of which 2 ms to minimize.
[2024-05-29 11:13:20] [INFO ] Deduced a trap composed of 277 places in 101 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1718 variables, and 336 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 317/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 317/317 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:13:37] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
[2024-05-29 11:13:37] [INFO ] Deduced a trap composed of 142 places in 64 ms of which 1 ms to minimize.
[2024-05-29 11:13:38] [INFO ] Deduced a trap composed of 146 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:13:50] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:13:50] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2024-05-29 11:13:50] [INFO ] Deduced a trap composed of 101 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:13:50] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:13:51] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:13:51] [INFO ] Deduced a trap composed of 104 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:13:51] [INFO ] Deduced a trap composed of 101 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:13:51] [INFO ] Deduced a trap composed of 99 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/932 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/1718 variables, and 347 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 317/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 30/30 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61319 ms. Remains : 934/934 places, 784/784 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-13 finished in 189111 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(p0)||G(p1)) U !p1))'
Support contains 3 out of 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1833 transition count 1471
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1621 transition count 1471
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1621 transition count 1321
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 724 place count 1471 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 725 place count 1470 transition count 1320
Iterating global reduction 2 with 1 rules applied. Total rules applied 726 place count 1470 transition count 1320
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 726 place count 1470 transition count 1319
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 728 place count 1469 transition count 1319
Performed 534 Post agglomeration using F-continuation condition.Transition count delta: 534
Deduced a syphon composed of 534 places in 0 ms
Reduce places removed 534 places and 0 transitions.
Iterating global reduction 2 with 1068 rules applied. Total rules applied 1796 place count 935 transition count 785
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1798 place count 933 transition count 783
Applied a total of 1798 rules in 228 ms. Remains 933 /1834 variables (removed 901) and now considering 783/1684 (removed 901) transitions.
// Phase 1: matrix 783 rows 933 cols
[2024-05-29 11:13:58] [INFO ] Computed 331 invariants in 4 ms
[2024-05-29 11:13:59] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-29 11:13:59] [INFO ] Invariant cache hit.
[2024-05-29 11:13:59] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
[2024-05-29 11:13:59] [INFO ] Redundant transitions in 8 ms returned []
Running 781 sub problems to find dead transitions.
[2024-05-29 11:13:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-29 11:14:17] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 11:14:17] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-29 11:14:17] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:14:18] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:14:18] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 0 ms to minimize.
[2024-05-29 11:14:18] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:14:18] [INFO ] Deduced a trap composed of 103 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:14:18] [INFO ] Deduced a trap composed of 113 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:14:19] [INFO ] Deduced a trap composed of 129 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:14:19] [INFO ] Deduced a trap composed of 144 places in 58 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/933 variables, 10/341 constraints. Problems are: Problem set: 0 solved, 781 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 933/1716 variables, and 341 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/933 variables, 10/341 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/933 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 3 (OVERLAPS) 783/1716 variables, 933/1274 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1716 variables, 781/2055 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1716/1716 variables, and 2055 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 933/933 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 10/10 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 933/1834 places, 783/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61570 ms. Remains : 933/1834 places, 783/1684 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), p1, (OR (NOT p0) p1), true]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 571 steps with 0 reset in 4 ms.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-14 finished in 61725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p1))||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' '!(((F(p0)&&F(p1)) U 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)) U G(!p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
[2024-05-29 11:15:00] [INFO ] Flatten gal took : 56 ms
[2024-05-29 11:15:00] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-29 11:15:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1834 places, 1684 transitions and 4808 arcs took 11 ms.
Total runtime 1420615 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPs-PT-030B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1834
TRANSITIONS: 1684
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.026s, Sys 0.004s]


SAVING FILE /home/mcc/execution/410/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: 3605
MODEL NAME: /home/mcc/execution/410/model
1834 places, 1684 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
MEDDLY ERROR: Insufficient memory

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="ShieldPPPs-PT-030B"
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 ShieldPPPs-PT-030B, 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-171683758800475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-030B.tgz
mv ShieldPPPs-PT-030B 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 ;