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-171734898600132.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-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898600132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 248K 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-17-LTLFireability-00
FORMULA_NAME CO4-PT-17-LTLFireability-01
FORMULA_NAME CO4-PT-17-LTLFireability-02
FORMULA_NAME CO4-PT-17-LTLFireability-03
FORMULA_NAME CO4-PT-17-LTLFireability-04
FORMULA_NAME CO4-PT-17-LTLFireability-05
FORMULA_NAME CO4-PT-17-LTLFireability-06
FORMULA_NAME CO4-PT-17-LTLFireability-07
FORMULA_NAME CO4-PT-17-LTLFireability-08
FORMULA_NAME CO4-PT-17-LTLFireability-09
FORMULA_NAME CO4-PT-17-LTLFireability-10
FORMULA_NAME CO4-PT-17-LTLFireability-11
FORMULA_NAME CO4-PT-17-LTLFireability-12
FORMULA_NAME CO4-PT-17-LTLFireability-13
FORMULA_NAME CO4-PT-17-LTLFireability-14
FORMULA_NAME CO4-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717353721156

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 18:42:02] [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:42:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:42:02] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-02 18:42:02] [INFO ] Transformed 967 places.
[2024-06-02 18:42:02] [INFO ] Transformed 1150 transitions.
[2024-06-02 18:42:02] [INFO ] Found NUPN structural information;
[2024-06-02 18:42:02] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 198 places in 10 ms
Reduce places removed 198 places and 238 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-17-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 912/912 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 750 transition count 911
Discarding 160 places :
Symmetric choice reduction at 1 with 160 rule applications. Total rules 180 place count 590 transition count 751
Iterating global reduction 1 with 160 rules applied. Total rules applied 340 place count 590 transition count 751
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 347 place count 590 transition count 744
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 431 place count 506 transition count 660
Iterating global reduction 2 with 84 rules applied. Total rules applied 515 place count 506 transition count 660
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 530 place count 491 transition count 643
Iterating global reduction 2 with 15 rules applied. Total rules applied 545 place count 491 transition count 643
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 548 place count 491 transition count 640
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 550 place count 489 transition count 638
Iterating global reduction 3 with 2 rules applied. Total rules applied 552 place count 489 transition count 638
Applied a total of 552 rules in 159 ms. Remains 489 /769 variables (removed 280) and now considering 638/912 (removed 274) transitions.
// Phase 1: matrix 638 rows 489 cols
[2024-06-02 18:42:02] [INFO ] Computed 5 invariants in 28 ms
[2024-06-02 18:42:03] [INFO ] Implicit Places using invariants in 288 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 327 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/769 places, 638/912 transitions.
Applied a total of 0 rules in 20 ms. Remains 488 /488 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 525 ms. Remains : 488/769 places, 638/912 transitions.
Support contains 26 out of 488 places after structural reductions.
[2024-06-02 18:42:03] [INFO ] Flatten gal took : 63 ms
[2024-06-02 18:42:03] [INFO ] Flatten gal took : 34 ms
[2024-06-02 18:42:03] [INFO ] Input system was already deterministic with 638 transitions.
Support contains 25 out of 488 places (down from 26) after GAL structural reductions.
RANDOM walk for 40000 steps (40 resets) in 1394 ms. (28 steps per ms) remains 20/23 properties
BEST_FIRST walk for 4002 steps (20 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (18 resets) in 67 ms. (58 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4004 steps (18 resets) in 11 ms. (333 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4002 steps (17 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (15 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (21 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (13 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (20 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (16 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (18 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (15 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (18 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
// Phase 1: matrix 638 rows 488 cols
[2024-06-02 18:42:04] [INFO ] Computed 4 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 116/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 468/602 variables, 173/191 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 8/610 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/610 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 16/626 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 389/1015 variables, 228/423 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1015 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 86/1101 variables, 52/475 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1101 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 13 (OVERLAPS) 25/1126 variables, 17/492 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1126 variables, 0/492 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/1126 variables, 0/492 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1126/1126 variables, and 492 constraints, problems are : Problem set: 1 solved, 15 unsolved in 1969 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 116/134 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 468/602 variables, 173/191 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 15/206 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 8/610 variables, 1/207 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 16/626 variables, 3/210 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 389/1015 variables, 228/438 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1015 variables, 0/438 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 86/1101 variables, 52/490 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1101 variables, 0/490 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 25/1126 variables, 17/507 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1126 variables, 0/507 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/1126 variables, 0/507 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1126/1126 variables, and 507 constraints, problems are : Problem set: 1 solved, 15 unsolved in 2848 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 4895ms problems are : Problem set: 1 solved, 15 unsolved
Fused 15 Parikh solutions to 13 different solutions.
Finished Parikh walk after 1005 steps, including 11 resets, run visited all 1 properties in 2 ms. (steps per millisecond=502 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 15 properties in 2809 ms.
FORMULA CO4-PT-17-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 827 edges and 488 vertex of which 482 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 479 transition count 629
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 479 transition count 629
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 479 transition count 627
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 475 transition count 622
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 475 transition count 622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 473 transition count 620
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 473 transition count 620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 472 transition count 619
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 472 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 472 transition count 618
Applied a total of 35 rules in 51 ms. Remains 472 /488 variables (removed 16) and now considering 618/638 (removed 20) transitions.
// Phase 1: matrix 618 rows 472 cols
[2024-06-02 18:42:12] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:42:12] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 18:42:12] [INFO ] Invariant cache hit.
[2024-06-02 18:42:12] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2024-06-02 18:42:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (OVERLAPS) 618/1090 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 617 unsolved
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 28 ms to minimize.
[2024-06-02 18:42:33] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1090 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 617 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1090 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 617/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1095 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Starting structural reductions in LTL mode, iteration 1 : 472/488 places, 618/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60695 ms. Remains : 472/488 places, 618/638 transitions.
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLFireability-00
Product exploration explored 100000 steps with 34 reset in 214 ms.
Product exploration explored 100000 steps with 4 reset in 110 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 803 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 20670 steps (72 resets) in 58 ms. (350 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 618/618 transitions.
Applied a total of 0 rules in 16 ms. Remains 472 /472 variables (removed 0) and now considering 618/618 (removed 0) transitions.
[2024-06-02 18:43:14] [INFO ] Invariant cache hit.
[2024-06-02 18:43:14] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 18:43:14] [INFO ] Invariant cache hit.
[2024-06-02 18:43:14] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2024-06-02 18:43:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (OVERLAPS) 618/1090 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 617 unsolved
[2024-06-02 18:43:35] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 5 ms to minimize.
[2024-06-02 18:43:35] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1090 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 617 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1090 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 617/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1095 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Finished structural reductions in LTL mode , in 1 iterations and 60717 ms. Remains : 472/472 places, 618/618 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 803 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (70 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32792 steps (78 resets) in 33 ms. (964 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10 reset in 78 ms.
Product exploration explored 100000 steps with 33 reset in 118 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 618/618 transitions.
Graph (trivial) has 517 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 802 edges and 471 vertex of which 468 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 164 rules applied. Total rules applied 166 place count 468 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 167 place count 468 transition count 612
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 167 place count 468 transition count 673
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 64 rules applied. Total rules applied 231 place count 468 transition count 673
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 264 place count 435 transition count 640
Deduced a syphon composed of 194 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 297 place count 435 transition count 640
Performed 56 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 250 places in 0 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 353 place count 435 transition count 712
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 361 place count 435 transition count 704
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 387 place count 409 transition count 672
Deduced a syphon composed of 231 places in 1 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 413 place count 409 transition count 672
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 415 place count 407 transition count 669
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 417 place count 407 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 407 transition count 668
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 419 place count 406 transition count 667
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 420 place count 406 transition count 667
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 421 place count 406 transition count 667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 422 place count 406 transition count 666
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 424 place count 404 transition count 664
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 426 place count 404 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 427 place count 404 transition count 664
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 428 place count 403 transition count 663
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 429 place count 403 transition count 663
Performed 74 Post agglomeration using F-continuation condition with reduction of 37 identical transitions.
Deduced a syphon composed of 302 places in 1 ms
Iterating global reduction 5 with 74 rules applied. Total rules applied 503 place count 403 transition count 971
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 5 with 71 rules applied. Total rules applied 574 place count 403 transition count 900
Discarding 156 places :
Symmetric choice reduction at 6 with 156 rule applications. Total rules 730 place count 247 transition count 546
Deduced a syphon composed of 186 places in 1 ms
Iterating global reduction 6 with 156 rules applied. Total rules applied 886 place count 247 transition count 546
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 6 with 49 rules applied. Total rules applied 935 place count 247 transition count 497
Discarding 101 places :
Symmetric choice reduction at 7 with 101 rule applications. Total rules 1036 place count 146 transition count 315
Deduced a syphon composed of 95 places in 1 ms
Iterating global reduction 7 with 101 rules applied. Total rules applied 1137 place count 146 transition count 315
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1147 place count 146 transition count 305
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 1167 place count 126 transition count 265
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 8 with 20 rules applied. Total rules applied 1187 place count 126 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1189 place count 126 transition count 315
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1203 place count 126 transition count 301
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1209 place count 120 transition count 265
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 6 rules applied. Total rules applied 1215 place count 120 transition count 265
Deduced a syphon composed of 71 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 1226 place count 120 transition count 254
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1227 place count 119 transition count 253
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1228 place count 119 transition count 253
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1229 place count 119 transition count 274
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1230 place count 118 transition count 266
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1231 place count 118 transition count 266
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 1231 rules in 526 ms. Remains 118 /472 variables (removed 354) and now considering 266/618 (removed 352) transitions.
[2024-06-02 18:44:17] [INFO ] Redundant transitions in 16 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 18:44:17] [INFO ] Flow matrix only has 258 transitions (discarded 8 similar events)
// Phase 1: matrix 258 rows 118 cols
[2024-06-02 18:44:17] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:44:17] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 18:44:18] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:44:18] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:44:18] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-02 18:44:18] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 253 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 4 (OVERLAPS) 257/375 variables, 118/126 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 15/141 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/141 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/142 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/142 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/142 constraints. Problems are: Problem set: 179 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 142 constraints, problems are : Problem set: 179 solved, 86 unsolved in 5866 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 179 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 11/58 variables, 4/4 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/8 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 243/301 variables, 58/66 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 15/81 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 86/167 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/167 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 74/375 variables, 60/227 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/227 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 1/376 variables, 1/228 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/228 constraints. Problems are: Problem set: 179 solved, 86 unsolved
At refinement iteration 12 (OVERLAPS) 0/376 variables, 0/228 constraints. Problems are: Problem set: 179 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 228 constraints, problems are : Problem set: 179 solved, 86 unsolved in 3830 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/265 constraints, Known Traps: 4/4 constraints]
After SMT, in 9862ms problems are : Problem set: 179 solved, 86 unsolved
Search for dead transitions found 179 dead transitions in 9865ms
Found 179 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 179 transitions
Dead transitions reduction (with SMT) removed 179 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 118/472 places, 87/618 transitions.
Graph (complete) has 175 edges and 118 vertex of which 48 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 48 /118 variables (removed 70) and now considering 87/87 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/472 places, 87/618 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10435 ms. Remains : 48/472 places, 87/618 transitions.
Built C files in :
/tmp/ltsmin8428341019578552116
[2024-06-02 18:44:26] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8428341019578552116
Running compilation step : cd /tmp/ltsmin8428341019578552116;'/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 1131 ms.
Running link step : cd /tmp/ltsmin8428341019578552116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8428341019578552116;'/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/stateBased16254314122183567875.hoa' '--buchi-type=spotba'
LTSmin run took 4266 ms.
FORMULA CO4-PT-17-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-00 finished in 139990 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((G(p1)||p0))))))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 479 transition count 629
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 479 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 479 transition count 628
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 475 transition count 623
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 475 transition count 623
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 473 transition count 621
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 473 transition count 621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 472 transition count 620
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 472 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 472 transition count 619
Applied a total of 34 rules in 64 ms. Remains 472 /488 variables (removed 16) and now considering 619/638 (removed 19) transitions.
// Phase 1: matrix 619 rows 472 cols
[2024-06-02 18:44:32] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:44:32] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 18:44:32] [INFO ] Invariant cache hit.
[2024-06-02 18:44:32] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2024-06-02 18:44:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1091 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 618 unsolved
[2024-06-02 18:44:52] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 3 ms to minimize.
[2024-06-02 18:44:53] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1091/1091 variables, and 478 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1091 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 618/1096 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1091 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1091/1091 variables, and 1096 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in LTL mode, iteration 1 : 472/488 places, 619/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60697 ms. Remains : 472/488 places, 619/638 transitions.
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-17-LTLFireability-02
Product exploration explored 100000 steps with 16 reset in 90 ms.
Product exploration explored 100000 steps with 6 reset in 94 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 804 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (49 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (100 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (40 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (90 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (74 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 551609 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :1 out of 4
Probabilistic random walk after 551609 steps, saw 108666 distinct states, run finished after 3012 ms. (steps per millisecond=183 ) properties seen :1
[2024-06-02 18:45:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 75/86 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 270/356 variables, 91/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/364 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 16/380 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 378/758 variables, 184/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/758 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 258/1016 variables, 137/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1016 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 63/1079 variables, 40/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1079 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 12/1091 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1091 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1091 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1091/1091 variables, and 476 constraints, problems are : Problem set: 0 solved, 3 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 75/86 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 270/356 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 8/364 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 16/380 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 378/758 variables, 184/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/758 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 258/1016 variables, 137/431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1016 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 63/1079 variables, 40/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1079 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/1091 variables, 8/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1091 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1091 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1091/1091 variables, and 479 constraints, problems are : Problem set: 0 solved, 3 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1125ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 174 steps, including 3 resets, run visited all 3 properties in 2 ms. (steps per millisecond=87 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
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 1 ms.
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 619/619 transitions.
Applied a total of 0 rules in 19 ms. Remains 472 /472 variables (removed 0) and now considering 619/619 (removed 0) transitions.
[2024-06-02 18:45:39] [INFO ] Invariant cache hit.
[2024-06-02 18:45:39] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-06-02 18:45:39] [INFO ] Invariant cache hit.
[2024-06-02 18:45:39] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2024-06-02 18:45:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1091 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 618 unsolved
[2024-06-02 18:45:59] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 3 ms to minimize.
[2024-06-02 18:45:59] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1091/1091 variables, and 478 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1091 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 618/1096 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1091 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1091/1091 variables, and 1096 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Finished structural reductions in LTL mode , in 1 iterations and 60849 ms. Remains : 472/472 places, 619/619 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 804 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (48 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (174 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (42 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (102 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (38 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 756885 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :1 out of 4
Probabilistic random walk after 756885 steps, saw 141052 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :1
[2024-06-02 18:46:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 75/86 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 270/356 variables, 91/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/364 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 16/380 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 378/758 variables, 184/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/758 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 258/1016 variables, 137/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1016 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 63/1079 variables, 40/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1079 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 12/1091 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1091 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1091 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1091/1091 variables, and 476 constraints, problems are : Problem set: 0 solved, 3 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 75/86 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 270/356 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 8/364 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 16/380 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 378/758 variables, 184/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/758 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 258/1016 variables, 137/431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1016 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 63/1079 variables, 40/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1079 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/1091 variables, 8/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1091 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/1091 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1091/1091 variables, and 479 constraints, problems are : Problem set: 0 solved, 3 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 848ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 430 steps, including 9 resets, run visited all 3 properties in 3 ms. (steps per millisecond=143 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
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) p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Product exploration explored 100000 steps with 11 reset in 127 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 619/619 transitions.
Graph (trivial) has 512 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 803 edges and 471 vertex of which 468 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 164 rules applied. Total rules applied 166 place count 468 transition count 614
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 167 place count 468 transition count 613
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 167 place count 468 transition count 673
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 230 place count 468 transition count 673
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 263 place count 435 transition count 640
Deduced a syphon composed of 193 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 296 place count 435 transition count 640
Performed 55 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 248 places in 0 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 351 place count 435 transition count 712
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 359 place count 435 transition count 704
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 385 place count 409 transition count 672
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 411 place count 409 transition count 672
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 413 place count 407 transition count 669
Deduced a syphon composed of 228 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 415 place count 407 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 416 place count 407 transition count 668
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 417 place count 406 transition count 667
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 418 place count 406 transition count 667
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 406 transition count 667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 420 place count 406 transition count 666
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 422 place count 404 transition count 664
Deduced a syphon composed of 226 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 424 place count 404 transition count 664
Performed 73 Post agglomeration using F-continuation condition with reduction of 35 identical transitions.
Deduced a syphon composed of 299 places in 1 ms
Iterating global reduction 5 with 73 rules applied. Total rules applied 497 place count 404 transition count 968
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 5 with 71 rules applied. Total rules applied 568 place count 404 transition count 897
Discarding 151 places :
Symmetric choice reduction at 6 with 151 rule applications. Total rules 719 place count 253 transition count 554
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 6 with 151 rules applied. Total rules applied 870 place count 253 transition count 554
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 6 with 50 rules applied. Total rules applied 920 place count 253 transition count 504
Discarding 98 places :
Symmetric choice reduction at 7 with 98 rule applications. Total rules 1018 place count 155 transition count 328
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 7 with 98 rules applied. Total rules applied 1116 place count 155 transition count 328
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1124 place count 155 transition count 320
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 1142 place count 137 transition count 284
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 18 rules applied. Total rules applied 1160 place count 137 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 1161 place count 137 transition count 309
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1168 place count 137 transition count 302
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1171 place count 134 transition count 284
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1174 place count 134 transition count 284
Deduced a syphon composed of 78 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 1189 place count 134 transition count 269
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1191 place count 132 transition count 267
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1193 place count 132 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 1195 place count 132 transition count 312
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1198 place count 129 transition count 290
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1201 place count 129 transition count 290
Deduced a syphon composed of 75 places in 0 ms
Applied a total of 1201 rules in 128 ms. Remains 129 /472 variables (removed 343) and now considering 290/619 (removed 329) transitions.
[2024-06-02 18:46:45] [INFO ] Redundant transitions in 3 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-02 18:46:45] [INFO ] Flow matrix only has 283 transitions (discarded 7 similar events)
// Phase 1: matrix 283 rows 129 cols
[2024-06-02 18:46:45] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:46:45] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 18:46:47] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:46:47] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:46:47] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-02 18:46:47] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 277 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
At refinement iteration 4 (OVERLAPS) 282/411 variables, 129/137 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 9/146 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/146 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/412 variables, 1/147 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/147 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/412 variables, 0/147 constraints. Problems are: Problem set: 192 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 147 constraints, problems are : Problem set: 192 solved, 97 unsolved in 5918 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 192 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 11/64 variables, 4/4 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/8 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 268/332 variables, 64/72 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 9/81 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 97/178 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/178 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 79/411 variables, 65/243 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/243 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 1/412 variables, 1/244 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 0/244 constraints. Problems are: Problem set: 192 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/412 variables, 0/244 constraints. Problems are: Problem set: 192 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 244 constraints, problems are : Problem set: 192 solved, 97 unsolved in 4639 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 97/289 constraints, Known Traps: 4/4 constraints]
After SMT, in 10677ms problems are : Problem set: 192 solved, 97 unsolved
Search for dead transitions found 192 dead transitions in 10681ms
Found 192 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 192 transitions
Dead transitions reduction (with SMT) removed 192 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 129/472 places, 98/619 transitions.
Graph (complete) has 191 edges and 129 vertex of which 54 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.0 ms
Discarding 75 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 54 /129 variables (removed 75) and now considering 98/98 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/472 places, 98/619 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10831 ms. Remains : 54/472 places, 98/619 transitions.
Built C files in :
/tmp/ltsmin9686716043480510932
[2024-06-02 18:46:56] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9686716043480510932
Running compilation step : cd /tmp/ltsmin9686716043480510932;'/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 979 ms.
Running link step : cd /tmp/ltsmin9686716043480510932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9686716043480510932;'/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/stateBased18024897422137492591.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 619/619 transitions.
Applied a total of 0 rules in 16 ms. Remains 472 /472 variables (removed 0) and now considering 619/619 (removed 0) transitions.
// Phase 1: matrix 619 rows 472 cols
[2024-06-02 18:47:11] [INFO ] Computed 4 invariants in 8 ms
[2024-06-02 18:47:11] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 18:47:11] [INFO ] Invariant cache hit.
[2024-06-02 18:47:11] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2024-06-02 18:47:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1091 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 618 unsolved
[2024-06-02 18:47:31] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 3 ms to minimize.
[2024-06-02 18:47:31] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1091/1091 variables, and 478 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1091 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 618/1096 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1091 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1091/1091 variables, and 1096 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 472/472 places, 619/619 transitions.
Built C files in :
/tmp/ltsmin12592968736670838066
[2024-06-02 18:48:12] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12592968736670838066
Running compilation step : cd /tmp/ltsmin12592968736670838066;'/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 1006 ms.
Running link step : cd /tmp/ltsmin12592968736670838066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12592968736670838066;'/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/stateBased7061522049882315740.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 18:48:27] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:48:27] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:48:27] [INFO ] Time to serialize gal into /tmp/LTL9821135207368956848.gal : 6 ms
[2024-06-02 18:48:27] [INFO ] Time to serialize properties into /tmp/LTL6280767836096420736.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/LTL9821135207368956848.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9491888503992199396.hoa' '-atoms' '/tmp/LTL6280767836096420736.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...317
Loading property file /tmp/LTL6280767836096420736.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9491888503992199396.hoa
Detected timeout of ITS tools.
[2024-06-02 18:48:42] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:48:42] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:48:42] [INFO ] Time to serialize gal into /tmp/LTL16620602097554600805.gal : 4 ms
[2024-06-02 18:48:42] [INFO ] Time to serialize properties into /tmp/LTL16387037130000067535.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/LTL16620602097554600805.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16387037130000067535.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 : !((X(X(X(G(("((p614==1)||(p210==0))")||(G("(p898==1)"))))))))
Formula 0 simplified : XXXF(!"((p614==1)||(p210==0))" & F!"(p898==1)")
Detected timeout of ITS tools.
[2024-06-02 18:48:57] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:48:57] [INFO ] Applying decomposition
[2024-06-02 18:48:57] [INFO ] Flatten gal took : 18 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/graph13939376092252150595.txt' '-o' '/tmp/graph13939376092252150595.bin' '-w' '/tmp/graph13939376092252150595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13939376092252150595.bin' '-l' '-1' '-v' '-w' '/tmp/graph13939376092252150595.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:48:57] [INFO ] Decomposing Gal with order
[2024-06-02 18:48:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:48:57] [INFO ] Removed a total of 212 redundant transitions.
[2024-06-02 18:48:58] [INFO ] Flatten gal took : 323 ms
[2024-06-02 18:48:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 16 ms.
[2024-06-02 18:48:58] [INFO ] Time to serialize gal into /tmp/LTL11504914500161973126.gal : 8 ms
[2024-06-02 18:48:58] [INFO ] Time to serialize properties into /tmp/LTL324284407239321767.ltl : 16 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/LTL11504914500161973126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL324284407239321767.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 : !((X(X(X(G(("((i7.u96.p614==1)||(i1.u24.p210==0))")||(G("(i15.u162.p898==1)"))))))))
Formula 0 simplified : XXXF(!"((i7.u96.p614==1)||(i1.u24.p210==0))" & F!"(i15.u162.p898==1)")
Reverse transition relation is NOT exact ! Due to transitions t18, t49, t73, t203, t207, t258, t365, t518, t556, i0.t515, i0.u8.t522, i1.t456, i1.t446, i2....773
Computing Next relation with stutter on 391679 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
118 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,1.23235,72576,1,0,107314,1918,7099,278759,493,7516,237518
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-17-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CO4-PT-17-LTLFireability-02 finished in 267207 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))))'
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Graph (trivial) has 527 edges and 488 vertex of which 2 / 488 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 826 edges and 487 vertex of which 481 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 166 rules applied. Total rules applied 168 place count 480 transition count 463
Reduce places removed 165 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 170 rules applied. Total rules applied 338 place count 315 transition count 458
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 345 place count 310 transition count 456
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 345 place count 310 transition count 395
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 467 place count 249 transition count 395
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 471 place count 245 transition count 391
Iterating global reduction 3 with 4 rules applied. Total rules applied 475 place count 245 transition count 391
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 475 place count 245 transition count 388
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 481 place count 242 transition count 388
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 483 place count 240 transition count 386
Iterating global reduction 3 with 2 rules applied. Total rules applied 485 place count 240 transition count 386
Performed 85 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 655 place count 155 transition count 279
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 661 place count 155 transition count 273
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 668 place count 148 transition count 266
Iterating global reduction 4 with 7 rules applied. Total rules applied 675 place count 148 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 676 place count 148 transition count 265
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 5 with 6 rules applied. Total rules applied 682 place count 145 transition count 262
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 772 place count 100 transition count 265
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 802 place count 100 transition count 235
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 842 place count 60 transition count 155
Iterating global reduction 6 with 40 rules applied. Total rules applied 882 place count 60 transition count 155
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 909 place count 60 transition count 128
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 919 place count 50 transition count 99
Iterating global reduction 7 with 10 rules applied. Total rules applied 929 place count 50 transition count 99
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 936 place count 50 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 939 place count 50 transition count 89
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 940 place count 50 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 942 place count 48 transition count 87
Applied a total of 942 rules in 89 ms. Remains 48 /488 variables (removed 440) and now considering 87/638 (removed 551) transitions.
[2024-06-02 18:48:59] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
// Phase 1: matrix 80 rows 48 cols
[2024-06-02 18:48:59] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:48:59] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:48:59] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
[2024-06-02 18:48:59] [INFO ] Invariant cache hit.
[2024-06-02 18:48:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:48:59] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-06-02 18:48:59] [INFO ] Redundant transitions in 0 ms returned []
Running 74 sub problems to find dead transitions.
[2024-06-02 18:48:59] [INFO ] Flow matrix only has 80 transitions (discarded 7 similar events)
[2024-06-02 18:48:59] [INFO ] Invariant cache hit.
[2024-06-02 18:48:59] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 79/127 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 1/128 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 55 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1703 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 79/127 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 74/128 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 129 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1158 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 2921ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2921ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/488 places, 87/638 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3157 ms. Remains : 48/488 places, 87/638 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-17-LTLFireability-03
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA CO4-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-03 finished in 3275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 478 transition count 628
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 478 transition count 628
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 478 transition count 626
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 474 transition count 621
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 474 transition count 621
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 472 transition count 619
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 472 transition count 619
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 471 transition count 618
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 471 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 471 transition count 617
Applied a total of 37 rules in 29 ms. Remains 471 /488 variables (removed 17) and now considering 617/638 (removed 21) transitions.
// Phase 1: matrix 617 rows 471 cols
[2024-06-02 18:49:02] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:49:03] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-02 18:49:03] [INFO ] Invariant cache hit.
[2024-06-02 18:49:03] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2024-06-02 18:49:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-06-02 18:49:23] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 17 ms to minimize.
[2024-06-02 18:49:23] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 471/488 places, 617/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60636 ms. Remains : 471/488 places, 617/638 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLFireability-04
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 1 ms.
FORMULA CO4-PT-17-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-04 finished in 60721 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((G((X(p0) U p1))||p2))||G(F(p2))))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 479 transition count 629
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 479 transition count 629
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 479 transition count 627
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 475 transition count 622
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 475 transition count 622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 473 transition count 620
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 473 transition count 620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 472 transition count 619
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 472 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 472 transition count 618
Applied a total of 35 rules in 30 ms. Remains 472 /488 variables (removed 16) and now considering 618/638 (removed 20) transitions.
// Phase 1: matrix 618 rows 472 cols
[2024-06-02 18:50:03] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:50:03] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:50:03] [INFO ] Invariant cache hit.
[2024-06-02 18:50:04] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2024-06-02 18:50:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (OVERLAPS) 618/1090 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 617 unsolved
[2024-06-02 18:50:24] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 5 ms to minimize.
[2024-06-02 18:50:24] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1090 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 617 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1090 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 617/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1095 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 472/488 places, 618/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60547 ms. Remains : 472/488 places, 618/638 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : CO4-PT-17-LTLFireability-05
Product exploration explored 100000 steps with 10 reset in 98 ms.
Product exploration explored 100000 steps with 9 reset in 121 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 803 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 204 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (97 resets) in 99 ms. (400 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40000 steps (96 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (55 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
[2024-06-02 18:51:05] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 65/71 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 266/337 variables, 99/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/345 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/361 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 342/703 variables, 159/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/703 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 275/978 variables, 130/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/978 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 104/1082 variables, 70/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1082 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/1090 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1090 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1090 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 476 constraints, problems are : Problem set: 0 solved, 2 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 65/71 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 266/337 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/345 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/361 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 342/703 variables, 159/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/703 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 275/978 variables, 130/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/978 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 104/1082 variables, 70/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1090 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 2 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 12 ms.
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 618/618 transitions.
Graph (trivial) has 516 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 801 edges and 471 vertex of which 450 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 181 rules applied. Total rules applied 183 place count 450 transition count 417
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 347 place count 287 transition count 416
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 347 place count 287 transition count 349
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 481 place count 220 transition count 349
Performed 75 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 631 place count 145 transition count 258
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 8 rules applied. Total rules applied 639 place count 145 transition count 250
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 641 place count 144 transition count 249
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 648 place count 137 transition count 242
Iterating global reduction 4 with 7 rules applied. Total rules applied 655 place count 137 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 656 place count 137 transition count 241
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 664 place count 133 transition count 237
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 668 place count 133 transition count 233
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 672 place count 129 transition count 229
Iterating global reduction 6 with 4 rules applied. Total rules applied 676 place count 129 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 677 place count 129 transition count 228
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 683 place count 126 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 686 place count 126 transition count 222
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 689 place count 123 transition count 219
Iterating global reduction 8 with 3 rules applied. Total rules applied 692 place count 123 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 694 place count 123 transition count 217
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 695 place count 122 transition count 216
Iterating global reduction 9 with 1 rules applied. Total rules applied 696 place count 122 transition count 216
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 9 with 80 rules applied. Total rules applied 776 place count 82 transition count 219
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 819 place count 82 transition count 176
Discarding 36 places :
Symmetric choice reduction at 10 with 36 rule applications. Total rules 855 place count 46 transition count 118
Iterating global reduction 10 with 36 rules applied. Total rules applied 891 place count 46 transition count 118
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 918 place count 46 transition count 91
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 925 place count 39 transition count 71
Iterating global reduction 11 with 7 rules applied. Total rules applied 932 place count 39 transition count 71
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 937 place count 39 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 938 place count 39 transition count 65
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 939 place count 38 transition count 64
Iterating global reduction 12 with 1 rules applied. Total rules applied 940 place count 38 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 941 place count 38 transition count 63
Free-agglomeration rule applied 5 times.
Iterating global reduction 13 with 5 rules applied. Total rules applied 946 place count 38 transition count 58
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 954 place count 33 transition count 55
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 956 place count 33 transition count 55
Graph (complete) has 106 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 14 with 1 rules applied. Total rules applied 957 place count 32 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 958 place count 32 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 959 place count 32 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 961 place count 31 transition count 52
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 90 edges and 31 vertex of which 24 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 6 rules applied. Total rules applied 967 place count 24 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 17 with 12 rules applied. Total rules applied 979 place count 24 transition count 35
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 980 place count 23 transition count 34
Iterating global reduction 18 with 1 rules applied. Total rules applied 981 place count 23 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 982 place count 23 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 983 place count 23 transition count 32
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 984 place count 22 transition count 31
Iterating global reduction 19 with 1 rules applied. Total rules applied 985 place count 22 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 986 place count 22 transition count 30
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 987 place count 22 transition count 30
Graph (complete) has 58 edges and 22 vertex of which 21 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 20 with 1 rules applied. Total rules applied 988 place count 21 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 989 place count 21 transition count 29
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 990 place count 21 transition count 29
Graph (complete) has 55 edges and 21 vertex of which 20 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 22 with 1 rules applied. Total rules applied 991 place count 20 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 992 place count 20 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 993 place count 19 transition count 27
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 t50.t556 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 13 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 3 rules applied. Total rules applied 996 place count 13 transition count 25
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 t47.t543.t25.t26.t27.t29.t128.t125.t621.t129.t130 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 9 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 25 with 8 rules applied. Total rules applied 1004 place count 9 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 1010 place count 9 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 27 with 2 rules applied. Total rules applied 1012 place count 9 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 1014 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 28 with 1 rules applied. Total rules applied 1015 place count 7 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 1016 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 1017 place count 6 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 29 with 1 rules applied. Total rules applied 1018 place count 6 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 1019 place count 6 transition count 6
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 29 with 2 rules applied. Total rules applied 1021 place count 5 transition count 5
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 30 with 1 rules applied. Total rules applied 1022 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 1023 place count 4 transition count 4
Iterating global reduction 30 with 1 rules applied. Total rules applied 1024 place count 4 transition count 4
Applied a total of 1024 rules in 77 ms. Remains 4 /472 variables (removed 468) and now considering 4/618 (removed 614) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 4/472 places, 4/618 transitions.
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0))), (F p1), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 13 factoid took 407 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 618/618 transitions.
Applied a total of 0 rules in 5 ms. Remains 472 /472 variables (removed 0) and now considering 618/618 (removed 0) transitions.
[2024-06-02 18:51:07] [INFO ] Invariant cache hit.
[2024-06-02 18:51:07] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-02 18:51:07] [INFO ] Invariant cache hit.
[2024-06-02 18:51:07] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2024-06-02 18:51:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (OVERLAPS) 618/1090 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 617 unsolved
[2024-06-02 18:51:27] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 3 ms to minimize.
[2024-06-02 18:51:27] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1090 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 617 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 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 617 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1090 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 617/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1095 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in LTL mode , in 1 iterations and 60572 ms. Remains : 472/472 places, 618/618 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 803 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 145 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (95 resets) in 83 ms. (476 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40001 steps (100 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (98 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
[2024-06-02 18:52:08] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 65/71 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 266/337 variables, 99/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/345 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/361 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 342/703 variables, 159/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/703 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 275/978 variables, 130/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/978 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 104/1082 variables, 70/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1082 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/1090 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1090 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1090 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 476 constraints, problems are : Problem set: 0 solved, 2 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 65/71 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 266/337 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/345 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/361 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 342/703 variables, 159/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/703 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 275/978 variables, 130/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/978 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 104/1082 variables, 70/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1090 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 2 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 853ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 13 ms.
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 618/618 transitions.
Graph (trivial) has 516 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 801 edges and 471 vertex of which 450 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 181 rules applied. Total rules applied 183 place count 450 transition count 417
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 347 place count 287 transition count 416
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 347 place count 287 transition count 349
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 481 place count 220 transition count 349
Performed 75 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 631 place count 145 transition count 258
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 8 rules applied. Total rules applied 639 place count 145 transition count 250
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 641 place count 144 transition count 249
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 648 place count 137 transition count 242
Iterating global reduction 4 with 7 rules applied. Total rules applied 655 place count 137 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 656 place count 137 transition count 241
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 664 place count 133 transition count 237
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 668 place count 133 transition count 233
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 672 place count 129 transition count 229
Iterating global reduction 6 with 4 rules applied. Total rules applied 676 place count 129 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 677 place count 129 transition count 228
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 683 place count 126 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 686 place count 126 transition count 222
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 689 place count 123 transition count 219
Iterating global reduction 8 with 3 rules applied. Total rules applied 692 place count 123 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 694 place count 123 transition count 217
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 695 place count 122 transition count 216
Iterating global reduction 9 with 1 rules applied. Total rules applied 696 place count 122 transition count 216
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 9 with 80 rules applied. Total rules applied 776 place count 82 transition count 219
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 819 place count 82 transition count 176
Discarding 36 places :
Symmetric choice reduction at 10 with 36 rule applications. Total rules 855 place count 46 transition count 118
Iterating global reduction 10 with 36 rules applied. Total rules applied 891 place count 46 transition count 118
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 918 place count 46 transition count 91
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 925 place count 39 transition count 71
Iterating global reduction 11 with 7 rules applied. Total rules applied 932 place count 39 transition count 71
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 937 place count 39 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 938 place count 39 transition count 65
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 939 place count 38 transition count 64
Iterating global reduction 12 with 1 rules applied. Total rules applied 940 place count 38 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 941 place count 38 transition count 63
Free-agglomeration rule applied 5 times.
Iterating global reduction 13 with 5 rules applied. Total rules applied 946 place count 38 transition count 58
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 954 place count 33 transition count 55
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 956 place count 33 transition count 55
Graph (complete) has 106 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 14 with 1 rules applied. Total rules applied 957 place count 32 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 958 place count 32 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 959 place count 32 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 961 place count 31 transition count 52
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 90 edges and 31 vertex of which 24 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 6 rules applied. Total rules applied 967 place count 24 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 17 with 12 rules applied. Total rules applied 979 place count 24 transition count 35
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 980 place count 23 transition count 34
Iterating global reduction 18 with 1 rules applied. Total rules applied 981 place count 23 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 982 place count 23 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 983 place count 23 transition count 32
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 984 place count 22 transition count 31
Iterating global reduction 19 with 1 rules applied. Total rules applied 985 place count 22 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 986 place count 22 transition count 30
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 987 place count 22 transition count 30
Graph (complete) has 58 edges and 22 vertex of which 21 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 20 with 1 rules applied. Total rules applied 988 place count 21 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 989 place count 21 transition count 29
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 990 place count 21 transition count 29
Graph (complete) has 55 edges and 21 vertex of which 20 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 22 with 1 rules applied. Total rules applied 991 place count 20 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 992 place count 20 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 993 place count 19 transition count 27
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 t50.t556 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 13 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 3 rules applied. Total rules applied 996 place count 13 transition count 25
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 t47.t543.t25.t26.t27.t29.t128.t125.t621.t129.t130 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 9 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 25 with 8 rules applied. Total rules applied 1004 place count 9 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 1010 place count 9 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 27 with 2 rules applied. Total rules applied 1012 place count 9 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 1014 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 28 with 1 rules applied. Total rules applied 1015 place count 7 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 1016 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 1017 place count 6 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 29 with 1 rules applied. Total rules applied 1018 place count 6 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 1019 place count 6 transition count 6
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 29 with 2 rules applied. Total rules applied 1021 place count 5 transition count 5
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 30 with 1 rules applied. Total rules applied 1022 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 1023 place count 4 transition count 4
Iterating global reduction 30 with 1 rules applied. Total rules applied 1024 place count 4 transition count 4
Applied a total of 1024 rules in 37 ms. Remains 4 /472 variables (removed 468) and now considering 4/618 (removed 614) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 4/472 places, 4/618 transitions.
RANDOM walk for 46 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0))), (F p1), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 13 factoid took 514 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 29 reset in 88 ms.
Product exploration explored 100000 steps with 10 reset in 101 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 3 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 618/618 transitions.
Graph (trivial) has 514 edges and 472 vertex of which 2 / 472 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 802 edges and 471 vertex of which 468 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 468 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 164 place count 468 transition count 612
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 164 place count 468 transition count 673
Deduced a syphon composed of 224 places in 0 ms
Iterating global reduction 2 with 64 rules applied. Total rules applied 228 place count 468 transition count 673
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 259 place count 437 transition count 642
Deduced a syphon composed of 193 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 290 place count 437 transition count 642
Performed 57 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 250 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 347 place count 437 transition count 716
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 355 place count 437 transition count 708
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 381 place count 411 transition count 676
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 407 place count 411 transition count 676
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 409 place count 409 transition count 673
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 411 place count 409 transition count 673
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 412 place count 409 transition count 672
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 413 place count 408 transition count 671
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 414 place count 408 transition count 671
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 415 place count 408 transition count 671
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 416 place count 408 transition count 670
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 418 place count 406 transition count 668
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 420 place count 406 transition count 668
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 421 place count 406 transition count 668
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 422 place count 405 transition count 667
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 423 place count 405 transition count 667
Performed 73 Post agglomeration using F-continuation condition with reduction of 37 identical transitions.
Deduced a syphon composed of 301 places in 0 ms
Iterating global reduction 5 with 73 rules applied. Total rules applied 496 place count 405 transition count 970
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 5 with 67 rules applied. Total rules applied 563 place count 405 transition count 903
Discarding 153 places :
Symmetric choice reduction at 6 with 153 rule applications. Total rules 716 place count 252 transition count 556
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 6 with 153 rules applied. Total rules applied 869 place count 252 transition count 556
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 916 place count 252 transition count 509
Discarding 99 places :
Symmetric choice reduction at 7 with 99 rule applications. Total rules 1015 place count 153 transition count 330
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 7 with 99 rules applied. Total rules applied 1114 place count 153 transition count 330
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1124 place count 153 transition count 320
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 1144 place count 133 transition count 280
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 8 with 20 rules applied. Total rules applied 1164 place count 133 transition count 280
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1166 place count 133 transition count 330
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1180 place count 133 transition count 316
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1186 place count 127 transition count 280
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 6 rules applied. Total rules applied 1192 place count 127 transition count 280
Deduced a syphon composed of 74 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 1203 place count 127 transition count 269
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1204 place count 126 transition count 268
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1205 place count 126 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1206 place count 126 transition count 289
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1207 place count 125 transition count 281
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1208 place count 125 transition count 281
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 1208 rules in 98 ms. Remains 125 /472 variables (removed 347) and now considering 281/618 (removed 337) transitions.
[2024-06-02 18:52:10] [INFO ] Redundant transitions in 1 ms returned []
Running 280 sub problems to find dead transitions.
[2024-06-02 18:52:10] [INFO ] Flow matrix only has 273 transitions (discarded 8 similar events)
// Phase 1: matrix 273 rows 125 cols
[2024-06-02 18:52:10] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:52:10] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-06-02 18:52:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:52:12] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:52:12] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-02 18:52:12] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 268 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
At refinement iteration 4 (OVERLAPS) 272/397 variables, 125/133 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 15/148 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/148 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/149 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/149 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/149 constraints. Problems are: Problem set: 186 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 149 constraints, problems are : Problem set: 186 solved, 94 unsolved in 5558 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 125/125 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 186 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 11/62 variables, 4/4 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 4/8 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 257/319 variables, 62/70 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 15/85 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 94/179 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/179 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 78/397 variables, 63/242 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/242 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 1/398 variables, 1/243 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/243 constraints. Problems are: Problem set: 186 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 0/398 variables, 0/243 constraints. Problems are: Problem set: 186 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 243 constraints, problems are : Problem set: 186 solved, 94 unsolved in 4263 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 125/125 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 94/280 constraints, Known Traps: 4/4 constraints]
After SMT, in 9920ms problems are : Problem set: 186 solved, 94 unsolved
Search for dead transitions found 186 dead transitions in 9922ms
Found 186 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 186 transitions
Dead transitions reduction (with SMT) removed 186 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 125/472 places, 95/618 transitions.
Graph (complete) has 186 edges and 125 vertex of which 52 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.0 ms
Discarding 73 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 52 /125 variables (removed 73) and now considering 95/95 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/472 places, 95/618 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10046 ms. Remains : 52/472 places, 95/618 transitions.
Built C files in :
/tmp/ltsmin6327301370316471241
[2024-06-02 18:52:20] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6327301370316471241
Running compilation step : cd /tmp/ltsmin6327301370316471241;'/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 983 ms.
Running link step : cd /tmp/ltsmin6327301370316471241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6327301370316471241;'/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/stateBased9657414993263504897.hoa' '--buchi-type=spotba'
LTSmin run took 1640 ms.
FORMULA CO4-PT-17-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-05 finished in 139874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 480 transition count 630
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 480 transition count 630
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 480 transition count 628
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 476 transition count 623
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 476 transition count 623
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 474 transition count 621
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 474 transition count 621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 473 transition count 620
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 473 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 473 transition count 619
Applied a total of 33 rules in 33 ms. Remains 473 /488 variables (removed 15) and now considering 619/638 (removed 19) transitions.
// Phase 1: matrix 619 rows 473 cols
[2024-06-02 18:52:23] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 18:52:23] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 18:52:23] [INFO ] Invariant cache hit.
[2024-06-02 18:52:23] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2024-06-02 18:52:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1092 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 618 unsolved
[2024-06-02 18:52:44] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-06-02 18:52:44] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 479 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1092 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 618/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1097 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 473/488 places, 619/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60626 ms. Remains : 473/488 places, 619/638 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : CO4-PT-17-LTLFireability-09
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA CO4-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-09 finished in 60793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F(p1))))))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 478 transition count 628
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 478 transition count 628
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 478 transition count 626
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 474 transition count 621
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 474 transition count 621
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 472 transition count 619
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 472 transition count 619
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 471 transition count 618
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 471 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 471 transition count 617
Applied a total of 37 rules in 28 ms. Remains 471 /488 variables (removed 17) and now considering 617/638 (removed 21) transitions.
// Phase 1: matrix 617 rows 471 cols
[2024-06-02 18:53:24] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:53:24] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-02 18:53:24] [INFO ] Invariant cache hit.
[2024-06-02 18:53:24] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2024-06-02 18:53:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-06-02 18:53:44] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-06-02 18:53:44] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 471/488 places, 617/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60759 ms. Remains : 471/488 places, 617/638 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CO4-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 25000 reset in 113 ms.
Product exploration explored 100000 steps with 25000 reset in 198 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 802 edges and 471 vertex of which 468 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (80 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (78 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1410955 steps, run timeout after 3001 ms. (steps per millisecond=470 ) properties seen :0 out of 1
Probabilistic random walk after 1410955 steps, saw 251233 distinct states, run finished after 3001 ms. (steps per millisecond=470 ) properties seen :0
[2024-06-02 18:54:28] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 254/304 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/312 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/328 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 342/670 variables, 157/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/670 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 297/967 variables, 140/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/967 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 113/1080 variables, 76/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1088 variables, 6/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1088 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1088 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 254/304 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/312 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/328 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 342/670 variables, 157/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/670 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 297/967 variables, 140/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/967 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 113/1080 variables, 76/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1080 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1088 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1088 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1088 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 564ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 55 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 471 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 617/617 transitions.
Applied a total of 0 rules in 6 ms. Remains 471 /471 variables (removed 0) and now considering 617/617 (removed 0) transitions.
[2024-06-02 18:54:29] [INFO ] Invariant cache hit.
[2024-06-02 18:54:29] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:54:29] [INFO ] Invariant cache hit.
[2024-06-02 18:54:30] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2024-06-02 18:54:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-06-02 18:54:50] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 3 ms to minimize.
[2024-06-02 18:54:50] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Finished structural reductions in LTL mode , in 1 iterations and 60540 ms. Remains : 471/471 places, 617/617 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 802 edges and 471 vertex of which 468 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (74 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (63 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1411389 steps, run timeout after 3001 ms. (steps per millisecond=470 ) properties seen :0 out of 1
Probabilistic random walk after 1411389 steps, saw 251305 distinct states, run finished after 3001 ms. (steps per millisecond=470 ) properties seen :0
[2024-06-02 18:55:33] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 254/304 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/312 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/328 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 342/670 variables, 157/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/670 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 297/967 variables, 140/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/967 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 113/1080 variables, 76/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1080 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1088 variables, 6/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1088 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1088 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 254/304 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/312 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/328 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 342/670 variables, 157/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/670 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 297/967 variables, 140/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/967 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 113/1080 variables, 76/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1080 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1088 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1088 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1088 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 82 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 135 ms.
Product exploration explored 100000 steps with 25000 reset in 140 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 471/471 places, 617/617 transitions.
Graph (trivial) has 515 edges and 471 vertex of which 2 / 471 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 801 edges and 470 vertex of which 467 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 163 rules applied. Total rules applied 165 place count 467 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 166 place count 467 transition count 611
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 166 place count 467 transition count 673
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 2 with 65 rules applied. Total rules applied 231 place count 467 transition count 673
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 264 place count 434 transition count 640
Deduced a syphon composed of 194 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 297 place count 434 transition count 640
Performed 54 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 248 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 351 place count 434 transition count 712
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 359 place count 434 transition count 704
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 384 place count 409 transition count 673
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 409 place count 409 transition count 673
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 411 place count 407 transition count 670
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 413 place count 407 transition count 670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 407 transition count 669
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 415 place count 406 transition count 668
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 416 place count 406 transition count 668
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 406 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 418 place count 406 transition count 667
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 420 place count 404 transition count 665
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 422 place count 404 transition count 665
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 423 place count 404 transition count 665
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 424 place count 403 transition count 664
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 425 place count 403 transition count 664
Performed 75 Post agglomeration using F-continuation condition with reduction of 37 identical transitions.
Deduced a syphon composed of 302 places in 0 ms
Iterating global reduction 5 with 75 rules applied. Total rules applied 500 place count 403 transition count 977
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 5 with 73 rules applied. Total rules applied 573 place count 403 transition count 904
Discarding 156 places :
Symmetric choice reduction at 6 with 156 rule applications. Total rules 729 place count 247 transition count 549
Deduced a syphon composed of 185 places in 1 ms
Iterating global reduction 6 with 156 rules applied. Total rules applied 885 place count 247 transition count 549
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 936 place count 247 transition count 498
Discarding 98 places :
Symmetric choice reduction at 7 with 98 rule applications. Total rules 1034 place count 149 transition count 322
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 7 with 98 rules applied. Total rules applied 1132 place count 149 transition count 322
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1142 place count 149 transition count 312
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 1160 place count 131 transition count 276
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 8 with 18 rules applied. Total rules applied 1178 place count 131 transition count 276
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1180 place count 131 transition count 326
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1194 place count 131 transition count 312
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1200 place count 125 transition count 276
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 6 rules applied. Total rules applied 1206 place count 125 transition count 276
Deduced a syphon composed of 74 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 1217 place count 125 transition count 265
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1218 place count 124 transition count 264
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1219 place count 124 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1220 place count 124 transition count 285
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1221 place count 123 transition count 277
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1222 place count 123 transition count 277
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 1222 rules in 86 ms. Remains 123 /471 variables (removed 348) and now considering 277/617 (removed 340) transitions.
[2024-06-02 18:55:35] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 18:55:35] [INFO ] Flow matrix only has 268 transitions (discarded 9 similar events)
// Phase 1: matrix 268 rows 123 cols
[2024-06-02 18:55:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:55:35] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 18:55:36] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:55:36] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:55:36] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-02 18:55:37] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 264 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
At refinement iteration 4 (OVERLAPS) 267/390 variables, 123/131 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 14/145 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/145 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/391 variables, 1/146 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/146 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/146 constraints. Problems are: Problem set: 187 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 146 constraints, problems are : Problem set: 187 solved, 89 unsolved in 5690 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 123/123 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 187 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 11/60 variables, 4/4 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/8 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 253/313 variables, 60/68 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 14/82 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 89/171 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/171 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 77/390 variables, 63/234 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/234 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 1/391 variables, 1/235 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/235 constraints. Problems are: Problem set: 187 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/235 constraints. Problems are: Problem set: 187 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 235 constraints, problems are : Problem set: 187 solved, 89 unsolved in 4152 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 123/123 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 89/276 constraints, Known Traps: 4/4 constraints]
After SMT, in 10009ms problems are : Problem set: 187 solved, 89 unsolved
Search for dead transitions found 187 dead transitions in 10012ms
Found 187 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 187 transitions
Dead transitions reduction (with SMT) removed 187 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 123/471 places, 90/617 transitions.
Graph (complete) has 182 edges and 123 vertex of which 50 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.0 ms
Discarding 73 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 50 /123 variables (removed 73) and now considering 90/90 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/471 places, 90/617 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10139 ms. Remains : 50/471 places, 90/617 transitions.
Built C files in :
/tmp/ltsmin2439436725763056421
[2024-06-02 18:55:45] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2439436725763056421
Running compilation step : cd /tmp/ltsmin2439436725763056421;'/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 1018 ms.
Running link step : cd /tmp/ltsmin2439436725763056421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2439436725763056421;'/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/stateBased7633585667389602414.hoa' '--buchi-type=spotba'
LTSmin run took 1176 ms.
FORMULA CO4-PT-17-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-10 finished in 143162 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)))))'
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 479 transition count 629
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 479 transition count 629
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 479 transition count 627
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 476 transition count 623
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 476 transition count 623
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 474 transition count 621
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 474 transition count 621
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 473 transition count 620
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 473 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 473 transition count 619
Applied a total of 33 rules in 27 ms. Remains 473 /488 variables (removed 15) and now considering 619/638 (removed 19) transitions.
// Phase 1: matrix 619 rows 473 cols
[2024-06-02 18:55:47] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 18:55:47] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 18:55:47] [INFO ] Invariant cache hit.
[2024-06-02 18:55:47] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2024-06-02 18:55:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1092 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 618 unsolved
[2024-06-02 18:56:08] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
[2024-06-02 18:56:08] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 479 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1092 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 618/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1097 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Starting structural reductions in LTL mode, iteration 1 : 473/488 places, 619/638 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60572 ms. Remains : 473/488 places, 619/638 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLFireability-12
Product exploration explored 100000 steps with 25000 reset in 130 ms.
Product exploration explored 100000 steps with 25000 reset in 137 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 806 edges and 473 vertex of which 470 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (137 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (146 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1429374 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :0 out of 1
Probabilistic random walk after 1429374 steps, saw 254998 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
[2024-06-02 18:56:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/64 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 276/340 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/352 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/362 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 357/719 variables, 166/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 269/988 variables, 132/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/988 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 98/1086 variables, 66/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/64 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 276/340 variables, 100/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/352 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/362 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 357/719 variables, 166/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 269/988 variables, 132/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/988 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 98/1086 variables, 66/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 478 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 551ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 473 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 473/473 places, 619/619 transitions.
Applied a total of 0 rules in 11 ms. Remains 473 /473 variables (removed 0) and now considering 619/619 (removed 0) transitions.
[2024-06-02 18:56:52] [INFO ] Invariant cache hit.
[2024-06-02 18:56:52] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 18:56:52] [INFO ] Invariant cache hit.
[2024-06-02 18:56:52] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2024-06-02 18:56:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1092 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 618 unsolved
[2024-06-02 18:57:13] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-06-02 18:57:13] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 479 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1092 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 618/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1097 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Finished structural reductions in LTL mode , in 1 iterations and 60521 ms. Remains : 473/473 places, 619/619 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 806 edges and 473 vertex of which 470 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (56 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (144 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1413231 steps, run timeout after 3001 ms. (steps per millisecond=470 ) properties seen :0 out of 1
Probabilistic random walk after 1413231 steps, saw 251604 distinct states, run finished after 3001 ms. (steps per millisecond=470 ) properties seen :0
[2024-06-02 18:57:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/64 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 276/340 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/352 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/362 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 357/719 variables, 166/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/719 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 269/988 variables, 132/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/988 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 98/1086 variables, 66/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/64 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 276/340 variables, 100/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/352 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/362 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 357/719 variables, 166/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/719 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 269/988 variables, 132/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/988 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 98/1086 variables, 66/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 478 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 528ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Product exploration explored 100000 steps with 25000 reset in 137 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 473/473 places, 619/619 transitions.
Graph (trivial) has 518 edges and 473 vertex of which 2 / 473 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 805 edges and 472 vertex of which 469 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 164 rules applied. Total rules applied 166 place count 469 transition count 614
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 167 place count 469 transition count 613
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 167 place count 469 transition count 674
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 2 with 64 rules applied. Total rules applied 231 place count 469 transition count 674
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 264 place count 436 transition count 641
Deduced a syphon composed of 194 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 297 place count 436 transition count 641
Performed 57 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 251 places in 1 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 354 place count 436 transition count 718
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 362 place count 436 transition count 710
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 389 place count 409 transition count 677
Deduced a syphon composed of 231 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 416 place count 409 transition count 677
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 418 place count 407 transition count 674
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 420 place count 407 transition count 674
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 421 place count 407 transition count 673
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 422 place count 406 transition count 672
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 423 place count 406 transition count 672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 424 place count 406 transition count 672
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 425 place count 406 transition count 671
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 427 place count 404 transition count 669
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 429 place count 404 transition count 669
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 430 place count 404 transition count 669
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 431 place count 403 transition count 668
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 432 place count 403 transition count 668
Performed 74 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 302 places in 0 ms
Iterating global reduction 5 with 74 rules applied. Total rules applied 506 place count 403 transition count 975
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 5 with 77 rules applied. Total rules applied 583 place count 403 transition count 898
Discarding 157 places :
Symmetric choice reduction at 6 with 157 rule applications. Total rules 740 place count 246 transition count 541
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 6 with 157 rules applied. Total rules applied 897 place count 246 transition count 541
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 945 place count 246 transition count 493
Discarding 100 places :
Symmetric choice reduction at 7 with 100 rule applications. Total rules 1045 place count 146 transition count 314
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 7 with 100 rules applied. Total rules applied 1145 place count 146 transition count 314
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1155 place count 146 transition count 304
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 1175 place count 126 transition count 264
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 8 with 20 rules applied. Total rules applied 1195 place count 126 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 1197 place count 126 transition count 309
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1209 place count 126 transition count 297
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1215 place count 120 transition count 261
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 6 rules applied. Total rules applied 1221 place count 120 transition count 261
Deduced a syphon composed of 71 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 1232 place count 120 transition count 250
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1233 place count 119 transition count 249
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1234 place count 119 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1235 place count 119 transition count 270
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1236 place count 118 transition count 262
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 1237 place count 118 transition count 262
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 1237 rules in 75 ms. Remains 118 /473 variables (removed 355) and now considering 262/619 (removed 357) transitions.
[2024-06-02 18:57:58] [INFO ] Redundant transitions in 2 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-02 18:57:58] [INFO ] Flow matrix only has 254 transitions (discarded 8 similar events)
// Phase 1: matrix 254 rows 118 cols
[2024-06-02 18:57:58] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:57:58] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 18:57:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-02 18:57:59] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-02 18:57:59] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-02 18:57:59] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 4/8 constraints. Problems are: Problem set: 12 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 249 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 4 (OVERLAPS) 253/371 variables, 118/126 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 15/141 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/141 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/372 variables, 1/142 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/142 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/142 constraints. Problems are: Problem set: 176 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 142 constraints, problems are : Problem set: 176 solved, 85 unsolved in 5231 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 176 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 11/58 variables, 4/4 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/8 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 239/297 variables, 58/66 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 15/81 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 85/166 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/166 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 74/371 variables, 60/226 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/226 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/372 variables, 1/227 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/227 constraints. Problems are: Problem set: 176 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/372 variables, 0/227 constraints. Problems are: Problem set: 176 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 227 constraints, problems are : Problem set: 176 solved, 85 unsolved in 3801 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 85/261 constraints, Known Traps: 4/4 constraints]
After SMT, in 9189ms problems are : Problem set: 176 solved, 85 unsolved
Search for dead transitions found 176 dead transitions in 9191ms
Found 176 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 176 transitions
Dead transitions reduction (with SMT) removed 176 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 118/473 places, 86/619 transitions.
Graph (complete) has 177 edges and 118 vertex of which 48 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 48 /118 variables (removed 70) and now considering 86/86 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/473 places, 86/619 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9304 ms. Remains : 48/473 places, 86/619 transitions.
Built C files in :
/tmp/ltsmin18338517932653996438
[2024-06-02 18:58:07] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18338517932653996438
Running compilation step : cd /tmp/ltsmin18338517932653996438;'/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 990 ms.
Running link step : cd /tmp/ltsmin18338517932653996438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18338517932653996438;'/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/stateBased4176625126162809363.hoa' '--buchi-type=spotba'
LTSmin run took 365 ms.
FORMULA CO4-PT-17-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-12 finished in 141209 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) U (G(p1)||F(p2))))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Graph (trivial) has 529 edges and 488 vertex of which 2 / 488 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 826 edges and 487 vertex of which 481 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 168 rules applied. Total rules applied 170 place count 480 transition count 461
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 171 rules applied. Total rules applied 341 place count 313 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 343 place count 311 transition count 457
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 343 place count 311 transition count 396
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 465 place count 250 transition count 396
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 468 place count 247 transition count 393
Iterating global reduction 3 with 3 rules applied. Total rules applied 471 place count 247 transition count 393
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 471 place count 247 transition count 391
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 475 place count 245 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 476 place count 244 transition count 390
Iterating global reduction 3 with 1 rules applied. Total rules applied 477 place count 244 transition count 390
Performed 84 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 645 place count 160 transition count 283
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 652 place count 160 transition count 276
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 659 place count 153 transition count 269
Iterating global reduction 4 with 7 rules applied. Total rules applied 666 place count 153 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 667 place count 153 transition count 268
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 675 place count 149 transition count 264
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 767 place count 103 transition count 268
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 795 place count 103 transition count 240
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 835 place count 63 transition count 160
Iterating global reduction 6 with 40 rules applied. Total rules applied 875 place count 63 transition count 160
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 900 place count 63 transition count 135
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 909 place count 54 transition count 109
Iterating global reduction 7 with 9 rules applied. Total rules applied 918 place count 54 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 923 place count 54 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 929 place count 54 transition count 98
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 933 place count 54 transition count 98
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 935 place count 52 transition count 96
Applied a total of 935 rules in 32 ms. Remains 52 /488 variables (removed 436) and now considering 96/638 (removed 542) transitions.
[2024-06-02 18:58:08] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
// Phase 1: matrix 88 rows 52 cols
[2024-06-02 18:58:08] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:58:08] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:58:08] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2024-06-02 18:58:08] [INFO ] Invariant cache hit.
[2024-06-02 18:58:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:58:08] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 18:58:08] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2024-06-02 18:58:08] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2024-06-02 18:58:08] [INFO ] Invariant cache hit.
[2024-06-02 18:58:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 87/139 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 1/140 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 58 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1376 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 52/52 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 87/139 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 83/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/140 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 141 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 52/52 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 2895ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 2896ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/488 places, 96/638 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3121 ms. Remains : 52/488 places, 96/638 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CO4-PT-17-LTLFireability-13
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-17-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-17-LTLFireability-13 finished in 3200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 638/638 transitions.
Graph (trivial) has 531 edges and 488 vertex of which 2 / 488 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 826 edges and 487 vertex of which 484 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 483 transition count 461
Reduce places removed 171 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 1 with 174 rules applied. Total rules applied 348 place count 312 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 311 transition count 458
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 349 place count 311 transition count 398
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 469 place count 251 transition count 398
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 473 place count 247 transition count 394
Iterating global reduction 3 with 4 rules applied. Total rules applied 477 place count 247 transition count 394
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 477 place count 247 transition count 391
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 483 place count 244 transition count 391
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 485 place count 242 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 487 place count 242 transition count 389
Performed 86 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 659 place count 156 transition count 280
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 666 place count 156 transition count 273
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 673 place count 149 transition count 266
Iterating global reduction 4 with 7 rules applied. Total rules applied 680 place count 149 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 681 place count 149 transition count 265
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 689 place count 145 transition count 261
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 777 place count 101 transition count 264
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 805 place count 101 transition count 236
Discarding 38 places :
Symmetric choice reduction at 6 with 38 rule applications. Total rules 843 place count 63 transition count 160
Iterating global reduction 6 with 38 rules applied. Total rules applied 881 place count 63 transition count 160
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 907 place count 63 transition count 134
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 917 place count 53 transition count 105
Iterating global reduction 7 with 10 rules applied. Total rules applied 927 place count 53 transition count 105
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 934 place count 53 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 938 place count 53 transition count 94
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 940 place count 51 transition count 92
Applied a total of 940 rules in 38 ms. Remains 51 /488 variables (removed 437) and now considering 92/638 (removed 546) transitions.
[2024-06-02 18:58:11] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
// Phase 1: matrix 83 rows 51 cols
[2024-06-02 18:58:11] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:58:11] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:58:11] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-06-02 18:58:11] [INFO ] Invariant cache hit.
[2024-06-02 18:58:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:58:12] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-02 18:58:12] [INFO ] Redundant transitions in 0 ms returned []
Running 79 sub problems to find dead transitions.
[2024-06-02 18:58:12] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-06-02 18:58:12] [INFO ] Invariant cache hit.
[2024-06-02 18:58:12] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 82/133 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 1/134 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 57 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 82/133 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 79/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 136 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
After SMT, in 2462ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 2463ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/488 places, 92/638 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2740 ms. Remains : 51/488 places, 92/638 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-17-LTLFireability-15
Product exploration explored 100000 steps with 11 reset in 93 ms.
Product exploration explored 100000 steps with 28 reset in 70 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Graph (complete) has 180 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
RANDOM walk for 1874 steps (173 resets) in 18 ms. (98 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-02 18:58:15] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-06-02 18:58:15] [INFO ] Invariant cache hit.
[2024-06-02 18:58:15] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 18:58:15] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-06-02 18:58:15] [INFO ] Invariant cache hit.
[2024-06-02 18:58:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:58:15] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-02 18:58:15] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-06-02 18:58:15] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-06-02 18:58:15] [INFO ] Invariant cache hit.
[2024-06-02 18:58:15] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 82/133 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 1/134 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 57 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 82/133 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 79/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 136 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1357 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
After SMT, in 2418ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 2419ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2584 ms. Remains : 51/51 places, 92/92 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Graph (complete) has 180 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 1327 steps (122 resets) in 7 ms. (165 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25 reset in 32 ms.
Product exploration explored 100000 steps with 20 reset in 70 ms.
Built C files in :
/tmp/ltsmin11033591791837038011
[2024-06-02 18:58:18] [INFO ] Computing symmetric may disable matrix : 92 transitions.
[2024-06-02 18:58:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:58:18] [INFO ] Computing symmetric may enable matrix : 92 transitions.
[2024-06-02 18:58:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:58:18] [INFO ] Computing Do-Not-Accords matrix : 92 transitions.
[2024-06-02 18:58:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 18:58:18] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11033591791837038011
Running compilation step : cd /tmp/ltsmin11033591791837038011;'/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 297 ms.
Running link step : cd /tmp/ltsmin11033591791837038011;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11033591791837038011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10765062178064345686.hoa' '--buchi-type=spotba'
LTSmin run took 1024 ms.
FORMULA CO4-PT-17-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-17-LTLFireability-15 finished in 7713 ms.
All properties solved by simple procedures.
Total runtime 977316 ms.

BK_STOP 1717354699662

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-17"
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-17, 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-171734898600132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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