MCC'2024- Execution of r528-tall-171683762301019

About the Execution of LTSMin+red for ShieldRVt-PT-040B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
829.436	754003.00	926514.00	1936.30	TTFFTFTFFTFFFFFF	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 489K 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 ShieldRVt-PT-040B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717277331159

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:28:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:28:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:28:52] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2024-06-01 21:28:52] [INFO ] Transformed 2003 places.
[2024-06-01 21:28:52] [INFO ] Transformed 2003 transitions.
[2024-06-01 21:28:52] [INFO ] Found NUPN structural information;
[2024-06-01 21:28:52] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVt-PT-040B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 426 places :
Symmetric choice reduction at 0 with 426 rule applications. Total rules 426 place count 1577 transition count 1577
Iterating global reduction 0 with 426 rules applied. Total rules applied 852 place count 1577 transition count 1577
Applied a total of 852 rules in 433 ms. Remains 1577 /2003 variables (removed 426) and now considering 1577/2003 (removed 426) transitions.
// Phase 1: matrix 1577 rows 1577 cols
[2024-06-01 21:28:53] [INFO ] Computed 161 invariants in 41 ms
[2024-06-01 21:28:53] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-06-01 21:28:53] [INFO ] Invariant cache hit.
[2024-06-01 21:28:55] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
Running 1576 sub problems to find dead transitions.
[2024-06-01 21:28:55] [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 1576/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1576 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1577 constraints, PredecessorRefiner: 1576/1576 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1576/3154 variables, and 0 constraints, problems are : Problem set: 0 solved, 1576 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1577 constraints, PredecessorRefiner: 0/1576 constraints, Known Traps: 0/0 constraints]
After SMT, in 60509ms problems are : Problem set: 0 solved, 1576 unsolved
Search for dead transitions found 0 dead transitions in 60542ms
Starting structural reductions in LTL mode, iteration 1 : 1577/2003 places, 1577/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62829 ms. Remains : 1577/2003 places, 1577/2003 transitions.
Support contains 33 out of 1577 places after structural reductions.
[2024-06-01 21:29:56] [INFO ] Flatten gal took : 134 ms
[2024-06-01 21:29:56] [INFO ] Flatten gal took : 62 ms
[2024-06-01 21:29:56] [INFO ] Input system was already deterministic with 1577 transitions.
RANDOM walk for 40000 steps (9 resets) in 1826 ms. (21 steps per ms) remains 8/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
[2024-06-01 21:29:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 233/249 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1328/1577 variables, 143/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1577 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1577/3154 variables, 1577/1738 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3154 variables, 0/1738 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/3154 variables, 0/1738 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3154/3154 variables, and 1738 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1858 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1577/1577 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 233/249 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1328/1577 variables, 143/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:29:59] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 41 ms to minimize.
[2024-06-01 21:30:00] [INFO ] Deduced a trap composed of 34 places in 309 ms of which 8 ms to minimize.
[2024-06-01 21:30:00] [INFO ] Deduced a trap composed of 43 places in 270 ms of which 9 ms to minimize.
[2024-06-01 21:30:00] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 6 ms to minimize.
[2024-06-01 21:30:01] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 4 ms to minimize.
[2024-06-01 21:30:01] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 4 ms to minimize.
[2024-06-01 21:30:01] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 4 ms to minimize.
[2024-06-01 21:30:01] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 3 ms to minimize.
[2024-06-01 21:30:01] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 4 ms to minimize.
[2024-06-01 21:30:02] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 3 ms to minimize.
[2024-06-01 21:30:02] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 3 ms to minimize.
[2024-06-01 21:30:02] [INFO ] Deduced a trap composed of 49 places in 143 ms of which 3 ms to minimize.
[2024-06-01 21:30:02] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
[2024-06-01 21:30:02] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
[2024-06-01 21:30:02] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 3 ms to minimize.
[2024-06-01 21:30:02] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 3 ms to minimize.
[2024-06-01 21:30:03] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1577 variables, 17/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1577 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1577/3154 variables, 1577/1755 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3154 variables, 8/1763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:30:04] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 5 ms to minimize.
SMT process timed out in 6907ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 1577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 433 transitions
Trivial Post-agglo rules discarded 433 transitions
Performed 433 trivial Post agglomeration. Transition count delta: 433
Iterating post reduction 0 with 433 rules applied. Total rules applied 433 place count 1577 transition count 1144
Reduce places removed 433 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 434 rules applied. Total rules applied 867 place count 1144 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 868 place count 1143 transition count 1143
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 311 Pre rules applied. Total rules applied 868 place count 1143 transition count 832
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1490 place count 832 transition count 832
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1493 place count 829 transition count 829
Iterating global reduction 3 with 3 rules applied. Total rules applied 1496 place count 829 transition count 829
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1496 place count 829 transition count 826
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1502 place count 826 transition count 826
Performed 362 Post agglomeration using F-continuation condition.Transition count delta: 362
Deduced a syphon composed of 362 places in 1 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 3 with 724 rules applied. Total rules applied 2226 place count 464 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2227 place count 464 transition count 463
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2229 place count 463 transition count 462
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2431 place count 362 transition count 557
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2463 place count 346 transition count 573
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2464 place count 346 transition count 572
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2466 place count 346 transition count 570
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2468 place count 344 transition count 570
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2470 place count 344 transition count 568
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2472 place count 344 transition count 568
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2473 place count 343 transition count 567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2474 place count 342 transition count 567
Applied a total of 2474 rules in 378 ms. Remains 342 /1577 variables (removed 1235) and now considering 567/1577 (removed 1010) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 342/1577 places, 567/1577 transitions.
RANDOM walk for 40000 steps (12 resets) in 493 ms. (80 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
// Phase 1: matrix 567 rows 342 cols
[2024-06-01 21:30:05] [INFO ] Computed 160 invariants in 3 ms
[2024-06-01 21:30:05] [INFO ] State equation strengthened by 51 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/27 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/70 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 124/194 variables, 70/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 44/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 156/350 variables, 52/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 25/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/352 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 155/507 variables, 60/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 27/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 4/511 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/511 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 111/622 variables, 44/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/622 variables, 21/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/622 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/622 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 83/705 variables, 33/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/705 variables, 15/431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/705 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/706 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/706 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/706 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 41/747 variables, 18/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/747 variables, 9/460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/747 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 25/772 variables, 10/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/772 variables, 5/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/772 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 22/794 variables, 8/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/794 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/794 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 22/816 variables, 8/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/816 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/816 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 22/838 variables, 8/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/838 variables, 4/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/838 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 22/860 variables, 8/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/860 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/860 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 22/882 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/882 variables, 4/535 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/882 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 19/901 variables, 8/543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/901 variables, 4/547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/901 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 8/909 variables, 4/551 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/909 variables, 2/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/909 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 0/909 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 909/909 variables, and 553 constraints, problems are : Problem set: 0 solved, 3 unsolved in 855 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 342/342 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/27 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/70 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 124/194 variables, 70/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 44/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 156/350 variables, 52/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 25/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/352 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 155/507 variables, 60/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 27/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/507 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 4/511 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/511 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 111/622 variables, 44/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/622 variables, 21/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/622 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/622 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 83/705 variables, 33/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/705 variables, 15/434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/705 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 1/706 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/706 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/706 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 41/747 variables, 18/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/747 variables, 9/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/747 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 25/772 variables, 10/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/772 variables, 5/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/772 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 22/794 variables, 8/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/794 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/794 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 22/816 variables, 8/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/816 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/816 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 22/838 variables, 8/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/838 variables, 4/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/838 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 22/860 variables, 8/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/860 variables, 4/526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/860 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 22/882 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/882 variables, 4/538 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/882 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 19/901 variables, 8/546 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/901 variables, 4/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/901 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 8/909 variables, 4/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/909 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/909 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 0/909 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 909/909 variables, and 556 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 342/342 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1900ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 479 ms.
Support contains 8 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 567/567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 342 transition count 563
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 338 transition count 563
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 338 transition count 561
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 336 transition count 561
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 334 transition count 559
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 333 transition count 561
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 333 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 332 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 330 transition count 558
Applied a total of 22 rules in 52 ms. Remains 330 /342 variables (removed 12) and now considering 558/567 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 330/342 places, 558/567 transitions.
RANDOM walk for 40000 steps (13 resets) in 357 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 257249 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 3
Probabilistic random walk after 257249 steps, saw 164246 distinct states, run finished after 3005 ms. (steps per millisecond=85 ) properties seen :0
// Phase 1: matrix 558 rows 330 cols
[2024-06-01 21:30:10] [INFO ] Computed 160 invariants in 2 ms
[2024-06-01 21:30:10] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/26 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 59/85 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 179/264 variables, 58/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 29/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 211/475 variables, 80/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 40/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 130/605 variables, 54/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/605 variables, 27/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/605 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 80/685 variables, 32/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/685 variables, 16/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/685 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 41/726 variables, 18/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/726 variables, 9/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/726 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 25/751 variables, 10/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/751 variables, 5/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/751 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 22/773 variables, 8/423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/773 variables, 4/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/773 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 22/795 variables, 8/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/795 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/795 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 22/817 variables, 8/447 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/817 variables, 4/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/817 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 22/839 variables, 8/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/839 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/839 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 22/861 variables, 8/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/861 variables, 4/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/861 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 19/880 variables, 8/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/880 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/880 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 8/888 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/888 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/888 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 0/888 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 888/888 variables, and 493 constraints, problems are : Problem set: 0 solved, 3 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 330/330 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/26 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 59/85 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 179/264 variables, 58/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 29/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 211/475 variables, 80/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 40/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 130/605 variables, 54/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/605 variables, 27/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/605 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 80/685 variables, 32/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/685 variables, 16/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/685 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 41/726 variables, 18/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/726 variables, 9/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/726 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 25/751 variables, 10/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/751 variables, 5/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/751 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 22/773 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/773 variables, 4/430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/773 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 22/795 variables, 8/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/795 variables, 4/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/795 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 22/817 variables, 8/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/817 variables, 4/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/817 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 22/839 variables, 8/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/839 variables, 4/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/839 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 22/861 variables, 8/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/861 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/861 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 19/880 variables, 8/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/880 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/880 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 8/888 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/888 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/888 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 0/888 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 888/888 variables, and 496 constraints, problems are : Problem set: 0 solved, 3 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 330/330 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1271ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 204 ms.
Support contains 8 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 558/558 transitions.
Applied a total of 0 rules in 8 ms. Remains 330 /330 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 330/330 places, 558/558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 558/558 transitions.
Applied a total of 0 rules in 7 ms. Remains 330 /330 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-06-01 21:30:12] [INFO ] Invariant cache hit.
[2024-06-01 21:30:12] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 21:30:12] [INFO ] Invariant cache hit.
[2024-06-01 21:30:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 21:30:12] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-06-01 21:30:12] [INFO ] Redundant transitions in 28 ms returned []
Running 554 sub problems to find dead transitions.
[2024-06-01 21:30:12] [INFO ] Invariant cache hit.
[2024-06-01 21:30:12] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 1/330 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 558/888 variables, 330/490 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 7 (OVERLAPS) 0/888 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Real declared 888/888 variables, and 493 constraints, problems are : Problem set: 0 solved, 554 unsolved in 27634 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 330/330 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 1/330 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 558/888 variables, 330/490 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 554/1047 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/888 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 8 (OVERLAPS) 0/888 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Int declared 888/888 variables, and 1047 constraints, problems are : Problem set: 0 solved, 554 unsolved in 27212 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 330/330 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
After SMT, in 55032ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 55039ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55629 ms. Remains : 330/330 places, 558/558 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 153 edges and 330 vertex of which 4 / 330 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1116 edges and 328 vertex of which 326 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 150 edges and 324 vertex of which 4 / 324 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 322 transition count 549
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 149 edges and 320 vertex of which 6 / 320 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 317 transition count 540
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 147 edges and 314 vertex of which 8 / 314 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 310 transition count 529
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 143 edges and 306 vertex of which 8 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 302 transition count 515
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 139 edges and 298 vertex of which 8 / 298 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 294 transition count 501
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 135 edges and 290 vertex of which 8 / 290 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 286 transition count 487
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 131 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 278 transition count 473
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 127 edges and 274 vertex of which 8 / 274 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 270 transition count 459
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 123 edges and 266 vertex of which 8 / 266 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 262 transition count 445
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 119 edges and 258 vertex of which 8 / 258 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 254 transition count 431
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 115 edges and 250 vertex of which 8 / 250 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 246 transition count 417
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 111 edges and 242 vertex of which 8 / 242 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 238 transition count 403
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 106 edges and 235 vertex of which 6 / 235 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 17 rules applied. Total rules applied 223 place count 232 transition count 390
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 103 edges and 229 vertex of which 6 / 229 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 16 rules applied. Total rules applied 239 place count 226 transition count 378
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 101 edges and 223 vertex of which 6 / 223 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 14 with 15 rules applied. Total rules applied 254 place count 220 transition count 367
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 98 edges and 218 vertex of which 6 / 218 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 13 rules applied. Total rules applied 267 place count 215 transition count 357
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 96 edges and 212 vertex of which 8 / 212 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 15 rules applied. Total rules applied 282 place count 208 transition count 346
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 92 edges and 205 vertex of which 6 / 205 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 18 rules applied. Total rules applied 300 place count 202 transition count 332
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 90 edges and 199 vertex of which 6 / 199 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 315 place count 196 transition count 321
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 87 edges and 193 vertex of which 4 / 193 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 19 with 17 rules applied. Total rules applied 332 place count 191 transition count 308
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 86 edges and 189 vertex of which 6 / 189 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 20 with 10 rules applied. Total rules applied 342 place count 186 transition count 301
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 84 edges and 183 vertex of which 8 / 183 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 16 rules applied. Total rules applied 358 place count 179 transition count 289
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 80 edges and 175 vertex of which 6 / 175 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 377 place count 172 transition count 275
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 524 edges and 169 vertex of which 163 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Graph (trivial) has 73 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 16 rules applied. Total rules applied 393 place count 161 transition count 257
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 70 edges and 159 vertex of which 2 / 159 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 24 with 9 rules applied. Total rules applied 402 place count 158 transition count 251
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 5 rules applied. Total rules applied 407 place count 157 transition count 247
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 26 with 3 Pre rules applied. Total rules applied 407 place count 157 transition count 244
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 415 place count 152 transition count 244
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 6 rules applied. Total rules applied 421 place count 148 transition count 242
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 467 edges and 148 vertex of which 146 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 26 with 6 rules applied. Total rules applied 427 place count 146 transition count 236
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 428 place count 146 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 28 with 1 rules applied. Total rules applied 429 place count 146 transition count 234
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 28 with 1 rules applied. Total rules applied 430 place count 146 transition count 234
Applied a total of 430 rules in 123 ms. Remains 146 /330 variables (removed 184) and now considering 234/558 (removed 324) transitions.
Running SMT prover for 3 properties.
[2024-06-01 21:31:08] [INFO ] Flow matrix only has 233 transitions (discarded 1 similar events)
// Phase 1: matrix 233 rows 146 cols
[2024-06-01 21:31:08] [INFO ] Computed 70 invariants in 2 ms
[2024-06-01 21:31:08] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 21:31:08] [INFO ] [Nat]Absence check using 70 positive place invariants in 8 ms returned sat
[2024-06-01 21:31:08] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 21:31:08] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 21:31:08] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 357 ms.
Computed a total of 483 stabilizing places and 483 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1567 transition count 1567
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1567 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1566 transition count 1566
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1566 transition count 1566
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1565 transition count 1565
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1565 transition count 1565
Applied a total of 24 rules in 181 ms. Remains 1565 /1577 variables (removed 12) and now considering 1565/1577 (removed 12) transitions.
// Phase 1: matrix 1565 rows 1565 cols
[2024-06-01 21:31:08] [INFO ] Computed 161 invariants in 15 ms
[2024-06-01 21:31:09] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-01 21:31:09] [INFO ] Invariant cache hit.
[2024-06-01 21:31:10] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
Running 1564 sub problems to find dead transitions.
[2024-06-01 21:31:10] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1564/3130 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1565 constraints, PredecessorRefiner: 1564/1564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1564 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)timeout

