Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446700260.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J06T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 34K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K Apr 11 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 PolyORBLF-PT-S02J06T10-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717253377167

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:49:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:49:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:49:38] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-06-01 14:49:38] [INFO ] Transformed 844 places.
[2024-06-01 14:49:38] [INFO ] Transformed 1812 transitions.
[2024-06-01 14:49:38] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2024-06-01 14:49:38] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 14:49:38] [INFO ] Reduced 110 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 309 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Applied a total of 2 rules in 80 ms. Remains 842 /844 variables (removed 2) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2024-06-01 14:49:39] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 842 cols
[2024-06-01 14:49:39] [INFO ] Computed 56 invariants in 138 ms
[2024-06-01 14:49:39] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-06-01 14:50:02] [INFO ] Deduced a trap composed of 73 places in 454 ms of which 40 ms to minimize.
SMT process timed out in 23187ms, After SMT, problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 23237ms
[2024-06-01 14:50:02] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-06-01 14:50:02] [INFO ] Invariant cache hit.
[2024-06-01 14:50:02] [INFO ] Implicit Places using invariants in 647 ms returned [105, 205, 256, 458, 534, 578, 581, 640, 796, 839]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 663 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 832/844 places, 1652/1652 transitions.
Applied a total of 0 rules in 15 ms. Remains 832 /832 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24051 ms. Remains : 832/844 places, 1652/1652 transitions.
Support contains 309 out of 832 places after structural reductions.
[2024-06-01 14:50:03] [INFO ] Flatten gal took : 297 ms
[2024-06-01 14:50:03] [INFO ] Flatten gal took : 119 ms
[2024-06-01 14:50:03] [INFO ] Input system was already deterministic with 1652 transitions.
Support contains 272 out of 832 places (down from 309) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 22 to 21
RANDOM walk for 40000 steps (11 resets) in 1599 ms. (25 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40002 steps (9 resets) in 762 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (15 resets) in 427 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 328 ms. (121 steps per ms) remains 3/3 properties
[2024-06-01 14:50:04] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 832 cols
[2024-06-01 14:50:05] [INFO ] Computed 46 invariants in 48 ms
[2024-06-01 14:50:05] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 62/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/121 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 172/293 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 7 (OVERLAPS) 520/813 variables, 18/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/813 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/817 variables, 4/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/817 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/832 variables, 10/46 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2464/2464 variables, and 878 constraints, problems are : Problem set: 2 solved, 1 unsolved in 2784 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 832/832 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 397/399 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 197/596 variables, 11/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/602 variables, 5/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 227/829 variables, 23/44 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 14:50:08] [INFO ] Deduced a trap composed of 74 places in 437 ms of which 7 ms to minimize.
[2024-06-01 14:50:09] [INFO ] Deduced a trap composed of 74 places in 441 ms of which 16 ms to minimize.
[2024-06-01 14:50:09] [INFO ] Deduced a trap composed of 74 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:50:09] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:50:09] [INFO ] Deduced a trap composed of 74 places in 219 ms of which 2 ms to minimize.
[2024-06-01 14:50:09] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:50:09] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:50:09] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/829 variables, 8/52 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/829 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/830 variables, 1/53 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/830 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2462/2464 variables, and 883 constraints, problems are : Problem set: 2 solved, 1 unsolved in 3622 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 830/832 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 8/8 constraints]
After SMT, in 6523ms problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 832 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 832 transition count 1564
Reduce places removed 88 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 89 rules applied. Total rules applied 177 place count 744 transition count 1563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 743 transition count 1563
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 178 place count 743 transition count 1463
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 378 place count 643 transition count 1463
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 387 place count 634 transition count 1454
Iterating global reduction 3 with 9 rules applied. Total rules applied 396 place count 634 transition count 1454
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 556 place count 554 transition count 1374
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 576 place count 554 transition count 1354
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 596 place count 534 transition count 1354
Applied a total of 596 rules in 335 ms. Remains 534 /832 variables (removed 298) and now considering 1354/1652 (removed 298) transitions.
Running 1352 sub problems to find dead transitions.
[2024-06-01 14:50:11] [INFO ] Flow matrix only has 1334 transitions (discarded 20 similar events)
// Phase 1: matrix 1334 rows 534 cols
[2024-06-01 14:50:11] [INFO ] Computed 46 invariants in 29 ms
[2024-06-01 14:50:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
[2024-06-01 14:50:24] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:50:24] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 3 ms to minimize.
[2024-06-01 14:50:24] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:50:24] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 3 ms to minimize.
[2024-06-01 14:50:24] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:50:24] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:50:25] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:50:25] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:50:25] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:50:25] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:50:25] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:50:25] [INFO ] Deduced a trap composed of 48 places in 248 ms of which 4 ms to minimize.
[2024-06-01 14:50:26] [INFO ] Deduced a trap composed of 194 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:50:26] [INFO ] Deduced a trap composed of 80 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:50:27] [INFO ] Deduced a trap composed of 335 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:50:27] [INFO ] Deduced a trap composed of 198 places in 274 ms of which 3 ms to minimize.
[2024-06-01 14:50:31] [INFO ] Deduced a trap composed of 213 places in 327 ms of which 4 ms to minimize.
[2024-06-01 14:50:32] [INFO ] Deduced a trap composed of 186 places in 329 ms of which 4 ms to minimize.
[2024-06-01 14:50:33] [INFO ] Deduced a trap composed of 202 places in 283 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1868 variables, and 63 constraints, problems are : Problem set: 0 solved, 1352 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/534 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1352/1352 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
[2024-06-01 14:50:51] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:50:53] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1868 variables, and 65 constraints, problems are : Problem set: 0 solved, 1352 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/534 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1352 constraints, Known Traps: 21/21 constraints]
After SMT, in 43190ms problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 43210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43551 ms. Remains : 534/832 places, 1354/1652 transitions.
RANDOM walk for 40000 steps (21 resets) in 475 ms. (84 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 164280 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 1
Probabilistic random walk after 164280 steps, saw 112671 distinct states, run finished after 3005 ms. (steps per millisecond=54 ) properties seen :0
[2024-06-01 14:50:58] [INFO ] Flow matrix only has 1334 transitions (discarded 20 similar events)
[2024-06-01 14:50:58] [INFO ] Invariant cache hit.
[2024-06-01 14:50:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 404/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 30/436 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/438 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/528 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/531 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/532 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1334/1866 variables, 532/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1866 variables, 120/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1868 variables, 2/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1868 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1868 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1868 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1868/1868 variables, and 700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1150 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 534/534 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 404/406 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/436 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/438 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/528 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:50:59] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:51:00] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:51:00] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 4 ms to minimize.
[2024-06-01 14:51:00] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:51:00] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:51:00] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/531 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/532 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1334/1866 variables, 532/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 120/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1866 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1868 variables, 2/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1868 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1868 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1868 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1868/1868 variables, and 709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4009 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 534/534 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 5187ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 1354/1354 transitions.
Applied a total of 0 rules in 28 ms. Remains 534 /534 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 534/534 places, 1354/1354 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 1354/1354 transitions.
Applied a total of 0 rules in 30 ms. Remains 534 /534 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
[2024-06-01 14:51:03] [INFO ] Flow matrix only has 1334 transitions (discarded 20 similar events)
[2024-06-01 14:51:03] [INFO ] Invariant cache hit.
[2024-06-01 14:51:04] [INFO ] Implicit Places using invariants in 819 ms returned []
[2024-06-01 14:51:04] [INFO ] Flow matrix only has 1334 transitions (discarded 20 similar events)
[2024-06-01 14:51:04] [INFO ] Invariant cache hit.
[2024-06-01 14:51:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:51:12] [INFO ] Implicit Places using invariants and state equation in 8066 ms returned []
Implicit Place search using SMT with State Equation took 8890 ms to find 0 implicit places.
[2024-06-01 14:51:12] [INFO ] Redundant transitions in 103 ms returned []
Running 1352 sub problems to find dead transitions.
[2024-06-01 14:51:12] [INFO ] Flow matrix only has 1334 transitions (discarded 20 similar events)
[2024-06-01 14:51:12] [INFO ] Invariant cache hit.
[2024-06-01 14:51:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 2 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:51:25] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:51:26] [INFO ] Deduced a trap composed of 80 places in 340 ms of which 4 ms to minimize.
[2024-06-01 14:51:26] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:51:26] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:51:27] [INFO ] Deduced a trap composed of 197 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:51:27] [INFO ] Deduced a trap composed of 192 places in 263 ms of which 4 ms to minimize.
[2024-06-01 14:51:28] [INFO ] Deduced a trap composed of 85 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:51:28] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 2 ms to minimize.
[2024-06-01 14:51:28] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 3 ms to minimize.
[2024-06-01 14:51:32] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 6 ms to minimize.
[2024-06-01 14:51:32] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:51:32] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
[2024-06-01 14:51:42] [INFO ] Deduced a trap composed of 222 places in 326 ms of which 4 ms to minimize.
[2024-06-01 14:51:43] [INFO ] Deduced a trap composed of 198 places in 288 ms of which 3 ms to minimize.
[2024-06-01 14:51:44] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:51:44] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 3 ms to minimize.
[2024-06-01 14:51:45] [INFO ] Deduced a trap composed of 172 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:51:45] [INFO ] Deduced a trap composed of 222 places in 228 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1868 variables, and 70 constraints, problems are : Problem set: 0 solved, 1352 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/534 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1352/1352 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 26/70 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 349 places in 347 ms of which 4 ms to minimize.
[2024-06-01 14:52:06] [INFO ] Deduced a trap composed of 197 places in 330 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1868 variables, and 72 constraints, problems are : Problem set: 0 solved, 1352 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/534 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1352 constraints, Known Traps: 28/28 constraints]
After SMT, in 63034ms problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 63046ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72090 ms. Remains : 534/534 places, 1354/1354 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 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((X((G(p0) U p1))||F(p2))))&&F(p0)))'
Support contains 94 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 38 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:52:15] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-06-01 14:52:15] [INFO ] Computed 46 invariants in 20 ms
[2024-06-01 14:52:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:52:36] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-06-01 14:52:36] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:52:36] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:52:36] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:52:36] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:52:36] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:52:36] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:52:36] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:52:37] [INFO ] Deduced a trap composed of 198 places in 363 ms of which 5 ms to minimize.
[2024-06-01 14:52:37] [INFO ] Deduced a trap composed of 72 places in 320 ms of which 4 ms to minimize.
[2024-06-01 14:52:38] [INFO ] Deduced a trap composed of 203 places in 332 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 7.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 5.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 4.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 1.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 timeout
0.0)
(s587 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 55 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:52:58] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 56 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 12/12 constraints]
After SMT, in 42243ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42258ms
[2024-06-01 14:52:58] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:52:58] [INFO ] Invariant cache hit.
[2024-06-01 14:52:58] [INFO ] Implicit Places using invariants in 803 ms returned []
[2024-06-01 14:52:58] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:52:58] [INFO ] Invariant cache hit.
[2024-06-01 14:53:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:53:21] [INFO ] Implicit Places using invariants and state equation in 22967 ms returned []
Implicit Place search using SMT with State Equation took 23774 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:53:21] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:53:21] [INFO ] Invariant cache hit.
[2024-06-01 14:53:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:53:42] [INFO ] Deduced a trap composed of 23 places in 380 ms of which 4 ms to minimize.
[2024-06-01 14:53:42] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-06-01 14:53:42] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:53:42] [INFO ] Deduced a trap composed of 72 places in 425 ms of which 6 ms to minimize.
[2024-06-01 14:53:43] [INFO ] Deduced a trap composed of 427 places in 385 ms of which 5 ms to minimize.
[2024-06-01 14:53:43] [INFO ] Deduced a trap composed of 72 places in 294 ms of which 4 ms to minimize.
[2024-06-01 14:53:43] [INFO ] Deduced a trap composed of 461 places in 296 ms of which 3 ms to minimize.
[2024-06-01 14:53:43] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:53:44] [INFO ] Deduced a trap composed of 206 places in 349 ms of which 4 ms to minimize.
[2024-06-01 14:53:45] [INFO ] Deduced a trap composed of 81 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:53:50] [INFO ] Deduced a trap composed of 422 places in 374 ms of which 4 ms to minimize.
[2024-06-01 14:53:53] [INFO ] Deduced a trap composed of 66 places in 415 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 61 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:54:19] [INFO ] Deduced a trap composed of 572 places in 482 ms of which 6 ms to minimize.
[2024-06-01 14:54:22] [INFO ] Deduced a trap composed of 408 places in 440 ms of which 6 ms to minimize.
[2024-06-01 14:54:23] [INFO ] Deduced a trap composed of 151 places in 425 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 64 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 20/20 constraints]
After SMT, in 62180ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62194ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128272 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-01
Stuttering criterion allowed to conclude after 23661 steps with 682 reset in 217 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-01 finished in 128942 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((F(p0)&&X(X(X(X(G(p1))))))))'
Support contains 92 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 38 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:54:24] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:54:24] [INFO ] Invariant cache hit.
[2024-06-01 14:54:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:54:45] [INFO ] Deduced a trap composed of 72 places in 291 ms of which 4 ms to minimize.
[2024-06-01 14:54:46] [INFO ] Deduced a trap composed of 427 places in 291 ms of which 4 ms to minimize.
[2024-06-01 14:54:46] [INFO ] Deduced a trap composed of 72 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:54:46] [INFO ] Deduced a trap composed of 461 places in 294 ms of which 4 ms to minimize.
[2024-06-01 14:54:46] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:54:46] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:54:46] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:54:47] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:54:47] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
SMT process timed out in 22298ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22322ms
[2024-06-01 14:54:47] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:54:47] [INFO ] Invariant cache hit.
[2024-06-01 14:54:47] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-06-01 14:54:47] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:54:47] [INFO ] Invariant cache hit.
[2024-06-01 14:54:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:55:07] [INFO ] Implicit Places using invariants and state equation in 20183 ms returned []
Implicit Place search using SMT with State Equation took 20761 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:55:07] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:55:07] [INFO ] Invariant cache hit.
[2024-06-01 14:55:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:55:28] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:55:28] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:55:28] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:55:29] [INFO ] Deduced a trap composed of 72 places in 407 ms of which 5 ms to minimize.
[2024-06-01 14:55:29] [INFO ] Deduced a trap composed of 427 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:55:29] [INFO ] Deduced a trap composed of 72 places in 314 ms of which 4 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 461 places in 328 ms of which 4 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:55:30] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:55:31] [INFO ] Deduced a trap composed of 206 places in 462 ms of which 6 ms to minimize.
[2024-06-01 14:55:32] [INFO ] Deduced a trap composed of 81 places in 254 ms of which 4 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 422 places in 464 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 60 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:56:04] [INFO ] Deduced a trap composed of 588 places in 444 ms of which 5 ms to minimize.
[2024-06-01 14:56:08] [INFO ] Deduced a trap composed of 66 places in 447 ms of which 5 ms to minimize.
[2024-06-01 14:56:10] [INFO ] Deduced a trap composed of 142 places in 454 ms of which 6 ms to minimize.
SMT process timed out in 62563ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62577ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105705 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-04
Stuttering criterion allowed to conclude after 15278 steps with 69 reset in 236 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-04 finished in 106148 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 20 out of 832 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 832 transition count 1582
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 762 transition count 1582
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 762 transition count 1482
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 662 transition count 1482
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 480 place count 592 transition count 1412
Applied a total of 480 rules in 125 ms. Remains 592 /832 variables (removed 240) and now considering 1412/1652 (removed 240) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:56:11] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 592 cols
[2024-06-01 14:56:11] [INFO ] Computed 46 invariants in 21 ms
[2024-06-01 14:56:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 3 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 16 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 51 places in 30 ms of which 1 ms to minimize.
[2024-06-01 14:56:25] [INFO ] Deduced a trap composed of 240 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:56:26] [INFO ] Deduced a trap composed of 3 places in 311 ms of which 4 ms to minimize.
[2024-06-01 14:56:26] [INFO ] Deduced a trap composed of 216 places in 321 ms of which 5 ms to minimize.
[2024-06-01 14:56:27] [INFO ] Deduced a trap composed of 68 places in 307 ms of which 4 ms to minimize.
[2024-06-01 14:56:27] [INFO ] Deduced a trap composed of 107 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:56:29] [INFO ] Deduced a trap composed of 118 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:56:33] [INFO ] Deduced a trap composed of 118 places in 160 ms of which 3 ms to minimize.
[2024-06-01 14:56:33] [INFO ] Deduced a trap composed of 226 places in 291 ms of which 3 ms to minimize.
SMT process timed out in 22428ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 22443ms
[2024-06-01 14:56:33] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:56:33] [INFO ] Invariant cache hit.
[2024-06-01 14:56:34] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-06-01 14:56:34] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:56:34] [INFO ] Invariant cache hit.
[2024-06-01 14:56:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:56:46] [INFO ] Implicit Places using invariants and state equation in 12961 ms returned []
Implicit Place search using SMT with State Equation took 13503 ms to find 0 implicit places.
[2024-06-01 14:56:47] [INFO ] Redundant transitions in 26 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:56:47] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:56:47] [INFO ] Invariant cache hit.
[2024-06-01 14:56:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 50 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:57:02] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 1 ms to minimize.
[2024-06-01 14:57:02] [INFO ] Deduced a trap composed of 50 places in 29 ms of which 0 ms to minimize.
[2024-06-01 14:57:02] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:57:02] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:57:02] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:57:02] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:57:02] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:57:02] [INFO ] Deduced a trap composed of 117 places in 325 ms of which 4 ms to minimize.
[2024-06-01 14:57:04] [INFO ] Deduced a trap composed of 3 places in 316 ms of which 4 ms to minimize.
[2024-06-01 14:57:04] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 4 ms to minimize.
[2024-06-01 14:57:04] [INFO ] Deduced a trap composed of 216 places in 265 ms of which 4 ms to minimize.
[2024-06-01 14:57:05] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:57:05] [INFO ] Deduced a trap composed of 57 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:57:09] [INFO ] Deduced a trap composed of 77 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:57:12] [INFO ] Deduced a trap composed of 382 places in 361 ms of which 2 ms to minimize.
[2024-06-01 14:57:16] [INFO ] Deduced a trap composed of 207 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:57:17] [INFO ] Deduced a trap composed of 283 places in 352 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 64 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:57:34] [INFO ] Deduced a trap composed of 263 places in 383 ms of which 4 ms to minimize.
[2024-06-01 14:57:41] [INFO ] Deduced a trap composed of 62 places in 315 ms of which 4 ms to minimize.
(s53 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 9)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 22/22 constraints]
After SMT, in 62795ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62808ms
Starting structural reductions in SI_LTL mode, iteration 1 : 592/832 places, 1412/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98920 ms. Remains : 592/832 places, 1412/1652 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-05
Product exploration explored 100000 steps with 2102 reset in 684 ms.
Product exploration explored 100000 steps with 2108 reset in 694 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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 p0), (NOT p0)]
RANDOM walk for 65 steps (0 resets) in 7 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 20 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 1412/1412 transitions.
Applied a total of 0 rules in 47 ms. Remains 592 /592 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:57:51] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:57:51] [INFO ] Invariant cache hit.
[2024-06-01 14:57:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:58:04] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:58:04] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:58:04] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:58:05] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:58:05] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:58:05] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:58:05] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:58:05] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:58:05] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:58:05] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:58:06] [INFO ] Deduced a trap composed of 117 places in 351 ms of which 4 ms to minimize.
[2024-06-01 14:58:07] [INFO ] Deduced a trap composed of 3 places in 340 ms of which 4 ms to minimize.
[2024-06-01 14:58:07] [INFO ] Deduced a trap composed of 232 places in 347 ms of which 4 ms to minimize.
[2024-06-01 14:58:08] [INFO ] Deduced a trap composed of 216 places in 299 ms of which 3 ms to minimize.
[2024-06-01 14:58:08] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:58:09] [INFO ] Deduced a trap composed of 57 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:58:13] [INFO ] Deduced a trap composed of 77 places in 249 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 61 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:58:28] [INFO ] Deduced a trap composed of 398 places in 349 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 18/18 constraints]
After SMT, in 42607ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42624ms
[2024-06-01 14:58:34] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:58:34] [INFO ] Invariant cache hit.
[2024-06-01 14:58:34] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-06-01 14:58:34] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:58:34] [INFO ] Invariant cache hit.
[2024-06-01 14:58:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:58:47] [INFO ] Implicit Places using invariants and state equation in 12195 ms returned []
Implicit Place search using SMT with State Equation took 12731 ms to find 0 implicit places.
[2024-06-01 14:58:47] [INFO ] Redundant transitions in 107 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:58:47] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:58:47] [INFO ] Invariant cache hit.
[2024-06-01 14:58:47] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 14:59:01] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:59:02] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:59:03] [INFO ] Deduced a trap composed of 117 places in 351 ms of which 4 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 3 places in 304 ms of which 4 ms to minimize.
[2024-06-01 14:59:04] [INFO ] Deduced a trap composed of 232 places in 325 ms of which 4 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 216 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:59:05] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 2 ms to minimize.
[2024-06-01 14:59:06] [INFO ] Deduced a trap composed of 57 places in 236 ms of which 3 ms to minimize.
[2024-06-01 14:59:10] [INFO ] Deduced a trap composed of 77 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:59:14] [INFO ] Deduced a trap composed of 382 places in 342 ms of which 4 ms to minimize.
[2024-06-01 14:59:19] [INFO ] Deduced a trap composed of 207 places in 324 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 63 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 63 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 19/19 constraints]
After SMT, in 62023ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62037ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 117574 ms. Remains : 592/592 places, 1412/1412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 79 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2192 reset in 647 ms.
Product exploration explored 100000 steps with 2131 reset in 603 ms.
Support contains 20 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 1412/1412 transitions.
Applied a total of 0 rules in 29 ms. Remains 592 /592 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:59:51] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:59:51] [INFO ] Invariant cache hit.
[2024-06-01 14:59:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 50 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:00:05] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:00:06] [INFO ] Deduced a trap composed of 117 places in 346 ms of which 4 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 3 places in 336 ms of which 4 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 232 places in 351 ms of which 4 ms to minimize.
[2024-06-01 15:00:08] [INFO ] Deduced a trap composed of 216 places in 289 ms of which 4 ms to minimize.
[2024-06-01 15:00:09] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:00:09] [INFO ] Deduced a trap composed of 57 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:00:13] [INFO ] Deduced a trap composed of 77 places in 212 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 61 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 15:00:25] [INFO ] Deduced a trap composed of 398 places in 312 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 18/18 constraints]
After SMT, in 42334ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42349ms
[2024-06-01 15:00:33] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 15:00:33] [INFO ] Invariant cache hit.
[2024-06-01 15:00:34] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-06-01 15:00:34] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 15:00:34] [INFO ] Invariant cache hit.
[2024-06-01 15:00:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:00:47] [INFO ] Implicit Places using invariants and state equation in 13909 ms returned []
Implicit Place search using SMT with State Equation took 14534 ms to find 0 implicit places.
[2024-06-01 15:00:48] [INFO ] Redundant transitions in 63 ms returned []
Running 1410 sub problems to find dead transitions.
[2024-06-01 15:00:48] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 15:00:48] [INFO ] Invariant cache hit.
[2024-06-01 15:00:48] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 15:01:02] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:01:02] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2024-06-01 15:01:02] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:01:02] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 2 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:01:03] [INFO ] Deduced a trap composed of 117 places in 351 ms of which 5 ms to minimize.
[2024-06-01 15:01:05] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 4 ms to minimize.
[2024-06-01 15:01:05] [INFO ] Deduced a trap composed of 232 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:01:06] [INFO ] Deduced a trap composed of 216 places in 253 ms of which 3 ms to minimize.
[2024-06-01 15:01:06] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 3 ms to minimize.
[2024-06-01 15:01:06] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 2 ms to minimize.
[2024-06-01 15:01:10] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:01:13] [INFO ] Deduced a trap composed of 382 places in 328 ms of which 4 ms to minimize.
[2024-06-01 15:01:17] [INFO ] Deduced a trap composed of 207 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:01:18] [INFO ] Deduced a trap composed of 283 places in 324 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 64 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-06-01 15:01:34] [INFO ] Deduced a trap composed of 263 places in 269 ms of which 4 ms to minimize.
[2024-06-01 15:01:40] [INFO ] Deduced a trap composed of 62 places in 265 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 22/22 constraints]
After SMT, in 62321ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 119330 ms. Remains : 592/592 places, 1412/1412 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-05 finished in 339642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 45 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:01:50] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-06-01 15:01:50] [INFO ] Computed 46 invariants in 21 ms
[2024-06-01 15:01:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:02:10] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 4 ms to minimize.
[2024-06-01 15:02:10] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:02:10] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:02:10] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:02:10] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 2 ms to minimize.
[2024-06-01 15:02:10] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:02:10] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:02:10] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:02:11] [INFO ] Deduced a trap composed of 198 places in 454 ms of which 9 ms to minimize.
[2024-06-01 15:02:11] [INFO ] Deduced a trap composed of 72 places in 388 ms of which 4 ms to minimize.
[2024-06-01 15:02:12] [INFO ] Deduced a trap composed of 203 places in 328 ms of which 4 ms to minimize.
[2024-06-01 15:02:12] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:02:12] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 7.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 7.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 (/ 1.0 3.0))
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints]
After SMT, in 42277ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42292ms
[2024-06-01 15:02:32] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:02:32] [INFO ] Invariant cache hit.
[2024-06-01 15:02:33] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-06-01 15:02:33] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:02:33] [INFO ] Invariant cache hit.
[2024-06-01 15:02:34] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:02:51] [INFO ] Implicit Places using invariants and state equation in 17993 ms returned []
Implicit Place search using SMT with State Equation took 18653 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:02:51] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:02:51] [INFO ] Invariant cache hit.
[2024-06-01 15:02:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:03:13] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 5 ms to minimize.
[2024-06-01 15:03:13] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:03:13] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:03:14] [INFO ] Deduced a trap composed of 72 places in 372 ms of which 4 ms to minimize.
[2024-06-01 15:03:14] [INFO ] Deduced a trap composed of 427 places in 296 ms of which 4 ms to minimize.
[2024-06-01 15:03:15] [INFO ] Deduced a trap composed of 72 places in 300 ms of which 4 ms to minimize.
[2024-06-01 15:03:15] [INFO ] Deduced a trap composed of 461 places in 298 ms of which 4 ms to minimize.
[2024-06-01 15:03:15] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:03:15] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:03:15] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:03:15] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:03:15] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:03:15] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:03:16] [INFO ] Deduced a trap composed of 206 places in 380 ms of which 5 ms to minimize.
[2024-06-01 15:03:16] [INFO ] Deduced a trap composed of 81 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:03:20] [INFO ] Deduced a trap composed of 422 places in 435 ms of which 5 ms to minimize.
[2024-06-01 15:03:23] [INFO ] Deduced a trap composed of 66 places in 441 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 61 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:03:47] [INFO ] Deduced a trap composed of 572 places in 424 ms of which 4 ms to minimize.
[2024-06-01 15:03:50] [INFO ] Deduced a trap composed of 408 places in 459 ms of which 6 ms to minimize.
[2024-06-01 15:03:52] [INFO ] Deduced a trap composed of 151 places in 437 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 64 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 20/20 constraints]
After SMT, in 62454ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62471ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123481 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-07
Product exploration explored 100000 steps with 10814 reset in 601 ms.
Product exploration explored 100000 steps with 10843 reset in 391 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 31 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 80 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 46 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:03:55] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:03:55] [INFO ] Invariant cache hit.
[2024-06-01 15:03:56] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-06-01 15:03:56] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 114 ms returned sat
[2024-06-01 15:03:58] [INFO ] [Real]Absence check using state equation in 1894 ms returned sat
[2024-06-01 15:03:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:03:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-06-01 15:03:59] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 106 ms returned sat
[2024-06-01 15:04:04] [INFO ] [Nat]Absence check using state equation in 5418 ms returned sat
[2024-06-01 15:04:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:04:06] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:04:07] [INFO ] [Nat]Added 120 Read/Feed constraints in 3014 ms returned unknown
Could not prove EG (NOT p0)
Support contains 10 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 812 transition count 1562
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 742 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 140 place count 742 transition count 1462
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 340 place count 642 transition count 1462
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 480 place count 572 transition count 1392
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 489 place count 563 transition count 1383
Iterating global reduction 2 with 9 rules applied. Total rules applied 498 place count 563 transition count 1383
Applied a total of 498 rules in 131 ms. Remains 563 /812 variables (removed 249) and now considering 1383/1632 (removed 249) transitions.
Running 1381 sub problems to find dead transitions.
[2024-06-01 15:04:07] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
// Phase 1: matrix 1363 rows 563 cols
[2024-06-01 15:04:07] [INFO ] Computed 46 invariants in 27 ms
[2024-06-01 15:04:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 15:04:20] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:04:20] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:04:20] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:04:21] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:04:22] [INFO ] Deduced a trap composed of 211 places in 314 ms of which 4 ms to minimize.
[2024-06-01 15:04:23] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
[2024-06-01 15:04:23] [INFO ] Deduced a trap composed of 91 places in 271 ms of which 4 ms to minimize.
[2024-06-01 15:04:27] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 60 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 60 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 16/16 constraints]
After SMT, in 42518ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 42535ms
[2024-06-01 15:04:50] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:04:50] [INFO ] Invariant cache hit.
[2024-06-01 15:04:50] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-06-01 15:04:50] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:04:50] [INFO ] Invariant cache hit.
[2024-06-01 15:04:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:05:07] [INFO ] Implicit Places using invariants and state equation in 16841 ms returned []
Implicit Place search using SMT with State Equation took 17351 ms to find 0 implicit places.
[2024-06-01 15:05:07] [INFO ] Redundant transitions in 25 ms returned []
Running 1381 sub problems to find dead transitions.
[2024-06-01 15:05:07] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:05:07] [INFO ] Invariant cache hit.
[2024-06-01 15:05:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 15:05:20] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:05:20] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:05:20] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:05:20] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:05:20] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:05:20] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:05:20] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:05:21] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 3 ms to minimize.
[2024-06-01 15:05:21] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 3 ms to minimize.
[2024-06-01 15:05:21] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:05:21] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:05:22] [INFO ] Deduced a trap composed of 47 places in 241 ms of which 4 ms to minimize.
[2024-06-01 15:05:22] [INFO ] Deduced a trap composed of 210 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:05:23] [INFO ] Deduced a trap composed of 89 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:05:23] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:05:24] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:05:28] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 380 places in 311 ms of which 4 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 365 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:05:34] [INFO ] Deduced a trap composed of 363 places in 245 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 64 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 64 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 20/20 constraints]
After SMT, in 62392ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 62405ms
Starting structural reductions in SI_LTL mode, iteration 1 : 563/812 places, 1383/1632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122460 ms. Remains : 563/812 places, 1383/1632 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 81 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 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:06:10] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:06:10] [INFO ] Invariant cache hit.
[2024-06-01 15:06:10] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 15:06:11] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 103 ms returned sat
[2024-06-01 15:06:12] [INFO ] [Real]Absence check using state equation in 1682 ms returned sat
[2024-06-01 15:06:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:06:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:06:13] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 121 ms returned sat
[2024-06-01 15:06:17] [INFO ] [Nat]Absence check using state equation in 4303 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10856 reset in 384 ms.
Product exploration explored 100000 steps with 10836 reset in 421 ms.
Support contains 10 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 1383/1383 transitions.
Applied a total of 0 rules in 22 ms. Remains 563 /563 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Running 1381 sub problems to find dead transitions.
[2024-06-01 15:06:18] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:06:18] [INFO ] Invariant cache hit.
[2024-06-01 15:06:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:06:31] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 47 places in 288 ms of which 4 ms to minimize.
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 4 ms to minimize.
[2024-06-01 15:06:32] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 3 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 196 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 47 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:06:33] [INFO ] Deduced a trap composed of 210 places in 222 ms of which 3 ms to minimize.
[2024-06-01 15:06:34] [INFO ] Deduced a trap composed of 89 places in 299 ms of which 4 ms to minimize.
[2024-06-01 15:06:35] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:06:36] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 3 ms to minimize.
[2024-06-01 15:06:41] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 61 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 15:06:54] [INFO ] Deduced a trap composed of 363 places in 251 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 62 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 18/18 constraints]
After SMT, in 42700ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 42712ms
[2024-06-01 15:07:01] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:07:01] [INFO ] Invariant cache hit.
[2024-06-01 15:07:02] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-06-01 15:07:02] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:07:02] [INFO ] Invariant cache hit.
[2024-06-01 15:07:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:07:19] [INFO ] Implicit Places using invariants and state equation in 17183 ms returned []
Implicit Place search using SMT with State Equation took 17712 ms to find 0 implicit places.
[2024-06-01 15:07:19] [INFO ] Redundant transitions in 23 ms returned []
Running 1381 sub problems to find dead transitions.
[2024-06-01 15:07:19] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:07:19] [INFO ] Invariant cache hit.
[2024-06-01 15:07:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 47 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:07:34] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 3 ms to minimize.
[2024-06-01 15:07:34] [INFO ] Deduced a trap composed of 47 places in 284 ms of which 3 ms to minimize.
[2024-06-01 15:07:34] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 2 ms to minimize.
[2024-06-01 15:07:35] [INFO ] Deduced a trap composed of 47 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:07:35] [INFO ] Deduced a trap composed of 210 places in 212 ms of which 3 ms to minimize.
[2024-06-01 15:07:36] [INFO ] Deduced a trap composed of 89 places in 293 ms of which 4 ms to minimize.
[2024-06-01 15:07:36] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:07:38] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 3 ms to minimize.
[2024-06-01 15:07:42] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 4 ms to minimize.
[2024-06-01 15:07:48] [INFO ] Deduced a trap composed of 380 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:07:49] [INFO ] Deduced a trap composed of 365 places in 311 ms of which 4 ms to minimize.
[2024-06-01 15:07:49] [INFO ] Deduced a trap composed of 363 places in 292 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 64 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 10)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 64 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 20/20 constraints]
After SMT, in 62198ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 62209ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 122692 ms. Remains : 563/563 places, 1383/1383 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-07 finished in 391010 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((F(p1)||X(p2)||p0))))'
Support contains 6 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 42 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:08:21] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-06-01 15:08:21] [INFO ] Computed 46 invariants in 26 ms
[2024-06-01 15:08:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:08:42] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 3 ms to minimize.
[2024-06-01 15:08:42] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:08:42] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:08:42] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:08:42] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:08:42] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:08:43] [INFO ] Deduced a trap composed of 198 places in 436 ms of which 5 ms to minimize.
[2024-06-01 15:08:44] [INFO ] Deduced a trap composed of 72 places in 417 ms of which 6 ms to minimize.
[2024-06-01 15:08:44] [INFO ] Deduced a trap composed of 203 places in 380 ms of which 4 ms to minimize.
SMT process timed out in 22953ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22970ms
[2024-06-01 15:08:44] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:08:44] [INFO ] Invariant cache hit.
[2024-06-01 15:08:45] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-06-01 15:08:45] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:08:45] [INFO ] Invariant cache hit.
[2024-06-01 15:08:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:09:02] [INFO ] Implicit Places using invariants and state equation in 17525 ms returned []
Implicit Place search using SMT with State Equation took 18194 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:09:02] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:09:02] [INFO ] Invariant cache hit.
[2024-06-01 15:09:02] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:09:23] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 3 ms to minimize.
[2024-06-01 15:09:23] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:09:24] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:09:24] [INFO ] Deduced a trap composed of 72 places in 331 ms of which 4 ms to minimize.
[2024-06-01 15:09:24] [INFO ] Deduced a trap composed of 427 places in 347 ms of which 4 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 72 places in 312 ms of which 4 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 461 places in 312 ms of which 5 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:09:26] [INFO ] Deduced a trap composed of 206 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:09:26] [INFO ] Deduced a trap composed of 81 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:09:30] [INFO ] Deduced a trap composed of 422 places in 310 ms of which 5 ms to minimize.
[2024-06-01 15:09:33] [INFO ] Deduced a trap composed of 66 places in 353 ms of which 4 ms to minimize.
[2024-06-01 15:09:35] [INFO ] Deduced a trap composed of 432 places in 456 ms of which 6 ms to minimize.
SMT process timed out in 32818ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 32835ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74048 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-08
Product exploration explored 100000 steps with 16 reset in 415 ms.
Stack based approach found an accepted trace after 261 steps with 0 reset with depth 262 and stack size 262 in 1 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-08 finished in 74612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 31 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:09:36] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:09:36] [INFO ] Invariant cache hit.
[2024-06-01 15:09:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:09:56] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 4 ms to minimize.
[2024-06-01 15:09:56] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:09:56] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:09:56] [INFO ] Deduced a trap composed of 72 places in 362 ms of which 4 ms to minimize.
[2024-06-01 15:09:57] [INFO ] Deduced a trap composed of 427 places in 305 ms of which 4 ms to minimize.
[2024-06-01 15:09:57] [INFO ] Deduced a trap composed of 72 places in 296 ms of which 4 ms to minimize.
[2024-06-01 15:09:57] [INFO ] Deduced a trap composed of 461 places in 289 ms of which 4 ms to minimize.
[2024-06-01 15:09:57] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:09:57] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:09:58] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:09:58] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:09:58] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2024-06-01 15:09:58] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:09:58] [INFO ] Deduced a trap composed of 206 places in 319 ms of which 4 ms to minimize.
SMT process timed out in 22512ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22526ms
[2024-06-01 15:09:58] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:09:58] [INFO ] Invariant cache hit.
[2024-06-01 15:09:59] [INFO ] Implicit Places using invariants in 682 ms returned []
[2024-06-01 15:09:59] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:09:59] [INFO ] Invariant cache hit.
[2024-06-01 15:10:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:10:18] [INFO ] Implicit Places using invariants and state equation in 18705 ms returned []
Implicit Place search using SMT with State Equation took 19389 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:10:18] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:10:18] [INFO ] Invariant cache hit.
[2024-06-01 15:10:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:10:36] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 4 ms to minimize.
[2024-06-01 15:10:36] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:10:36] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:10:37] [INFO ] Deduced a trap composed of 72 places in 367 ms of which 4 ms to minimize.
[2024-06-01 15:10:37] [INFO ] Deduced a trap composed of 427 places in 375 ms of which 4 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 72 places in 322 ms of which 5 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 461 places in 340 ms of which 4 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:10:39] [INFO ] Deduced a trap composed of 206 places in 395 ms of which 5 ms to minimize.
[2024-06-01 15:10:40] [INFO ] Deduced a trap composed of 81 places in 197 ms of which 3 ms to minimize.
[2024-06-01 15:10:44] [INFO ] Deduced a trap composed of 422 places in 423 ms of which 6 ms to minimize.
[2024-06-01 15:10:46] [INFO ] Deduced a trap composed of 66 places in 367 ms of which 5 ms to minimize.
[2024-06-01 15:10:48] [INFO ] Deduced a trap composed of 432 places in 383 ms of which 5 ms to minimize.
[2024-06-01 15:10:49] [INFO ] Deduced a trap composed of 436 places in 365 ms of which 5 ms to minimize.
[2024-06-01 15:10:49] [INFO ] Deduced a trap composed of 400 places in 344 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 64 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:11:13] [INFO ] Deduced a trap composed of 142 places in 425 ms of which 6 ms to minimize.
[2024-06-01 15:11:19] [INFO ] Deduced a trap composed of 610 places in 476 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 10)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 6)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 1)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 1)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 1)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 1)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 timeout
0)
(s531 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 66 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 22/22 constraints]
After SMT, in 62818ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62832ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104785 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-10
Stuttering criterion allowed to conclude after 23261 steps with 38 reset in 118 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-10 finished in 104995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 4 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 59 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:11:21] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:11:21] [INFO ] Invariant cache hit.
[2024-06-01 15:11:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:11:41] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2024-06-01 15:11:41] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 1 ms to minimize.
[2024-06-01 15:11:41] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:11:42] [INFO ] Deduced a trap composed of 72 places in 328 ms of which 4 ms to minimize.
[2024-06-01 15:11:42] [INFO ] Deduced a trap composed of 427 places in 302 ms of which 4 ms to minimize.
[2024-06-01 15:11:42] [INFO ] Deduced a trap composed of 72 places in 321 ms of which 4 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 461 places in 303 ms of which 4 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:11:43] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:11:44] [INFO ] Deduced a trap composed of 206 places in 325 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 58 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 58 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 14/14 constraints]
After SMT, in 43210ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 43230ms
[2024-06-01 15:12:04] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:12:04] [INFO ] Invariant cache hit.
[2024-06-01 15:12:05] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-06-01 15:12:05] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:12:05] [INFO ] Invariant cache hit.
[2024-06-01 15:12:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:12:23] [INFO ] Implicit Places using invariants and state equation in 18396 ms returned []
Implicit Place search using SMT with State Equation took 19051 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:12:23] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:12:23] [INFO ] Invariant cache hit.
[2024-06-01 15:12:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:12:42] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
[2024-06-01 15:12:42] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-06-01 15:12:42] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:12:42] [INFO ] Deduced a trap composed of 72 places in 293 ms of which 7 ms to minimize.
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 427 places in 288 ms of which 4 ms to minimize.
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 72 places in 287 ms of which 4 ms to minimize.
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 461 places in 289 ms of which 4 ms to minimize.
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 0 ms to minimize.
[2024-06-01 15:12:43] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 206 places in 384 ms of which 4 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 81 places in 204 ms of which 3 ms to minimize.
[2024-06-01 15:12:50] [INFO ] Deduced a trap composed of 422 places in 365 ms of which 4 ms to minimize.
[2024-06-01 15:12:52] [INFO ] Deduced a trap composed of 66 places in 293 ms of which 4 ms to minimize.
[2024-06-01 15:12:54] [INFO ] Deduced a trap composed of 432 places in 442 ms of which 6 ms to minimize.
[2024-06-01 15:12:55] [INFO ] Deduced a trap composed of 436 places in 304 ms of which 4 ms to minimize.
[2024-06-01 15:12:55] [INFO ] Deduced a trap composed of 400 places in 363 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 64 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:13:20] [INFO ] Deduced a trap composed of 142 places in 367 ms of which 5 ms to minimize.
[2024-06-01 15:13:26] [INFO ] Deduced a trap composed of 610 places in 455 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 66 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 22/22 constraints]
After SMT, in 62966ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 62979ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125328 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 578 ms.
Product exploration explored 100000 steps with 50000 reset in 644 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 13 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-11 finished in 126753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G(X(p0)) U p1)))))'
Support contains 2 out of 832 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 : 832/832 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 832 transition count 1564
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 176 place count 744 transition count 1564
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 176 place count 744 transition count 1463
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 378 place count 643 transition count 1463
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 387 place count 634 transition count 1454
Iterating global reduction 2 with 9 rules applied. Total rules applied 396 place count 634 transition count 1454
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 554 place count 555 transition count 1375
Applied a total of 554 rules in 95 ms. Remains 555 /832 variables (removed 277) and now considering 1375/1652 (removed 277) transitions.
Running 1373 sub problems to find dead transitions.
[2024-06-01 15:13:28] [INFO ] Flow matrix only has 1355 transitions (discarded 20 similar events)
// Phase 1: matrix 1355 rows 555 cols
[2024-06-01 15:13:28] [INFO ] Computed 46 invariants in 38 ms
[2024-06-01 15:13:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
[2024-06-01 15:13:41] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:13:41] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 4 ms to minimize.
[2024-06-01 15:13:42] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 4 ms to minimize.
[2024-06-01 15:13:42] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 3 ms to minimize.
[2024-06-01 15:13:42] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:13:42] [INFO ] Deduced a trap composed of 197 places in 225 ms of which 2 ms to minimize.
[2024-06-01 15:13:42] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:13:43] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:13:43] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:13:43] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:13:43] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:13:43] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:13:43] [INFO ] Deduced a trap composed of 328 places in 289 ms of which 3 ms to minimize.
[2024-06-01 15:13:44] [INFO ] Deduced a trap composed of 99 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:13:44] [INFO ] Deduced a trap composed of 90 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:13:45] [INFO ] Deduced a trap composed of 108 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:13:46] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 2 ms to minimize.
[2024-06-01 15:13:46] [INFO ] Deduced a trap composed of 72 places in 250 ms of which 4 ms to minimize.
[2024-06-01 15:13:50] [INFO ] Deduced a trap composed of 211 places in 307 ms of which 4 ms to minimize.
[2024-06-01 15:13:50] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1910 variables, and 64 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/555 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1373/1373 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 353 places in 326 ms of which 3 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/1910 variables, and 66 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/555 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1373 constraints, Known Traps: 22/22 constraints]
After SMT, in 43226ms problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 43241ms
[2024-06-01 15:14:11] [INFO ] Flow matrix only has 1355 transitions (discarded 20 similar events)
[2024-06-01 15:14:11] [INFO ] Invariant cache hit.
[2024-06-01 15:14:11] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-06-01 15:14:11] [INFO ] Flow matrix only has 1355 transitions (discarded 20 similar events)
[2024-06-01 15:14:11] [INFO ] Invariant cache hit.
[2024-06-01 15:14:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:14:27] [INFO ] Implicit Places using invariants and state equation in 15540 ms returned []
Implicit Place search using SMT with State Equation took 16231 ms to find 0 implicit places.
[2024-06-01 15:14:27] [INFO ] Redundant transitions in 33 ms returned []
Running 1373 sub problems to find dead transitions.
[2024-06-01 15:14:27] [INFO ] Flow matrix only has 1355 transitions (discarded 20 similar events)
[2024-06-01 15:14:27] [INFO ] Invariant cache hit.
[2024-06-01 15:14:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 3 ms to minimize.
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 3 ms to minimize.
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 3 ms to minimize.
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 197 places in 233 ms of which 3 ms to minimize.
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 202 places in 276 ms of which 3 ms to minimize.
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:14:41] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:14:42] [INFO ] Deduced a trap composed of 94 places in 273 ms of which 3 ms to minimize.
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 233 places in 244 ms of which 2 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 94 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 2 ms to minimize.
[2024-06-01 15:14:54] [INFO ] Deduced a trap composed of 218 places in 342 ms of which 4 ms to minimize.
[2024-06-01 15:14:54] [INFO ] Deduced a trap composed of 218 places in 347 ms of which 3 ms to minimize.
[2024-06-01 15:14:58] [INFO ] Deduced a trap composed of 236 places in 326 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1910 variables, and 64 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/555 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1373/1373 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/1910 variables, and 64 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/555 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1373 constraints, Known Traps: 20/20 constraints]
After SMT, in 62682ms problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 62695ms
Starting structural reductions in SI_LTL mode, iteration 1 : 555/832 places, 1375/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122306 ms. Remains : 555/832 places, 1375/1652 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-12
Stuttering criterion allowed to conclude after 2368 steps with 13 reset in 14 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-12 finished in 122402 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 832 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 832 transition count 1573
Reduce places removed 79 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 89 rules applied. Total rules applied 168 place count 753 transition count 1563
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 178 place count 743 transition count 1563
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 178 place count 743 transition count 1463
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 378 place count 643 transition count 1463
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 387 place count 634 transition count 1454
Iterating global reduction 3 with 9 rules applied. Total rules applied 396 place count 634 transition count 1454
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 556 place count 554 transition count 1374
Applied a total of 556 rules in 79 ms. Remains 554 /832 variables (removed 278) and now considering 1374/1652 (removed 278) transitions.
Running 1372 sub problems to find dead transitions.
[2024-06-01 15:15:30] [INFO ] Flow matrix only has 1354 transitions (discarded 20 similar events)
// Phase 1: matrix 1354 rows 554 cols
[2024-06-01 15:15:30] [INFO ] Computed 46 invariants in 39 ms
[2024-06-01 15:15:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-06-01 15:15:43] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-06-01 15:15:43] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:15:43] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:15:43] [INFO ] Deduced a trap composed of 47 places in 312 ms of which 4 ms to minimize.
[2024-06-01 15:15:44] [INFO ] Deduced a trap composed of 46 places in 287 ms of which 3 ms to minimize.
[2024-06-01 15:15:44] [INFO ] Deduced a trap composed of 46 places in 303 ms of which 5 ms to minimize.
[2024-06-01 15:15:44] [INFO ] Deduced a trap composed of 47 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:15:44] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:15:45] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:15:45] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:15:45] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:15:45] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:15:45] [INFO ] Deduced a trap composed of 206 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:15:46] [INFO ] Deduced a trap composed of 93 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:15:47] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:15:52] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/1908 variables, and 60 constraints, problems are : Problem set: 0 solved, 1372 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1372/1372 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-06-01 15:16:03] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-06-01 15:16:09] [INFO ] Deduced a trap composed of 369 places in 238 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/1908 variables, and 62 constraints, problems are : Problem set: 0 solved, 1372 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1372 constraints, Known Traps: 18/18 constraints]
After SMT, in 42902ms problems are : Problem set: 0 solved, 1372 unsolved
Search for dead transitions found 0 dead transitions in 42915ms
[2024-06-01 15:16:13] [INFO ] Flow matrix only has 1354 transitions (discarded 20 similar events)
[2024-06-01 15:16:13] [INFO ] Invariant cache hit.
[2024-06-01 15:16:13] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-06-01 15:16:13] [INFO ] Flow matrix only has 1354 transitions (discarded 20 similar events)
[2024-06-01 15:16:13] [INFO ] Invariant cache hit.
[2024-06-01 15:16:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:16:23] [INFO ] Implicit Places using invariants and state equation in 9782 ms returned []
Implicit Place search using SMT with State Equation took 10443 ms to find 0 implicit places.
[2024-06-01 15:16:23] [INFO ] Redundant transitions in 63 ms returned []
Running 1372 sub problems to find dead transitions.
[2024-06-01 15:16:23] [INFO ] Flow matrix only has 1354 transitions (discarded 20 similar events)
[2024-06-01 15:16:23] [INFO ] Invariant cache hit.
[2024-06-01 15:16:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
[2024-06-01 15:16:36] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:16:36] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:16:36] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:16:36] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 15:16:36] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:16:36] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:16:36] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:16:37] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 4 ms to minimize.
[2024-06-01 15:16:37] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:16:37] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:16:37] [INFO ] Deduced a trap composed of 213 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:16:37] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:16:38] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:16:38] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:16:39] [INFO ] Deduced a trap composed of 87 places in 306 ms of which 3 ms to minimize.
[2024-06-01 15:16:42] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:16:45] [INFO ] Deduced a trap composed of 396 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:16:45] [INFO ] Deduced a trap composed of 381 places in 303 ms of which 4 ms to minimize.
[2024-06-01 15:16:49] [INFO ] Deduced a trap composed of 369 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 225 places in 201 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 (/ 5.0 3.0))
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 (/ 4.0 3.0))
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 (/ 2.0 3.0))
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 6.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 (/ 1.0 3.0))
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 (/ 1.0 3.0))
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 (/ 2.0 3.0))
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 4.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 9.0)timeout

( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/1908 variables, and 64 constraints, problems are : Problem set: 0 solved, 1372 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1372/1372 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/552 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/1908 variables, and 64 constraints, problems are : Problem set: 0 solved, 1372 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/554 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1372 constraints, Known Traps: 20/20 constraints]
After SMT, in 62862ms problems are : Problem set: 0 solved, 1372 unsolved
Search for dead transitions found 0 dead transitions in 62881ms
Starting structural reductions in SI_LTL mode, iteration 1 : 554/832 places, 1374/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116394 ms. Remains : 554/832 places, 1374/1652 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-13
Stuttering criterion allowed to conclude after 2451 steps with 0 reset in 12 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-13 finished in 116448 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' '!(((p0 U (p1||X(X(p1))))&&X(G((X(p3)||p2)))))'
Support contains 7 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 31 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:17:26] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2024-06-01 15:17:26] [INFO ] Computed 46 invariants in 47 ms
[2024-06-01 15:17:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:17:47] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 3 ms to minimize.
[2024-06-01 15:17:47] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:17:47] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 2 ms to minimize.
[2024-06-01 15:17:47] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2024-06-01 15:17:47] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:17:47] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:17:47] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 0 ms to minimize.
[2024-06-01 15:17:48] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:17:48] [INFO ] Deduced a trap composed of 198 places in 327 ms of which 4 ms to minimize.
[2024-06-01 15:17:48] [INFO ] Deduced a trap composed of 72 places in 393 ms of which 5 ms to minimize.
[2024-06-01 15:17:49] [INFO ] Deduced a trap composed of 203 places in 313 ms of which 4 ms to minimize.
[2024-06-01 15:17:49] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
SMT process timed out in 22794ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22810ms
[2024-06-01 15:17:49] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:17:49] [INFO ] Invariant cache hit.
[2024-06-01 15:17:50] [INFO ] Implicit Places using invariants in 723 ms returned []
[2024-06-01 15:17:50] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:17:50] [INFO ] Invariant cache hit.
[2024-06-01 15:17:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:18:07] [INFO ] Implicit Places using invariants and state equation in 17170 ms returned []
Implicit Place search using SMT with State Equation took 17895 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:18:07] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:18:07] [INFO ] Invariant cache hit.
[2024-06-01 15:18:07] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:18:29] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 4 ms to minimize.
[2024-06-01 15:18:29] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:18:29] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:18:29] [INFO ] Deduced a trap composed of 72 places in 350 ms of which 4 ms to minimize.
[2024-06-01 15:18:30] [INFO ] Deduced a trap composed of 427 places in 376 ms of which 5 ms to minimize.
[2024-06-01 15:18:30] [INFO ] Deduced a trap composed of 72 places in 293 ms of which 4 ms to minimize.
[2024-06-01 15:18:30] [INFO ] Deduced a trap composed of 461 places in 289 ms of which 4 ms to minimize.
[2024-06-01 15:18:30] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:18:30] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:18:30] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 2 ms to minimize.
[2024-06-01 15:18:30] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:18:31] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:18:31] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:18:31] [INFO ] Deduced a trap composed of 206 places in 404 ms of which 5 ms to minimize.
[2024-06-01 15:18:32] [INFO ] Deduced a trap composed of 81 places in 268 ms of which 3 ms to minimize.
[2024-06-01 15:18:37] [INFO ] Deduced a trap composed of 422 places in 469 ms of which 6 ms to minimize.
[2024-06-01 15:18:40] [INFO ] Deduced a trap composed of 66 places in 410 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 61 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:19:03] [INFO ] Deduced a trap composed of 572 places in 484 ms of which 6 ms to minimize.
[2024-06-01 15:19:07] [INFO ] Deduced a trap composed of 408 places in 463 ms of which 6 ms to minimize.
[2024-06-01 15:19:08] [INFO ] Deduced a trap composed of 151 places in 320 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 64 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 20/20 constraints]
After SMT, in 63194ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 63213ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103956 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p1), true, (NOT p3), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-15 finished in 104267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : PolyORBLF-PT-S02J06T10-LTLFireability-07
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 10 out of 832 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 832 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 742 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 180 place count 742 transition count 1462
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 380 place count 642 transition count 1462
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 389 place count 633 transition count 1453
Iterating global reduction 2 with 9 rules applied. Total rules applied 398 place count 633 transition count 1453
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 9 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 538 place count 563 transition count 1383
Applied a total of 538 rules in 93 ms. Remains 563 /832 variables (removed 269) and now considering 1383/1652 (removed 269) transitions.
Running 1381 sub problems to find dead transitions.
[2024-06-01 15:19:11] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
// Phase 1: matrix 1363 rows 563 cols
[2024-06-01 15:19:11] [INFO ] Computed 46 invariants in 36 ms
[2024-06-01 15:19:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 15:19:24] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:19:24] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:19:24] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:19:25] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:19:25] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:19:25] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 0 ms to minimize.
[2024-06-01 15:19:25] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:19:25] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:19:25] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:19:25] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:19:26] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:19:26] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:19:26] [INFO ] Deduced a trap composed of 47 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:19:26] [INFO ] Deduced a trap composed of 201 places in 286 ms of which 4 ms to minimize.
[2024-06-01 15:19:27] [INFO ] Deduced a trap composed of 60 places in 301 ms of which 4 ms to minimize.
[2024-06-01 15:19:27] [INFO ] Deduced a trap composed of 290 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:19:27] [INFO ] Deduced a trap composed of 87 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:19:29] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 62 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 62 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 18/18 constraints]
After SMT, in 43038ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 43053ms
[2024-06-01 15:19:54] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:19:54] [INFO ] Invariant cache hit.
[2024-06-01 15:19:55] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-06-01 15:19:55] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:19:55] [INFO ] Invariant cache hit.
[2024-06-01 15:19:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:20:11] [INFO ] Implicit Places using invariants and state equation in 16440 ms returned []
Implicit Place search using SMT with State Equation took 16982 ms to find 0 implicit places.
Running 1381 sub problems to find dead transitions.
[2024-06-01 15:20:11] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:20:11] [INFO ] Invariant cache hit.
[2024-06-01 15:20:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 15:20:25] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:20:25] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:20:25] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:20:25] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:20:26] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:20:26] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:20:26] [INFO ] Deduced a trap composed of 47 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:20:26] [INFO ] Deduced a trap composed of 47 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:20:26] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 3 ms to minimize.
[2024-06-01 15:20:26] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:20:26] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:20:27] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:20:27] [INFO ] Deduced a trap composed of 187 places in 251 ms of which 3 ms to minimize.
[2024-06-01 15:20:28] [INFO ] Deduced a trap composed of 60 places in 239 ms of which 3 ms to minimize.
[2024-06-01 15:20:28] [INFO ] Deduced a trap composed of 89 places in 282 ms of which 4 ms to minimize.
[2024-06-01 15:20:29] [INFO ] Deduced a trap composed of 72 places in 248 ms of which 3 ms to minimize.
[2024-06-01 15:20:38] [INFO ] Deduced a trap composed of 363 places in 219 ms of which 3 ms to minimize.
[2024-06-01 15:20:39] [INFO ] Deduced a trap composed of 365 places in 221 ms of which 3 ms to minimize.
[2024-06-01 15:20:42] [INFO ] Deduced a trap composed of 225 places in 291 ms of which 3 ms to minimize.
[2024-06-01 15:20:43] [INFO ] Deduced a trap composed of 207 places in 248 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 64 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 64 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 20/20 constraints]
After SMT, in 62838ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 62851ms
Starting structural reductions in LI_LTL mode, iteration 1 : 563/832 places, 1383/1652 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 122985 ms. Remains : 563/832 places, 1383/1652 transitions.
Running random walk in product with property : PolyORBLF-PT-S02J06T10-LTLFireability-07
Product exploration explored 100000 steps with 10844 reset in 382 ms.
Product exploration explored 100000 steps with 10840 reset in 439 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 72 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 47 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:21:15] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:21:15] [INFO ] Invariant cache hit.
[2024-06-01 15:21:16] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:21:16] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 102 ms returned sat
[2024-06-01 15:21:17] [INFO ] [Real]Absence check using state equation in 1322 ms returned sat
[2024-06-01 15:21:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:21:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:21:18] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 86 ms returned sat
[2024-06-01 15:21:23] [INFO ] [Nat]Absence check using state equation in 5213 ms returned sat
[2024-06-01 15:21:23] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:21:24] [INFO ] [Nat]Added 120 Read/Feed constraints in 775 ms returned sat
[2024-06-01 15:21:24] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:21:24] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:21:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 664 ms
[2024-06-01 15:21:25] [INFO ] Computed and/alt/rep : 511/1130/501 causal constraints (skipped 860 transitions) in 145 ms.
[2024-06-01 15:21:28] [INFO ] Added : 108 causal constraints over 22 iterations in 3805 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 1383/1383 transitions.
Applied a total of 0 rules in 47 ms. Remains 563 /563 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Running 1381 sub problems to find dead transitions.
[2024-06-01 15:21:28] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:21:28] [INFO ] Invariant cache hit.
[2024-06-01 15:21:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:21:42] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:21:43] [INFO ] Deduced a trap composed of 47 places in 287 ms of which 4 ms to minimize.
[2024-06-01 15:21:43] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 3 ms to minimize.
[2024-06-01 15:21:43] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:21:43] [INFO ] Deduced a trap composed of 47 places in 26 ms of which 0 ms to minimize.
[2024-06-01 15:21:43] [INFO ] Deduced a trap composed of 187 places in 217 ms of which 2 ms to minimize.
[2024-06-01 15:21:44] [INFO ] Deduced a trap composed of 60 places in 282 ms of which 4 ms to minimize.
[2024-06-01 15:21:45] [INFO ] Deduced a trap composed of 89 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:21:46] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 60 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 10)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 5)
(s110 1)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 1)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 1)
(s438 0)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 1)
(s445 0)
(s446 0)
(s447 0)
(s448 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 60 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 16/16 constraints]
After SMT, in 42681ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 42700ms
[2024-06-01 15:22:11] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:22:11] [INFO ] Invariant cache hit.
[2024-06-01 15:22:12] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-06-01 15:22:12] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:22:12] [INFO ] Invariant cache hit.
[2024-06-01 15:22:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:22:27] [INFO ] Implicit Places using invariants and state equation in 15159 ms returned []
Implicit Place search using SMT with State Equation took 15618 ms to find 0 implicit places.
[2024-06-01 15:22:27] [INFO ] Redundant transitions in 23 ms returned []
Running 1381 sub problems to find dead transitions.
[2024-06-01 15:22:27] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:22:27] [INFO ] Invariant cache hit.
[2024-06-01 15:22:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 15:22:39] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-06-01 15:22:40] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:22:40] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-06-01 15:22:40] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:22:40] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:22:40] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:22:40] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:22:40] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:22:40] [INFO ] Deduced a trap composed of 47 places in 310 ms of which 4 ms to minimize.
[2024-06-01 15:22:41] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 3 ms to minimize.
[2024-06-01 15:22:41] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:22:41] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:22:41] [INFO ] Deduced a trap composed of 187 places in 330 ms of which 4 ms to minimize.
[2024-06-01 15:22:42] [INFO ] Deduced a trap composed of 60 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:22:42] [INFO ] Deduced a trap composed of 89 places in 247 ms of which 2 ms to minimize.
[2024-06-01 15:22:44] [INFO ] Deduced a trap composed of 72 places in 207 ms of which 3 ms to minimize.
[2024-06-01 15:22:52] [INFO ] Deduced a trap composed of 363 places in 285 ms of which 4 ms to minimize.
[2024-06-01 15:22:53] [INFO ] Deduced a trap composed of 365 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 225 places in 283 ms of which 4 ms to minimize.
[2024-06-01 15:22:57] [INFO ] Deduced a trap composed of 207 places in 313 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 64 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 64 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 20/20 constraints]
After SMT, in 62619ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 62630ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 121035 ms. Remains : 563/563 places, 1383/1383 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 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 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:23:30] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:23:30] [INFO ] Invariant cache hit.
[2024-06-01 15:23:30] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-06-01 15:23:30] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 137 ms returned sat
[2024-06-01 15:23:32] [INFO ] [Real]Absence check using state equation in 1657 ms returned sat
[2024-06-01 15:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:23:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-06-01 15:23:33] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 85 ms returned sat
[2024-06-01 15:23:37] [INFO ] [Nat]Absence check using state equation in 4515 ms returned sat
[2024-06-01 15:23:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:23:38] [INFO ] [Nat]Added 120 Read/Feed constraints in 1082 ms returned sat
[2024-06-01 15:23:39] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:23:40] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:23:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1740 ms
[2024-06-01 15:23:40] [INFO ] Computed and/alt/rep : 511/1130/501 causal constraints (skipped 860 transitions) in 125 ms.
[2024-06-01 15:23:44] [INFO ] Added : 80 causal constraints over 16 iterations in 3403 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10821 reset in 533 ms.
Product exploration explored 100000 steps with 10791 reset in 485 ms.
Support contains 10 out of 563 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 563/563 places, 1383/1383 transitions.
Applied a total of 0 rules in 19 ms. Remains 563 /563 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Running 1381 sub problems to find dead transitions.
[2024-06-01 15:23:45] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:23:45] [INFO ] Invariant cache hit.
[2024-06-01 15:23:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 15:23:58] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:23:58] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:23:58] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:23:58] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:23:58] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:23:58] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:23:58] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:23:58] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:23:59] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 3 ms to minimize.
[2024-06-01 15:23:59] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 3 ms to minimize.
[2024-06-01 15:23:59] [INFO ] Deduced a trap composed of 47 places in 27 ms of which 1 ms to minimize.
[2024-06-01 15:23:59] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:24:00] [INFO ] Deduced a trap composed of 187 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:24:00] [INFO ] Deduced a trap composed of 60 places in 300 ms of which 4 ms to minimize.
[2024-06-01 15:24:01] [INFO ] Deduced a trap composed of 89 places in 296 ms of which 3 ms to minimize.
[2024-06-01 15:24:02] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 60 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 60 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 16/16 constraints]
After SMT, in 42688ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 42700ms
[2024-06-01 15:24:27] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:24:27] [INFO ] Invariant cache hit.
[2024-06-01 15:24:28] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-06-01 15:24:28] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:24:28] [INFO ] Invariant cache hit.
[2024-06-01 15:24:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:24:44] [INFO ] Implicit Places using invariants and state equation in 16223 ms returned []
Implicit Place search using SMT with State Equation took 16762 ms to find 0 implicit places.
[2024-06-01 15:24:44] [INFO ] Redundant transitions in 23 ms returned []
Running 1381 sub problems to find dead transitions.
[2024-06-01 15:24:44] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-06-01 15:24:44] [INFO ] Invariant cache hit.
[2024-06-01 15:24:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-06-01 15:24:57] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 3 ms to minimize.
[2024-06-01 15:24:57] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 2 ms to minimize.
[2024-06-01 15:24:57] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:24:57] [INFO ] Deduced a trap composed of 47 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:24:57] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-06-01 15:24:57] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:24:57] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:24:57] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:24:57] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 3 ms to minimize.
[2024-06-01 15:24:58] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:24:58] [INFO ] Deduced a trap composed of 47 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:24:58] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:24:58] [INFO ] Deduced a trap composed of 187 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:24:59] [INFO ] Deduced a trap composed of 60 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:24:59] [INFO ] Deduced a trap composed of 89 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:25:00] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:25:10] [INFO ] Deduced a trap composed of 363 places in 312 ms of which 3 ms to minimize.
[2024-06-01 15:25:10] [INFO ] Deduced a trap composed of 365 places in 220 ms of which 3 ms to minimize.
[2024-06-01 15:25:12] [INFO ] Deduced a trap composed of 225 places in 278 ms of which 4 ms to minimize.
[2024-06-01 15:25:14] [INFO ] Deduced a trap composed of 207 places in 323 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 3.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 6.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 (/ 1.0 3.0))
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 (/ 2.0 3.0))
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 (/ 1.0 3.0))
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1926 variables, and 64 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1926 variables, and 64 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/563 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 20/20 constraints]
After SMT, in 62706ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 62718ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 122236 ms. Remains : 563/563 places, 1383/1383 transitions.
Treatment of property PolyORBLF-PT-S02J06T10-LTLFireability-07 finished in 396287 ms.
[2024-06-01 15:25:47] [INFO ] Flatten gal took : 79 ms
[2024-06-01 15:25:47] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 15:25:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 832 places, 1652 transitions and 7140 arcs took 14 ms.
Total runtime 2169316 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-LTLFireability-05
FORMULA PolyORBLF-PT-S02J06T10-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717255910551

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-PT-S02J06T10-LTLFireability-05
ltl formula formula --ltl=/tmp/3571/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 832 places, 1652 transitions and 7140 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.440 real 0.070 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3571/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3571/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3571/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3571/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 847 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 833, there are 1673 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2424 levels ~10000 states ~19108 transitions
pnml2lts-mc( 2/ 4): ~4729 levels ~20000 states ~38700 transitions
pnml2lts-mc( 2/ 4): ~9258 levels ~40000 states ~80500 transitions
pnml2lts-mc( 2/ 4): ~18268 levels ~80000 states ~165160 transitions
pnml2lts-mc( 1/ 4): ~33495 levels ~160000 states ~309376 transitions
pnml2lts-mc( 0/ 4): ~53806 levels ~320000 states ~522664 transitions
pnml2lts-mc( 0/ 4): ~100232 levels ~640000 states ~1036024 transitions
pnml2lts-mc( 3/ 4): ~248628 levels ~1280000 states ~2367444 transitions
pnml2lts-mc( 3/ 4): ~470348 levels ~2560000 states ~4790920 transitions
pnml2lts-mc( 3/ 4): ~864919 levels ~5120000 states ~9486384 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 205342
pnml2lts-mc( 0/ 4): unique states count: 6999945
pnml2lts-mc( 0/ 4): unique transitions count: 12720516
pnml2lts-mc( 0/ 4): - self-loop count: 1342
pnml2lts-mc( 0/ 4): - claim dead count: 23332
pnml2lts-mc( 0/ 4): - claim found count: 2003370
pnml2lts-mc( 0/ 4): - claim success count: 6999996
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4174457
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7000000 states 12720637 transitions, fanout: 1.817
pnml2lts-mc( 0/ 4): Total exploration time 361.240 sec (361.220 sec minimum, 361.235 sec on average)
pnml2lts-mc( 0/ 4): States per second: 19378, Transitions per second: 35214
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 142.9MB, 14.5 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 30.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1682 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 142.9MB (~256.0MB paged-in)
ltl formula name PolyORBLF-PT-S02J06T10-LTLFireability-07
ltl formula formula --ltl=/tmp/3571/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 832 places, 1652 transitions and 7140 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.050 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3571/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3571/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3571/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3571/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 847 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 833, there are 1654 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 433
pnml2lts-mc( 0/ 4): unique states count: 433
pnml2lts-mc( 0/ 4): unique transitions count: 602
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 187
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 464
pnml2lts-mc( 0/ 4): - cum. max stack depth: 44
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 464 states 716 transitions, fanout: 1.543
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.000 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 15467, Transitions per second: 23867
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 42.1 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1682 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="PolyORBLF-PT-S02J06T10"
export BK_EXAMINATION="LTLFireability"
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 PolyORBLF-PT-S02J06T10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446700260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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