Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 260K Jun 2 16:33 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 CO4-PT-16-LTLFireability-00
FORMULA_NAME CO4-PT-16-LTLFireability-01
FORMULA_NAME CO4-PT-16-LTLFireability-02
FORMULA_NAME CO4-PT-16-LTLFireability-03
FORMULA_NAME CO4-PT-16-LTLFireability-04
FORMULA_NAME CO4-PT-16-LTLFireability-05
FORMULA_NAME CO4-PT-16-LTLFireability-06
FORMULA_NAME CO4-PT-16-LTLFireability-07
FORMULA_NAME CO4-PT-16-LTLFireability-08
FORMULA_NAME CO4-PT-16-LTLFireability-09
FORMULA_NAME CO4-PT-16-LTLFireability-10
FORMULA_NAME CO4-PT-16-LTLFireability-11
FORMULA_NAME CO4-PT-16-LTLFireability-12
FORMULA_NAME CO4-PT-16-LTLFireability-13
FORMULA_NAME CO4-PT-16-LTLFireability-14
FORMULA_NAME CO4-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717352980944

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 18:29:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:29:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:29:42] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-02 18:29:42] [INFO ] Transformed 837 places.
[2024-06-02 18:29:42] [INFO ] Transformed 1122 transitions.
[2024-06-02 18:29:42] [INFO ] Found NUPN structural information;
[2024-06-02 18:29:42] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 116 places in 10 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 721/721 places, 942/942 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 704 transition count 939
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 180 place count 544 transition count 777
Iterating global reduction 1 with 160 rules applied. Total rules applied 340 place count 544 transition count 777
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 346 place count 544 transition count 771
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 431 place count 459 transition count 669
Iterating global reduction 2 with 85 rules applied. Total rules applied 516 place count 459 transition count 669
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 519 place count 459 transition count 666
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 537 place count 441 transition count 639
Iterating global reduction 3 with 18 rules applied. Total rules applied 555 place count 441 transition count 639
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 557 place count 441 transition count 637
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 566 place count 432 transition count 628
Iterating global reduction 4 with 9 rules applied. Total rules applied 575 place count 432 transition count 628
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 581 place count 426 transition count 622
Iterating global reduction 4 with 6 rules applied. Total rules applied 587 place count 426 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 593 place count 426 transition count 616
Applied a total of 593 rules in 149 ms. Remains 426 /721 variables (removed 295) and now considering 616/942 (removed 326) transitions.
// Phase 1: matrix 616 rows 426 cols
[2024-06-02 18:29:42] [INFO ] Computed 7 invariants in 24 ms
[2024-06-02 18:29:42] [INFO ] Implicit Places using invariants in 286 ms returned [5, 361]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 318 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 424/721 places, 616/942 transitions.
Applied a total of 0 rules in 10 ms. Remains 424 /424 variables (removed 0) and now considering 616/616 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 492 ms. Remains : 424/721 places, 616/942 transitions.
Support contains 31 out of 424 places after structural reductions.
[2024-06-02 18:29:43] [INFO ] Flatten gal took : 71 ms
[2024-06-02 18:29:43] [INFO ] Flatten gal took : 59 ms
[2024-06-02 18:29:43] [INFO ] Input system was already deterministic with 616 transitions.
RANDOM walk for 40000 steps (776 resets) in 1385 ms. (28 steps per ms) remains 16/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (14 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (15 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (13 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 8 ms. (444 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 7 ms. (500 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (14 resets) in 7 ms. (500 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
// Phase 1: matrix 616 rows 424 cols
[2024-06-02 18:29:44] [INFO ] Computed 5 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 10/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 23/53 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 213/266 variables, 53/58 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 402/668 variables, 154/212 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 316/984 variables, 175/387 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/984 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 49/1033 variables, 38/425 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1033 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 7/1040 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1040 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/1040 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 429 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1521 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 10/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 23/53 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 213/266 variables, 53/58 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 402/668 variables, 154/213 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 14/227 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 316/984 variables, 175/402 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/984 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 49/1033 variables, 38/440 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1033 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 7/1040 variables, 4/444 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1040 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/1040 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 444 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2273 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 3873ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Finished Parikh walk after 1346 steps, including 15 resets, run visited all 1 properties in 3 ms. (steps per millisecond=448 )
Parikh walk visited 15 properties in 3349 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 919 edges and 424 vertex of which 420 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.13 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(G(p0))||G(p1))))'
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 413 transition count 601
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 413 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 412 transition count 600
Applied a total of 26 rules in 37 ms. Remains 412 /424 variables (removed 12) and now considering 600/616 (removed 16) transitions.
// Phase 1: matrix 600 rows 412 cols
[2024-06-02 18:29:51] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:29:52] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-02 18:29:52] [INFO ] Invariant cache hit.
[2024-06-02 18:29:52] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2024-06-02 18:29:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (OVERLAPS) 600/1012 variables, 412/417 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:30:10] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 21 ms to minimize.
[2024-06-02 18:30:10] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1012 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 419 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:30:30] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (OVERLAPS) 600/1012 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 599/1019 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:30:44] [INFO ] Deduced a trap composed of 152 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1012 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
After SMT, in 60373ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Starting structural reductions in LTL mode, iteration 1 : 412/424 places, 600/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60922 ms. Remains : 412/424 places, 600/616 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-16-LTLFireability-00
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 2 ms.
FORMULA CO4-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-00 finished in 61201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 413 transition count 600
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 413 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 412 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 412 transition count 599
Applied a total of 26 rules in 24 ms. Remains 412 /424 variables (removed 12) and now considering 599/616 (removed 17) transitions.
// Phase 1: matrix 599 rows 412 cols
[2024-06-02 18:30:53] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 18:30:53] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-06-02 18:30:53] [INFO ] Invariant cache hit.
[2024-06-02 18:30:53] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2024-06-02 18:30:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (OVERLAPS) 599/1011 variables, 412/417 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 18:31:11] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 3 ms to minimize.
[2024-06-02 18:31:11] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 12 ms to minimize.
[2024-06-02 18:31:11] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1011 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 598 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 1011/1011 variables, and 420 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1011 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1011 variables, 598/1018 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 18:31:41] [INFO ] Deduced a trap composed of 152 places in 112 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1011 variables, 1/1019 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1011/1011 variables, and 1019 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 4/4 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 412/424 places, 599/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60807 ms. Remains : 412/424 places, 599/616 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 895 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-16-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-16-LTLFireability-01 finished in 61453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 457 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 418 transition count 456
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 157 rules applied. Total rules applied 312 place count 265 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 313 place count 264 transition count 452
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 313 place count 264 transition count 405
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 407 place count 217 transition count 405
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 411 place count 213 transition count 400
Iterating global reduction 3 with 4 rules applied. Total rules applied 415 place count 213 transition count 400
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 415 place count 213 transition count 397
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 421 place count 210 transition count 397
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 424 place count 207 transition count 391
Iterating global reduction 3 with 3 rules applied. Total rules applied 427 place count 207 transition count 391
Performed 61 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 61 places in 4 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 549 place count 146 transition count 315
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 18 rules applied. Total rules applied 567 place count 146 transition count 297
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 573 place count 143 transition count 294
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 576 place count 140 transition count 288
Iterating global reduction 5 with 3 rules applied. Total rules applied 579 place count 140 transition count 288
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 587 place count 136 transition count 284
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 588 place count 135 transition count 282
Iterating global reduction 5 with 1 rules applied. Total rules applied 589 place count 135 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 590 place count 135 transition count 281
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 672 place count 94 transition count 326
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 693 place count 94 transition count 305
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 720 place count 67 transition count 197
Iterating global reduction 7 with 27 rules applied. Total rules applied 747 place count 67 transition count 197
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 765 place count 67 transition count 179
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 772 place count 60 transition count 141
Iterating global reduction 8 with 7 rules applied. Total rules applied 779 place count 60 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 784 place count 60 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 796 place count 60 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 798 place count 58 transition count 122
Applied a total of 798 rules in 115 ms. Remains 58 /424 variables (removed 366) and now considering 122/616 (removed 494) transitions.
[2024-06-02 18:31:54] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
// Phase 1: matrix 105 rows 58 cols
[2024-06-02 18:31:54] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:31:54] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-02 18:31:54] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
[2024-06-02 18:31:54] [INFO ] Invariant cache hit.
[2024-06-02 18:31:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:31:54] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-06-02 18:31:54] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-02 18:31:54] [INFO ] Flow matrix only has 105 transitions (discarded 17 similar events)
[2024-06-02 18:31:54] [INFO ] Invariant cache hit.
[2024-06-02 18:31:54] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 104/162 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 1/163 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 65 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1682 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 104/162 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 99/163 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/163 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 164 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 3515ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 3517ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/424 places, 122/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3908 ms. Remains : 58/424 places, 122/616 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-03
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-03 finished in 3951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))&&F((!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 413 transition count 601
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 413 transition count 601
Applied a total of 24 rules in 22 ms. Remains 413 /424 variables (removed 11) and now considering 601/616 (removed 15) transitions.
// Phase 1: matrix 601 rows 413 cols
[2024-06-02 18:31:58] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:31:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:31:58] [INFO ] Invariant cache hit.
[2024-06-02 18:31:58] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-02 18:31:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 601/1014 variables, 413/418 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-02 18:32:16] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-06-02 18:32:16] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1014 variables, 2/420 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-02 18:32:25] [INFO ] Deduced a trap composed of 152 places in 77 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 421 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/421 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 600/1021 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1014 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 1021 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 3/3 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Starting structural reductions in LTL mode, iteration 1 : 413/424 places, 601/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60547 ms. Remains : 413/424 places, 601/616 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-04
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-04 finished in 60758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0)&&X(G(X(p1)))) U p2)))'
Support contains 6 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 415 transition count 607
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 415 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 415 transition count 605
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 412 transition count 600
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 412 transition count 600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 411 transition count 599
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 411 transition count 599
Applied a total of 28 rules in 15 ms. Remains 411 /424 variables (removed 13) and now considering 599/616 (removed 17) transitions.
// Phase 1: matrix 599 rows 411 cols
[2024-06-02 18:32:59] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 18:32:59] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 18:32:59] [INFO ] Invariant cache hit.
[2024-06-02 18:32:59] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 598 sub problems to find dead transitions.
[2024-06-02 18:32:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 18:33:09] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1010 variables, 411/417 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 18:33:17] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-06-02 18:33:17] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-06-02 18:33:18] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 420 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 599/1010 variables, 411/420 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 598/1018 constraints. Problems are: Problem set: 0 solved, 598 unsolved
[2024-06-02 18:33:40] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 3 ms to minimize.
[2024-06-02 18:33:48] [INFO ] Deduced a trap composed of 152 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1010 variables, 2/1020 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1020 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 6/6 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Starting structural reductions in LTL mode, iteration 1 : 411/424 places, 599/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60534 ms. Remains : 411/424 places, 599/616 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-16-LTLFireability-05
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-05 finished in 60725 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((!(X(p0) U p1)&&!(p0 U p2)))))'
Support contains 2 out of 424 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 414 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 414 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 414 transition count 603
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 411 transition count 598
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 411 transition count 598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 410 transition count 597
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 410 transition count 597
Applied a total of 30 rules in 20 ms. Remains 410 /424 variables (removed 14) and now considering 597/616 (removed 19) transitions.
// Phase 1: matrix 597 rows 410 cols
[2024-06-02 18:33:59] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:34:00] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 18:34:00] [INFO ] Invariant cache hit.
[2024-06-02 18:34:00] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2024-06-02 18:34:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:34:17] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-06-02 18:34:17] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:34:26] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 418 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:34:37] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/419 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1007 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1015 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 4/4 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in LTL mode, iteration 1 : 410/424 places, 597/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60550 ms. Remains : 410/424 places, 597/616 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (OR p2 p1), (OR p2 p1)]
Running random walk in product with property : CO4-PT-16-LTLFireability-07
Product exploration explored 100000 steps with 848 reset in 188 ms.
Product exploration explored 100000 steps with 537 reset in 134 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 893 edges and 410 vertex of which 407 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (OR p2 p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (894 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (156 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (148 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (159 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 709706 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :0 out of 3
Probabilistic random walk after 709706 steps, saw 114168 distinct states, run finished after 3014 ms. (steps per millisecond=235 ) properties seen :0
[2024-06-02 18:35:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 157/166 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/175 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 23/198 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 392/590 variables, 160/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/590 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 285/875 variables, 156/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/875 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 109/984 variables, 62/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/984 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 21/1005 variables, 15/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1005 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1007 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1007 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1007 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 415 constraints, problems are : Problem set: 0 solved, 3 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 157/166 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/175 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 23/198 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 392/590 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 285/875 variables, 156/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/875 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 109/984 variables, 62/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 21/1005 variables, 15/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1005 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/1007 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1007 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1007 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 418 constraints, problems are : Problem set: 0 solved, 3 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 883ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 51 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=25 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (OR p1 p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-16-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-16-LTLFireability-07 finished in 65400 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||G(p1)))&&F(G(p2)))))'
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 445 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 146 place count 418 transition count 465
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 147 rules applied. Total rules applied 293 place count 274 transition count 462
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 301 place count 273 transition count 455
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 309 place count 266 transition count 454
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 309 place count 266 transition count 408
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 401 place count 220 transition count 408
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 405 place count 216 transition count 403
Iterating global reduction 4 with 4 rules applied. Total rules applied 409 place count 216 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 409 place count 216 transition count 400
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 415 place count 213 transition count 400
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 418 place count 210 transition count 394
Iterating global reduction 4 with 3 rules applied. Total rules applied 421 place count 210 transition count 394
Performed 61 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 543 place count 149 transition count 319
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 17 rules applied. Total rules applied 560 place count 149 transition count 302
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 565 place count 147 transition count 299
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 567 place count 146 transition count 298
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 570 place count 143 transition count 292
Iterating global reduction 7 with 3 rules applied. Total rules applied 573 place count 143 transition count 292
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 579 place count 140 transition count 289
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 580 place count 139 transition count 287
Iterating global reduction 7 with 1 rules applied. Total rules applied 581 place count 139 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 582 place count 139 transition count 286
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 664 place count 98 transition count 332
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 683 place count 98 transition count 313
Discarding 28 places :
Symmetric choice reduction at 9 with 28 rule applications. Total rules 711 place count 70 transition count 201
Iterating global reduction 9 with 28 rules applied. Total rules applied 739 place count 70 transition count 201
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 756 place count 70 transition count 184
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 763 place count 63 transition count 146
Iterating global reduction 10 with 7 rules applied. Total rules applied 770 place count 63 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 775 place count 63 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 777 place count 62 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 796 place count 62 transition count 139
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 798 place count 62 transition count 139
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 800 place count 60 transition count 137
Applied a total of 800 rules in 75 ms. Remains 60 /424 variables (removed 364) and now considering 137/616 (removed 479) transitions.
[2024-06-02 18:35:05] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
// Phase 1: matrix 123 rows 60 cols
[2024-06-02 18:35:05] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:35:05] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 18:35:05] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 18:35:05] [INFO ] Invariant cache hit.
[2024-06-02 18:35:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 18:35:05] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-02 18:35:05] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-02 18:35:05] [INFO ] Flow matrix only has 123 transitions (discarded 14 similar events)
[2024-06-02 18:35:05] [INFO ] Invariant cache hit.
[2024-06-02 18:35:05] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 122/181 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 1/183 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 70 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2409 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 122/181 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 71/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 1/182 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 47/187 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 188 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3275 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 5730ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 5731ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/424 places, 137/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5920 ms. Remains : 60/424 places, 137/616 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : CO4-PT-16-LTLFireability-08
Stuttering criterion allowed to conclude after 1459 steps with 111 reset in 16 ms.
FORMULA CO4-PT-16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-08 finished in 6076 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||X((p0||F(p1)))))))'
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 416 transition count 607
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 416 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 416 transition count 606
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 413 transition count 601
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 413 transition count 601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 412 transition count 600
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 412 transition count 600
Applied a total of 25 rules in 18 ms. Remains 412 /424 variables (removed 12) and now considering 600/616 (removed 16) transitions.
// Phase 1: matrix 600 rows 412 cols
[2024-06-02 18:35:11] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:35:11] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 18:35:11] [INFO ] Invariant cache hit.
[2024-06-02 18:35:11] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2024-06-02 18:35:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:35:22] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/418 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:35:30] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-06-02 18:35:30] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 3 ms to minimize.
[2024-06-02 18:35:30] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 421 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 599/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Starting structural reductions in LTL mode, iteration 1 : 412/424 places, 600/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60526 ms. Remains : 412/424 places, 600/616 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-16-LTLFireability-09
Product exploration explored 100000 steps with 429 reset in 104 ms.
Product exploration explored 100000 steps with 1433 reset in 143 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 896 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 79 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (843 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (149 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (161 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (159 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 685594 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :0 out of 3
Probabilistic random walk after 685594 steps, saw 111379 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
[2024-06-02 18:36:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 184/269 variables, 68/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/282 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 17/299 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 321/620 variables, 120/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/620 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 288/908 variables, 141/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/908 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 98/1006 variables, 68/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1006 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/1012 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1012 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1012 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 417 constraints, problems are : Problem set: 0 solved, 3 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 184/269 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/282 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/299 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 321/620 variables, 120/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 288/908 variables, 141/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/908 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 98/1006 variables, 68/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1006 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/1012 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1012 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1012 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 420 constraints, problems are : Problem set: 0 solved, 3 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 814ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 8620 steps, including 137 resets, run visited all 3 properties in 60 ms. (steps per millisecond=143 )
Parikh walk visited 3 properties in 60 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 205 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 600/600 transitions.
Applied a total of 0 rules in 4 ms. Remains 412 /412 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-06-02 18:36:16] [INFO ] Invariant cache hit.
[2024-06-02 18:36:17] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 18:36:17] [INFO ] Invariant cache hit.
[2024-06-02 18:36:17] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2024-06-02 18:36:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:36:27] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/418 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:36:35] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:36:35] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 3 ms to minimize.
[2024-06-02 18:36:35] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 421 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 599/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Finished structural reductions in LTL mode , in 1 iterations and 60535 ms. Remains : 412/412 places, 600/600 transitions.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 896 edges and 412 vertex of which 409 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 76 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (891 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (155 resets) in 30 ms. (1290 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (151 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (160 resets) in 28 ms. (1379 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1052396 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :0 out of 3
Probabilistic random walk after 1052396 steps, saw 164051 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :0
[2024-06-02 18:37:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 184/269 variables, 68/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/282 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 17/299 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 321/620 variables, 120/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/620 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 288/908 variables, 141/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/908 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 98/1006 variables, 68/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1006 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/1012 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1012 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1012 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 417 constraints, problems are : Problem set: 0 solved, 3 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 184/269 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/282 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/299 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 321/620 variables, 120/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/620 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 288/908 variables, 141/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/908 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 98/1006 variables, 68/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1006 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/1012 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1012 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1012 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 420 constraints, problems are : Problem set: 0 solved, 3 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 816ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 35 ms.
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 600/600 transitions.
Graph (trivial) has 446 edges and 412 vertex of which 2 / 412 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 894 edges and 411 vertex of which 389 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 389 transition count 417
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 146 rules applied. Total rules applied 309 place count 246 transition count 414
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 309 place count 246 transition count 363
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 411 place count 195 transition count 363
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 414 place count 192 transition count 360
Iterating global reduction 2 with 3 rules applied. Total rules applied 417 place count 192 transition count 360
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 420 place count 192 transition count 357
Performed 59 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 538 place count 133 transition count 285
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 17 rules applied. Total rules applied 555 place count 133 transition count 268
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 561 place count 130 transition count 265
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 564 place count 127 transition count 259
Iterating global reduction 5 with 3 rules applied. Total rules applied 567 place count 127 transition count 259
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 575 place count 123 transition count 255
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 576 place count 123 transition count 254
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 577 place count 122 transition count 252
Iterating global reduction 6 with 1 rules applied. Total rules applied 578 place count 122 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 579 place count 122 transition count 251
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 657 place count 83 transition count 294
Drop transitions (Empty/Sink Transition effects.) removed 61 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 7 with 81 rules applied. Total rules applied 738 place count 83 transition count 213
Discarding 29 places :
Symmetric choice reduction at 8 with 29 rule applications. Total rules 767 place count 54 transition count 144
Iterating global reduction 8 with 29 rules applied. Total rules applied 796 place count 54 transition count 144
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 817 place count 54 transition count 123
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 823 place count 48 transition count 99
Iterating global reduction 9 with 6 rules applied. Total rules applied 829 place count 48 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 833 place count 48 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 835 place count 47 transition count 106
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 838 place count 47 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 11 with 12 rules applied. Total rules applied 850 place count 47 transition count 91
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 851 place count 46 transition count 89
Iterating global reduction 11 with 1 rules applied. Total rules applied 852 place count 46 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 853 place count 46 transition count 88
Free-agglomeration rule applied 11 times.
Iterating global reduction 12 with 11 rules applied. Total rules applied 864 place count 46 transition count 77
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 877 place count 35 transition count 75
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 880 place count 35 transition count 75
Graph (complete) has 138 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 881 place count 34 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 884 place count 34 transition count 72
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 887 place count 34 transition count 72
Graph (complete) has 130 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 888 place count 33 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 891 place count 33 transition count 69
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 894 place count 33 transition count 69
Graph (complete) has 122 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 895 place count 32 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 898 place count 32 transition count 66
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 901 place count 32 transition count 66
Graph (complete) has 114 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 1 rules applied. Total rules applied 902 place count 31 transition count 66
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 905 place count 31 transition count 63
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 908 place count 31 transition count 63
Graph (complete) has 106 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 21 with 1 rules applied. Total rules applied 909 place count 30 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 912 place count 30 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 913 place count 29 transition count 59
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t319.t489 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 25 vertex of which 2 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 23 with 5 rules applied. Total rules applied 918 place count 24 transition count 55
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 24 edges and 18 vertex of which 11 / 18 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 24 with 17 rules applied. Total rules applied 935 place count 9 transition count 45
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 34 transitions.
Graph (complete) has 11 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 25 with 37 rules applied. Total rules applied 972 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 974 place count 6 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 27 with 3 rules applied. Total rules applied 977 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 27 with 2 Pre rules applied. Total rules applied 977 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 27 with 4 rules applied. Total rules applied 981 place count 4 transition count 4
Applied a total of 981 rules in 43 ms. Remains 4 /412 variables (removed 408) and now considering 4/600 (removed 596) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 4/412 places, 4/600 transitions.
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 188 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 518 reset in 81 ms.
Product exploration explored 100000 steps with 846 reset in 98 ms.
Built C files in :
/tmp/ltsmin18107692733087953234
[2024-06-02 18:37:22] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18107692733087953234
Running compilation step : cd /tmp/ltsmin18107692733087953234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1200 ms.
Running link step : cd /tmp/ltsmin18107692733087953234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin18107692733087953234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8747780984797396745.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 412 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 412/412 places, 600/600 transitions.
Applied a total of 0 rules in 11 ms. Remains 412 /412 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2024-06-02 18:37:37] [INFO ] Invariant cache hit.
[2024-06-02 18:37:37] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:37:37] [INFO ] Invariant cache hit.
[2024-06-02 18:37:38] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2024-06-02 18:37:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:37:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/418 constraints. Problems are: Problem set: 0 solved, 599 unsolved
[2024-06-02 18:37:56] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 4 ms to minimize.
[2024-06-02 18:37:56] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:37:57] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 3/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1012 variables, and 421 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/421 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 599/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1012 variables, and 1020 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/412 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 4/4 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Finished structural reductions in LTL mode , in 1 iterations and 60537 ms. Remains : 412/412 places, 600/600 transitions.
Built C files in :
/tmp/ltsmin17211245138371086953
[2024-06-02 18:38:38] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17211245138371086953
Running compilation step : cd /tmp/ltsmin17211245138371086953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 972 ms.
Running link step : cd /tmp/ltsmin17211245138371086953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17211245138371086953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17303057652403529572.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 18:38:53] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:38:53] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:38:53] [INFO ] Time to serialize gal into /tmp/LTL17750244916939681290.gal : 5 ms
[2024-06-02 18:38:53] [INFO ] Time to serialize properties into /tmp/LTL8740890066479781438.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17750244916939681290.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3159414356947975282.hoa' '-atoms' '/tmp/LTL8740890066479781438.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8740890066479781438.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3159414356947975282.hoa
Detected timeout of ITS tools.
[2024-06-02 18:39:08] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:39:08] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:39:08] [INFO ] Time to serialize gal into /tmp/LTL17397870049939625087.gal : 4 ms
[2024-06-02 18:39:08] [INFO ] Time to serialize properties into /tmp/LTL11715598791781875237.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17397870049939625087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11715598791781875237.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p554==0)")||(X(("(p554==0)")||(F("(p204==0)"))))))))
Formula 0 simplified : GF(!"(p554==0)" & X(!"(p554==0)" & G!"(p204==0)"))
Detected timeout of ITS tools.
[2024-06-02 18:39:23] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:39:23] [INFO ] Applying decomposition
[2024-06-02 18:39:23] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph162542134755114432.txt' '-o' '/tmp/graph162542134755114432.bin' '-w' '/tmp/graph162542134755114432.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph162542134755114432.bin' '-l' '-1' '-v' '-w' '/tmp/graph162542134755114432.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:39:23] [INFO ] Decomposing Gal with order
[2024-06-02 18:39:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:39:23] [INFO ] Removed a total of 398 redundant transitions.
[2024-06-02 18:39:23] [INFO ] Flatten gal took : 70 ms
[2024-06-02 18:39:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 14 ms.
[2024-06-02 18:39:23] [INFO ] Time to serialize gal into /tmp/LTL568487349883247109.gal : 8 ms
[2024-06-02 18:39:23] [INFO ] Time to serialize properties into /tmp/LTL17809986546993010391.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL568487349883247109.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17809986546993010391.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i10.u102.p554==0)")||(X(("(i10.u102.p554==0)")||(F("(i2.u27.p204==0)"))))))))
Formula 0 simplified : GF(!"(i10.u102.p554==0)" & X(!"(i10.u102.p554==0)" & G!"(i2.u27.p204==0)"))
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t81, t140, t150, t199, t209, t221, t318, t453, t489, t546, t577, i0.t450, i1.u21.t4...916
Computing Next relation with stutter on 685439 deadlock states
89 unique states visited
89 strongly connected components in search stack
90 transitions explored
89 items max in DFS search stack
911 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.15261,357712,1,0,661565,12294,6856,2.10335e+06,549,69700,585808
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-16-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CO4-PT-16-LTLFireability-09 finished in 263891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 453 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 153 place count 418 transition count 458
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 155 rules applied. Total rules applied 308 place count 267 transition count 454
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 310 place count 266 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 311 place count 265 transition count 453
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 311 place count 265 transition count 407
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 403 place count 219 transition count 407
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 407 place count 215 transition count 402
Iterating global reduction 4 with 4 rules applied. Total rules applied 411 place count 215 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 411 place count 215 transition count 399
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 417 place count 212 transition count 399
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 420 place count 209 transition count 393
Iterating global reduction 4 with 3 rules applied. Total rules applied 423 place count 209 transition count 393
Performed 62 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 547 place count 147 transition count 316
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 17 rules applied. Total rules applied 564 place count 147 transition count 299
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 570 place count 144 transition count 296
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 573 place count 141 transition count 290
Iterating global reduction 6 with 3 rules applied. Total rules applied 576 place count 141 transition count 290
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 582 place count 138 transition count 287
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 583 place count 137 transition count 285
Iterating global reduction 6 with 1 rules applied. Total rules applied 584 place count 137 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 585 place count 137 transition count 284
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 665 place count 97 transition count 327
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 685 place count 97 transition count 307
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 712 place count 70 transition count 199
Iterating global reduction 8 with 27 rules applied. Total rules applied 739 place count 70 transition count 199
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 757 place count 70 transition count 181
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 763 place count 64 transition count 149
Iterating global reduction 9 with 6 rules applied. Total rules applied 769 place count 64 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 773 place count 64 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 775 place count 63 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 10 with 18 rules applied. Total rules applied 793 place count 63 transition count 144
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 795 place count 61 transition count 142
Applied a total of 795 rules in 62 ms. Remains 61 /424 variables (removed 363) and now considering 142/616 (removed 474) transitions.
[2024-06-02 18:39:35] [INFO ] Flow matrix only has 119 transitions (discarded 23 similar events)
// Phase 1: matrix 119 rows 61 cols
[2024-06-02 18:39:35] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:39:35] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 18:39:35] [INFO ] Flow matrix only has 119 transitions (discarded 23 similar events)
[2024-06-02 18:39:35] [INFO ] Invariant cache hit.
[2024-06-02 18:39:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 18:39:35] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-06-02 18:39:35] [INFO ] Redundant transitions in 3 ms returned []
Running 119 sub problems to find dead transitions.
[2024-06-02 18:39:35] [INFO ] Flow matrix only has 119 transitions (discarded 23 similar events)
[2024-06-02 18:39:35] [INFO ] Invariant cache hit.
[2024-06-02 18:39:35] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 118/179 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 70 constraints, problems are : Problem set: 0 solved, 119 unsolved in 1872 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 118/179 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 119/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 1/180 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 189 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2448 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 4362ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 4363ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/424 places, 142/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4549 ms. Remains : 61/424 places, 142/616 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-10
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-10 finished in 4654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1||X(F(p2)))))))'
Support contains 3 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 452 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 918 edges and 423 vertex of which 419 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 418 transition count 460
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 153 rules applied. Total rules applied 304 place count 269 transition count 456
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 306 place count 268 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 307 place count 267 transition count 455
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 307 place count 267 transition count 408
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 401 place count 220 transition count 408
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 406 place count 215 transition count 402
Iterating global reduction 4 with 5 rules applied. Total rules applied 411 place count 215 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 411 place count 215 transition count 399
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 417 place count 212 transition count 399
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 419 place count 210 transition count 395
Iterating global reduction 4 with 2 rules applied. Total rules applied 421 place count 210 transition count 395
Performed 61 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 543 place count 149 transition count 319
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 17 rules applied. Total rules applied 560 place count 149 transition count 302
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 566 place count 146 transition count 299
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 569 place count 143 transition count 293
Iterating global reduction 6 with 3 rules applied. Total rules applied 572 place count 143 transition count 293
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 578 place count 140 transition count 290
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 660 place count 99 transition count 340
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 681 place count 99 transition count 319
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 709 place count 71 transition count 207
Iterating global reduction 7 with 28 rules applied. Total rules applied 737 place count 71 transition count 207
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 756 place count 71 transition count 188
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 762 place count 65 transition count 156
Iterating global reduction 8 with 6 rules applied. Total rules applied 768 place count 65 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 772 place count 65 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 786 place count 65 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 788 place count 63 transition count 136
Applied a total of 788 rules in 56 ms. Remains 63 /424 variables (removed 361) and now considering 136/616 (removed 480) transitions.
[2024-06-02 18:39:39] [INFO ] Flow matrix only has 118 transitions (discarded 18 similar events)
// Phase 1: matrix 118 rows 63 cols
[2024-06-02 18:39:39] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:39:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:39:40] [INFO ] Flow matrix only has 118 transitions (discarded 18 similar events)
[2024-06-02 18:39:40] [INFO ] Invariant cache hit.
[2024-06-02 18:39:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:39:40] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-06-02 18:39:40] [INFO ] Redundant transitions in 3 ms returned []
Running 113 sub problems to find dead transitions.
[2024-06-02 18:39:40] [INFO ] Flow matrix only has 118 transitions (discarded 18 similar events)
[2024-06-02 18:39:40] [INFO ] Invariant cache hit.
[2024-06-02 18:39:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 117/179 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/181 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 70 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2376 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 117/179 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 68/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/180 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/181 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 183 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 5429ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 5430ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/424 places, 136/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5624 ms. Remains : 63/424 places, 136/616 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-16-LTLFireability-11
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-11 finished in 5765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 414 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 414 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 414 transition count 603
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 411 transition count 598
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 411 transition count 598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 410 transition count 597
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 410 transition count 597
Applied a total of 30 rules in 15 ms. Remains 410 /424 variables (removed 14) and now considering 597/616 (removed 19) transitions.
// Phase 1: matrix 597 rows 410 cols
[2024-06-02 18:39:45] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 18:39:45] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 18:39:45] [INFO ] Invariant cache hit.
[2024-06-02 18:39:46] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2024-06-02 18:39:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:40:03] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 6 ms to minimize.
[2024-06-02 18:40:03] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:40:12] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 418 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:40:23] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/419 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1007 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1015 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 4/4 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Starting structural reductions in LTL mode, iteration 1 : 410/424 places, 597/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 410/424 places, 597/616 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-12 finished in 60677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 414 transition count 605
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 414 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 414 transition count 603
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 411 transition count 598
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 411 transition count 598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 410 transition count 597
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 410 transition count 597
Applied a total of 30 rules in 16 ms. Remains 410 /424 variables (removed 14) and now considering 597/616 (removed 19) transitions.
[2024-06-02 18:40:46] [INFO ] Invariant cache hit.
[2024-06-02 18:40:46] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 18:40:46] [INFO ] Invariant cache hit.
[2024-06-02 18:40:46] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2024-06-02 18:40:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 597/1007 variables, 410/415 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:41:04] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:41:04] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:41:13] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 418 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-02 18:41:23] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (OVERLAPS) 597/1007 variables, 410/419 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 596/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1007 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1015 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 4/4 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in LTL mode, iteration 1 : 410/424 places, 597/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60612 ms. Remains : 410/424 places, 597/616 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-13
Entered a terminal (fully accepting) state of product in 111 steps with 2 reset in 1 ms.
FORMULA CO4-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-13 finished in 60801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 424 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 424/424 places, 616/616 transitions.
Graph (trivial) has 457 edges and 424 vertex of which 2 / 424 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 918 edges and 423 vertex of which 422 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 156 place count 421 transition count 459
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 158 rules applied. Total rules applied 314 place count 267 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 315 place count 266 transition count 455
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 315 place count 266 transition count 408
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 409 place count 219 transition count 408
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 413 place count 215 transition count 403
Iterating global reduction 3 with 4 rules applied. Total rules applied 417 place count 215 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 417 place count 215 transition count 400
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 423 place count 212 transition count 400
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 426 place count 209 transition count 394
Iterating global reduction 3 with 3 rules applied. Total rules applied 429 place count 209 transition count 394
Performed 62 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 553 place count 147 transition count 317
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 18 rules applied. Total rules applied 571 place count 147 transition count 299
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 577 place count 144 transition count 296
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 580 place count 141 transition count 290
Iterating global reduction 5 with 3 rules applied. Total rules applied 583 place count 141 transition count 290
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 591 place count 137 transition count 286
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 592 place count 136 transition count 284
Iterating global reduction 5 with 1 rules applied. Total rules applied 593 place count 136 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 594 place count 136 transition count 283
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 676 place count 95 transition count 329
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 696 place count 95 transition count 309
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 724 place count 67 transition count 197
Iterating global reduction 7 with 28 rules applied. Total rules applied 752 place count 67 transition count 197
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 771 place count 67 transition count 178
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 778 place count 60 transition count 140
Iterating global reduction 8 with 7 rules applied. Total rules applied 785 place count 60 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 790 place count 60 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 792 place count 59 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 812 place count 59 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 814 place count 57 transition count 130
Applied a total of 814 rules in 48 ms. Remains 57 /424 variables (removed 367) and now considering 130/616 (removed 486) transitions.
[2024-06-02 18:41:47] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
// Phase 1: matrix 102 rows 57 cols
[2024-06-02 18:41:47] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:41:47] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 18:41:47] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
[2024-06-02 18:41:47] [INFO ] Invariant cache hit.
[2024-06-02 18:41:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:41:47] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-02 18:41:47] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
[2024-06-02 18:41:47] [INFO ] Flow matrix only has 102 transitions (discarded 28 similar events)
[2024-06-02 18:41:47] [INFO ] Invariant cache hit.
[2024-06-02 18:41:47] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 101/158 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 1/159 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 65 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1533 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 101/158 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 107/171 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 172 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2008 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 3572ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 3573ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/424 places, 130/616 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3794 ms. Remains : 57/424 places, 130/616 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLFireability-14
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLFireability-14 finished in 3844 ms.
All properties solved by simple procedures.
Total runtime 728921 ms.

BK_STOP 1717353711124

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CO4-PT-16"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CO4-PT-16, 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 r550-tall-171734898600124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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