(s1420 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1564/3130 variables, and 0 constraints, problems are : Problem set: 0 solved, 1564 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1565 constraints, PredecessorRefiner: 0/1564 constraints, Known Traps: 0/0 constraints]
After SMT, in 60379ms problems are : Problem set: 0 solved, 1564 unsolved
Search for dead transitions found 0 dead transitions in 60391ms
Starting structural reductions in LTL mode, iteration 1 : 1565/1577 places, 1565/1577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61980 ms. Remains : 1565/1577 places, 1565/1577 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 423 ms.
Product exploration explored 100000 steps with 33333 reset in 397 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLCardinality-01 finished in 63151 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 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 445 place count 1576 transition count 1131
Reduce places removed 445 places and 0 transitions.
Iterating post reduction 1 with 445 rules applied. Total rules applied 890 place count 1131 transition count 1131
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 311 Pre rules applied. Total rules applied 890 place count 1131 transition count 820
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 2 with 622 rules applied. Total rules applied 1512 place count 820 transition count 820
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1520 place count 812 transition count 812
Iterating global reduction 2 with 8 rules applied. Total rules applied 1528 place count 812 transition count 812
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1528 place count 812 transition count 806
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1540 place count 806 transition count 806
Performed 361 Post agglomeration using F-continuation condition.Transition count delta: 361
Deduced a syphon composed of 361 places in 0 ms
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 2 with 722 rules applied. Total rules applied 2262 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2263 place count 445 transition count 444
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2265 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2467 place count 343 transition count 542
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2503 place count 325 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2505 place count 323 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2506 place count 322 transition count 558
Applied a total of 2506 rules in 189 ms. Remains 322 /1577 variables (removed 1255) and now considering 558/1577 (removed 1019) transitions.
// Phase 1: matrix 558 rows 322 cols
[2024-06-01 21:32:11] [INFO ] Computed 160 invariants in 4 ms
[2024-06-01 21:32:12] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-01 21:32:12] [INFO ] Invariant cache hit.
[2024-06-01 21:32:12] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-06-01 21:32:12] [INFO ] Redundant transitions in 4 ms returned []
Running 553 sub problems to find dead transitions.
[2024-06-01 21:32:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 2 (OVERLAPS) 1/322 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 4 (OVERLAPS) 557/879 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 6 (OVERLAPS) 0/879 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 553 unsolved
No progress, stopping.
After SMT solving in domain Real declared 879/880 variables, and 482 constraints, problems are : Problem set: 0 solved, 553 unsolved in 27206 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 553/553 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 553 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 2 (OVERLAPS) 1/322 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 4 (OVERLAPS) 557/879 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 553/1035 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 7 (OVERLAPS) 0/879 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 553 unsolved
No progress, stopping.
After SMT solving in domain Int declared 879/880 variables, and 1035 constraints, problems are : Problem set: 0 solved, 553 unsolved in 25414 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 553/553 constraints, Known Traps: 0/0 constraints]
After SMT, in 52803ms problems are : Problem set: 0 solved, 553 unsolved
Search for dead transitions found 0 dead transitions in 52810ms
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1577 places, 558/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53541 ms. Remains : 322/1577 places, 558/1577 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-02 finished in 53667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((G(!p0) U p1))&&X(G(p2)))))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 442 rules applied. Total rules applied 442 place count 1576 transition count 1134
Reduce places removed 442 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 443 rules applied. Total rules applied 885 place count 1134 transition count 1133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 886 place count 1133 transition count 1133
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 310 Pre rules applied. Total rules applied 886 place count 1133 transition count 823
Deduced a syphon composed of 310 places in 1 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 1506 place count 823 transition count 823
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1514 place count 815 transition count 815
Iterating global reduction 3 with 8 rules applied. Total rules applied 1522 place count 815 transition count 815
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1522 place count 815 transition count 809
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1534 place count 809 transition count 809
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 2254 place count 449 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2255 place count 449 transition count 448
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2257 place count 448 transition count 447
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2459 place count 347 transition count 547
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 2495 place count 329 transition count 565
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2497 place count 327 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2498 place count 326 transition count 563
Applied a total of 2498 rules in 175 ms. Remains 326 /1577 variables (removed 1251) and now considering 563/1577 (removed 1014) transitions.
// Phase 1: matrix 563 rows 326 cols
[2024-06-01 21:33:05] [INFO ] Computed 160 invariants in 5 ms
[2024-06-01 21:33:05] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-06-01 21:33:05] [INFO ] Invariant cache hit.
[2024-06-01 21:33:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 21:33:06] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-06-01 21:33:06] [INFO ] Redundant transitions in 4 ms returned []
Running 558 sub problems to find dead transitions.
[2024-06-01 21:33:06] [INFO ] Invariant cache hit.
[2024-06-01 21:33:06] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 1/326 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 558 unsolved
[2024-06-01 21:33:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 21:33:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (OVERLAPS) 562/888 variables, 326/488 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/888 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (OVERLAPS) 0/888 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 558 unsolved
No progress, stopping.
After SMT solving in domain Real declared 888/889 variables, and 492 constraints, problems are : Problem set: 0 solved, 558 unsolved in 28483 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 326/326 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (OVERLAPS) 1/326 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (OVERLAPS) 562/888 variables, 326/488 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/888 variables, 558/1050 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 9 (OVERLAPS) 0/888 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 558 unsolved
No progress, stopping.
After SMT solving in domain Int declared 888/889 variables, and 1050 constraints, problems are : Problem set: 0 solved, 558 unsolved in 24330 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 326/326 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 2/2 constraints]
After SMT, in 52982ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 52988ms
Starting structural reductions in SI_LTL mode, iteration 1 : 326/1577 places, 563/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53813 ms. Remains : 326/1577 places, 563/1577 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-03 finished in 54145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p1)))&&F(p2)))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1564 transition count 1564
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1564 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1563 transition count 1563
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1563 transition count 1563
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1562 transition count 1562
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1562 transition count 1562
Applied a total of 30 rules in 179 ms. Remains 1562 /1577 variables (removed 15) and now considering 1562/1577 (removed 15) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-06-01 21:33:59] [INFO ] Computed 161 invariants in 12 ms
[2024-06-01 21:33:59] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-06-01 21:33:59] [INFO ] Invariant cache hit.
[2024-06-01 21:34:01] [INFO ] Implicit Places using invariants and state equation in 1169 ms returned []
Implicit Place search using SMT with State Equation took 1492 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-06-01 21:34:01] [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 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60334ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60348ms
Starting structural reductions in LTL mode, iteration 1 : 1562/1577 places, 1562/1577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62024 ms. Remains : 1562/1577 places, 1562/1577 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-07
Product exploration explored 100000 steps with 824 reset in 293 ms.
Product exploration explored 100000 steps with 735 reset in 368 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1562 stabilizing places and 478/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 280 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 973 steps (0 resets) in 13 ms. (69 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 13 factoid took 345 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p2), (NOT p2)]
[2024-06-01 21:35:03] [INFO ] Invariant cache hit.
[2024-06-01 21:35:03] [INFO ] [Real]Absence check using 161 positive place invariants in 111 ms returned sat
[2024-06-01 21:35:07] [INFO ] [Real]Absence check using state equation in 3493 ms returned sat
[2024-06-01 21:35:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:35:08] [INFO ] [Nat]Absence check using 161 positive place invariants in 122 ms returned sat
[2024-06-01 21:35:11] [INFO ] [Nat]Absence check using state equation in 3865 ms returned sat
[2024-06-01 21:35:12] [INFO ] Computed and/alt/rep : 1561/2283/1561 causal constraints (skipped 0 transitions) in 77 ms.
[2024-06-01 21:35:22] [INFO ] Added : 590 causal constraints over 118 iterations in 10456 ms. Result :unknown
Could not prove EG (NOT p2)
Support contains 2 out of 1562 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 436 transitions
Trivial Post-agglo rules discarded 436 transitions
Performed 436 trivial Post agglomeration. Transition count delta: 436
Iterating post reduction 0 with 436 rules applied. Total rules applied 436 place count 1561 transition count 1125
Reduce places removed 436 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 437 rules applied. Total rules applied 873 place count 1125 transition count 1124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 874 place count 1124 transition count 1124
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 874 place count 1124 transition count 805
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1512 place count 805 transition count 805
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 0 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 3 with 710 rules applied. Total rules applied 2222 place count 450 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2223 place count 450 transition count 449
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2225 place count 449 transition count 448
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2427 place count 348 transition count 548
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 2463 place count 330 transition count 566
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2464 place count 330 transition count 566
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2466 place count 328 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2467 place count 327 transition count 564
Applied a total of 2467 rules in 164 ms. Remains 327 /1562 variables (removed 1235) and now considering 564/1562 (removed 998) transitions.
// Phase 1: matrix 564 rows 327 cols
[2024-06-01 21:35:22] [INFO ] Computed 160 invariants in 1 ms
[2024-06-01 21:35:22] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-01 21:35:22] [INFO ] Invariant cache hit.
[2024-06-01 21:35:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 21:35:23] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2024-06-01 21:35:23] [INFO ] Redundant transitions in 4 ms returned []
Running 558 sub problems to find dead transitions.
[2024-06-01 21:35:23] [INFO ] Invariant cache hit.
[2024-06-01 21:35:23] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 2/327 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (OVERLAPS) 563/890 variables, 327/487 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 9/496 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 7 (OVERLAPS) 0/890 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 558 unsolved
No progress, stopping.
After SMT solving in domain Real declared 890/891 variables, and 496 constraints, problems are : Problem set: 0 solved, 558 unsolved in 26244 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 327/327 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (OVERLAPS) 2/327 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 4 (OVERLAPS) 563/890 variables, 327/487 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 9/496 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 558/1054 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/890 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 8 (OVERLAPS) 0/890 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 558 unsolved
No progress, stopping.
After SMT solving in domain Int declared 890/891 variables, and 1054 constraints, problems are : Problem set: 0 solved, 558 unsolved in 28573 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 327/327 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 0/0 constraints]
After SMT, in 54984ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 54993ms
Starting structural reductions in SI_LTL mode, iteration 1 : 327/1562 places, 564/1562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55894 ms. Remains : 327/1562 places, 564/1562 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/327 stabilizing places and 4/564 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 6690 steps (2 resets) in 75 ms. (88 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
[2024-06-01 21:36:19] [INFO ] Invariant cache hit.
[2024-06-01 21:36:19] [INFO ] [Real]Absence check using 160 positive place invariants in 37 ms returned sat
[2024-06-01 21:36:19] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2024-06-01 21:36:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:36:19] [INFO ] [Nat]Absence check using 160 positive place invariants in 37 ms returned sat
[2024-06-01 21:36:19] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2024-06-01 21:36:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 21:36:19] [INFO ] [Nat]Added 9 Read/Feed constraints in 5 ms returned sat
[2024-06-01 21:36:19] [INFO ] Computed and/alt/rep : 554/1784/554 causal constraints (skipped 4 transitions) in 31 ms.
[2024-06-01 21:36:23] [INFO ] Added : 441 causal constraints over 89 iterations in 3730 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-07 finished in 144286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p0)))))'
Support contains 2 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1565 transition count 1565
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1565 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1564 transition count 1564
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1564 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1563 transition count 1563
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1563 transition count 1563
Applied a total of 28 rules in 190 ms. Remains 1563 /1577 variables (removed 14) and now considering 1563/1577 (removed 14) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2024-06-01 21:36:23] [INFO ] Computed 161 invariants in 10 ms
[2024-06-01 21:36:24] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-06-01 21:36:24] [INFO ] Invariant cache hit.
[2024-06-01 21:36:25] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
Running 1562 sub problems to find dead transitions.
[2024-06-01 21:36:25] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1562/3126 variables, and 0 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1563 constraints, PredecessorRefiner: 1562/1562 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 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 1562/3126 variables, and 0 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1563 constraints, PredecessorRefiner: 0/1562 constraints, Known Traps: 0/0 constraints]
After SMT, in 60326ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 60339ms
Starting structural reductions in LTL mode, iteration 1 : 1563/1577 places, 1563/1577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62088 ms. Remains : 1563/1577 places, 1563/1577 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-08
Product exploration explored 100000 steps with 2 reset in 438 ms.
Stack based approach found an accepted trace after 6385 steps with 0 reset with depth 6386 and stack size 6011 in 33 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-08 finished in 62710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p1))&&p0))))'
Support contains 4 out of 1577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1563 transition count 1563
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1563 transition count 1563
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1562 transition count 1562
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1562 transition count 1562
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1561 transition count 1561
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1561 transition count 1561
Applied a total of 32 rules in 188 ms. Remains 1561 /1577 variables (removed 16) and now considering 1561/1577 (removed 16) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2024-06-01 21:37:26] [INFO ] Computed 161 invariants in 14 ms
[2024-06-01 21:37:27] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-01 21:37:27] [INFO ] Invariant cache hit.
[2024-06-01 21:37:28] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
Running 1560 sub problems to find dead transitions.
[2024-06-01 21:37:28] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 0/0 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Starting structural reductions in LTL mode, iteration 1 : 1561/1577 places, 1561/1577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61980 ms. Remains : 1561/1577 places, 1561/1577 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-10 finished in 62192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((p1||G(p2))))))'
Support contains 6 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 441 rules applied. Total rules applied 441 place count 1576 transition count 1135
Reduce places removed 441 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 442 rules applied. Total rules applied 883 place count 1135 transition count 1134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 884 place count 1134 transition count 1134
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 311 Pre rules applied. Total rules applied 884 place count 1134 transition count 823
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1506 place count 823 transition count 823
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1513 place count 816 transition count 816
Iterating global reduction 3 with 7 rules applied. Total rules applied 1520 place count 816 transition count 816
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1520 place count 816 transition count 810
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1532 place count 810 transition count 810
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 358
Deduced a syphon composed of 358 places in 0 ms
Reduce places removed 358 places and 0 transitions.
Iterating global reduction 3 with 716 rules applied. Total rules applied 2248 place count 452 transition count 452
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2249 place count 452 transition count 451
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2251 place count 451 transition count 450
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2453 place count 350 transition count 549
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 2489 place count 332 transition count 567
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2490 place count 332 transition count 567
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2492 place count 330 transition count 565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2493 place count 329 transition count 565
Applied a total of 2493 rules in 179 ms. Remains 329 /1577 variables (removed 1248) and now considering 565/1577 (removed 1012) transitions.
// Phase 1: matrix 565 rows 329 cols
[2024-06-01 21:38:28] [INFO ] Computed 160 invariants in 2 ms
[2024-06-01 21:38:29] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 21:38:29] [INFO ] Invariant cache hit.
[2024-06-01 21:38:29] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 21:38:29] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-06-01 21:38:29] [INFO ] Redundant transitions in 4 ms returned []
Running 559 sub problems to find dead transitions.
[2024-06-01 21:38:29] [INFO ] Invariant cache hit.
[2024-06-01 21:38:29] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (OVERLAPS) 2/329 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (OVERLAPS) 564/893 variables, 329/489 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/893 variables, 18/507 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/893 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 7 (OVERLAPS) 0/893 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 559 unsolved
No progress, stopping.
After SMT solving in domain Real declared 893/894 variables, and 507 constraints, problems are : Problem set: 0 solved, 559 unsolved in 28823 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 329/329 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 559 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/327 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/327 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (OVERLAPS) 2/329 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (OVERLAPS) 564/893 variables, 329/489 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/893 variables, 18/507 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/893 variables, 559/1066 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/893 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 8 (OVERLAPS) 0/893 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 559 unsolved
No progress, stopping.
After SMT solving in domain Int declared 893/894 variables, and 1066 constraints, problems are : Problem set: 0 solved, 559 unsolved in 29554 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 329/329 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 0/0 constraints]
After SMT, in 58532ms problems are : Problem set: 0 solved, 559 unsolved
Search for dead transitions found 0 dead transitions in 58537ms
Starting structural reductions in SI_LTL mode, iteration 1 : 329/1577 places, 565/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59298 ms. Remains : 329/1577 places, 565/1577 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-11 finished in 59441 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&&(p1||G(p2))))))'
Support contains 6 out of 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1576 transition count 1139
Reduce places removed 437 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 438 rules applied. Total rules applied 875 place count 1139 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 876 place count 1138 transition count 1138
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 312 Pre rules applied. Total rules applied 876 place count 1138 transition count 826
Deduced a syphon composed of 312 places in 1 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 3 with 624 rules applied. Total rules applied 1500 place count 826 transition count 826
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1509 place count 817 transition count 817
Iterating global reduction 3 with 9 rules applied. Total rules applied 1518 place count 817 transition count 817
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1518 place count 817 transition count 810
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1532 place count 810 transition count 810
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 2246 place count 453 transition count 453
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2448 place count 352 transition count 553
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2484 place count 334 transition count 571
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 2486 place count 334 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2488 place count 332 transition count 569
Applied a total of 2488 rules in 126 ms. Remains 332 /1577 variables (removed 1245) and now considering 569/1577 (removed 1008) transitions.
// Phase 1: matrix 569 rows 332 cols
[2024-06-01 21:39:28] [INFO ] Computed 161 invariants in 2 ms
[2024-06-01 21:39:28] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-01 21:39:28] [INFO ] Invariant cache hit.
[2024-06-01 21:39:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 21:39:28] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-06-01 21:39:28] [INFO ] Redundant transitions in 3 ms returned []
Running 564 sub problems to find dead transitions.
[2024-06-01 21:39:28] [INFO ] Invariant cache hit.
[2024-06-01 21:39:28] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (OVERLAPS) 1/332 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (OVERLAPS) 568/900 variables, 332/493 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/900 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 7 (OVERLAPS) 0/900 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 564 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/901 variables, and 497 constraints, problems are : Problem set: 0 solved, 564 unsolved in 28245 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 332/332 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 564 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (OVERLAPS) 1/332 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (OVERLAPS) 568/900 variables, 332/493 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/900 variables, 564/1061 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/900 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 8 (OVERLAPS) 0/900 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 564 unsolved
No progress, stopping.
After SMT solving in domain Int declared 900/901 variables, and 1061 constraints, problems are : Problem set: 0 solved, 564 unsolved in 26326 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 332/332 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
After SMT, in 54737ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 54750ms
Starting structural reductions in SI_LTL mode, iteration 1 : 332/1577 places, 569/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55422 ms. Remains : 332/1577 places, 569/1577 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-14 finished in 55517 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 1577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1577/1577 places, 1577/1577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 444 transitions
Trivial Post-agglo rules discarded 444 transitions
Performed 444 trivial Post agglomeration. Transition count delta: 444
Iterating post reduction 0 with 444 rules applied. Total rules applied 444 place count 1576 transition count 1132
Reduce places removed 444 places and 0 transitions.
Iterating post reduction 1 with 444 rules applied. Total rules applied 888 place count 1132 transition count 1132
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 312 Pre rules applied. Total rules applied 888 place count 1132 transition count 820
Deduced a syphon composed of 312 places in 1 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 1512 place count 820 transition count 820
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1521 place count 811 transition count 811
Iterating global reduction 2 with 9 rules applied. Total rules applied 1530 place count 811 transition count 811
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1530 place count 811 transition count 804
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1544 place count 804 transition count 804
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 2258 place count 447 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2259 place count 447 transition count 446
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2261 place count 446 transition count 445
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2463 place count 345 transition count 545
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2499 place count 327 transition count 563
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2501 place count 325 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2502 place count 324 transition count 561
Applied a total of 2502 rules in 108 ms. Remains 324 /1577 variables (removed 1253) and now considering 561/1577 (removed 1016) transitions.
// Phase 1: matrix 561 rows 324 cols
[2024-06-01 21:40:23] [INFO ] Computed 160 invariants in 4 ms
[2024-06-01 21:40:23] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 21:40:23] [INFO ] Invariant cache hit.
[2024-06-01 21:40:24] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-06-01 21:40:24] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2024-06-01 21:40:24] [INFO ] Redundant transitions in 4 ms returned []
Running 556 sub problems to find dead transitions.
[2024-06-01 21:40:24] [INFO ] Invariant cache hit.
[2024-06-01 21:40:24] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 77/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (OVERLAPS) 560/884 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/884 variables, 190/674 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 7 (OVERLAPS) 0/884 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 556 unsolved
No progress, stopping.
After SMT solving in domain Real declared 884/885 variables, and 674 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (OVERLAPS) 1/324 variables, 77/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (OVERLAPS) 560/884 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/884 variables, 190/674 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 556/1230 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 0/1230 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 884/885 variables, and 1230 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 0/0 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1577 places, 561/1577 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61401 ms. Remains : 324/1577 places, 561/1577 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-15
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-15 finished in 61477 ms.
All properties solved by simple procedures.
Total runtime 752742 ms.
ITS solved all properties within timeout

BK_STOP 1717278085162

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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