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.r549-tall-171734898300324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898300324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K 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 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 247K 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 FireWire-PT-20-LTLFireability-00
FORMULA_NAME FireWire-PT-20-LTLFireability-01
FORMULA_NAME FireWire-PT-20-LTLFireability-02
FORMULA_NAME FireWire-PT-20-LTLFireability-03
FORMULA_NAME FireWire-PT-20-LTLFireability-04
FORMULA_NAME FireWire-PT-20-LTLFireability-05
FORMULA_NAME FireWire-PT-20-LTLFireability-06
FORMULA_NAME FireWire-PT-20-LTLFireability-07
FORMULA_NAME FireWire-PT-20-LTLFireability-08
FORMULA_NAME FireWire-PT-20-LTLFireability-09
FORMULA_NAME FireWire-PT-20-LTLFireability-10
FORMULA_NAME FireWire-PT-20-LTLFireability-11
FORMULA_NAME FireWire-PT-20-LTLFireability-12
FORMULA_NAME FireWire-PT-20-LTLFireability-13
FORMULA_NAME FireWire-PT-20-LTLFireability-14
FORMULA_NAME FireWire-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717375600099

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:46:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-03 00:46:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:46:41] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-06-03 00:46:41] [INFO ] Transformed 626 places.
[2024-06-03 00:46:41] [INFO ] Transformed 1031 transitions.
[2024-06-03 00:46:41] [INFO ] Found NUPN structural information;
[2024-06-03 00:46:41] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-20-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 611 transition count 1031
Discarding 133 places :
Symmetric choice reduction at 1 with 133 rule applications. Total rules 148 place count 478 transition count 898
Iterating global reduction 1 with 133 rules applied. Total rules applied 281 place count 478 transition count 898
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 315 place count 444 transition count 764
Iterating global reduction 1 with 34 rules applied. Total rules applied 349 place count 444 transition count 764
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 350 place count 444 transition count 763
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 360 place count 434 transition count 747
Iterating global reduction 2 with 10 rules applied. Total rules applied 370 place count 434 transition count 747
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 373 place count 434 transition count 744
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 376 place count 431 transition count 735
Iterating global reduction 3 with 3 rules applied. Total rules applied 379 place count 431 transition count 735
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 382 place count 428 transition count 729
Iterating global reduction 3 with 3 rules applied. Total rules applied 385 place count 428 transition count 729
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 388 place count 425 transition count 720
Iterating global reduction 3 with 3 rules applied. Total rules applied 391 place count 425 transition count 720
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 393 place count 423 transition count 716
Iterating global reduction 3 with 2 rules applied. Total rules applied 395 place count 423 transition count 716
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 397 place count 421 transition count 710
Iterating global reduction 3 with 2 rules applied. Total rules applied 399 place count 421 transition count 710
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 401 place count 419 transition count 706
Iterating global reduction 3 with 2 rules applied. Total rules applied 403 place count 419 transition count 706
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 405 place count 417 transition count 700
Iterating global reduction 3 with 2 rules applied. Total rules applied 407 place count 417 transition count 700
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 408 place count 416 transition count 698
Iterating global reduction 3 with 1 rules applied. Total rules applied 409 place count 416 transition count 698
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 410 place count 415 transition count 695
Iterating global reduction 3 with 1 rules applied. Total rules applied 411 place count 415 transition count 695
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 412 place count 414 transition count 693
Iterating global reduction 3 with 1 rules applied. Total rules applied 413 place count 414 transition count 693
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 414 place count 413 transition count 691
Iterating global reduction 3 with 1 rules applied. Total rules applied 415 place count 413 transition count 691
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 416 place count 412 transition count 689
Iterating global reduction 3 with 1 rules applied. Total rules applied 417 place count 412 transition count 689
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 418 place count 411 transition count 688
Iterating global reduction 3 with 1 rules applied. Total rules applied 419 place count 411 transition count 688
Applied a total of 419 rules in 229 ms. Remains 411 /626 variables (removed 215) and now considering 688/1031 (removed 343) transitions.
// Phase 1: matrix 688 rows 411 cols
[2024-06-03 00:46:41] [INFO ] Computed 10 invariants in 26 ms
[2024-06-03 00:46:42] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-06-03 00:46:42] [INFO ] Invariant cache hit.
[2024-06-03 00:46:42] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
Running 687 sub problems to find dead transitions.
[2024-06-03 00:46:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-06-03 00:46:52] [INFO ] Deduced a trap composed of 226 places in 220 ms of which 26 ms to minimize.
[2024-06-03 00:46:52] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-06-03 00:46:52] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:46:52] [INFO ] Deduced a trap composed of 103 places in 55 ms of which 2 ms to minimize.
[2024-06-03 00:46:52] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:46:52] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:46:53] [INFO ] Deduced a trap composed of 232 places in 149 ms of which 3 ms to minimize.
[2024-06-03 00:46:54] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-06-03 00:46:54] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2024-06-03 00:46:55] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:46:55] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 2 ms to minimize.
[2024-06-03 00:46:55] [INFO ] Deduced a trap composed of 92 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:46:56] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2024-06-03 00:46:56] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 2 ms to minimize.
[2024-06-03 00:46:56] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-06-03 00:46:58] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:46:59] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-06-03 00:47:05] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-06-03 00:47:12] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:47:12] [INFO ] Deduced a trap composed of 238 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:47:12] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/1099 variables, and 31 constraints, problems are : Problem set: 0 solved, 687 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/411 constraints, PredecessorRefiner: 687/687 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-06-03 00:47:18] [INFO ] Deduced a trap composed of 103 places in 81 ms of which 2 ms to minimize.
[2024-06-03 00:47:20] [INFO ] Deduced a trap composed of 101 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 5 (OVERLAPS) 688/1099 variables, 411/444 constraints. Problems are: Problem set: 0 solved, 687 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1099 variables, 687/1131 constraints. Problems are: Problem set: 0 solved, 687 unsolved
[2024-06-03 00:47:39] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-06-03 00:47:40] [INFO ] Deduced a trap composed of 120 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1099/1099 variables, and 1133 constraints, problems are : Problem set: 0 solved, 687 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 687/687 constraints, Known Traps: 25/25 constraints]
After SMT, in 60489ms problems are : Problem set: 0 solved, 687 unsolved
Search for dead transitions found 0 dead transitions in 60515ms
Starting structural reductions in LTL mode, iteration 1 : 411/626 places, 688/1031 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61596 ms. Remains : 411/626 places, 688/1031 transitions.
Support contains 36 out of 411 places after structural reductions.
[2024-06-03 00:47:43] [INFO ] Flatten gal took : 84 ms
[2024-06-03 00:47:43] [INFO ] Flatten gal took : 49 ms
[2024-06-03 00:47:43] [INFO ] Input system was already deterministic with 688 transitions.
Support contains 35 out of 411 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (16 resets) in 1944 ms. (20 steps per ms) remains 17/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
[2024-06-03 00:47:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 302/323 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-03 00:47:44] [INFO ] Deduced a trap composed of 101 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:47:44] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 47/370 variables, 5/12 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 648/1018 variables, 370/382 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1018 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 39/1057 variables, 19/401 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-03 00:47:46] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1057 variables, 1/402 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1057 variables, 0/402 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 28/1085 variables, 11/413 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1085 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 14/1099 variables, 11/424 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1099 variables, 0/424 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/1099 variables, 0/424 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1099/1099 variables, and 424 constraints, problems are : Problem set: 1 solved, 16 unsolved in 2730 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 303/323 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/323 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 47/370 variables, 5/13 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-03 00:47:47] [INFO ] Deduced a trap composed of 96 places in 51 ms of which 2 ms to minimize.
[2024-06-03 00:47:47] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 648/1018 variables, 370/385 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1018 variables, 16/401 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1018 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 39/1057 variables, 19/420 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1057 variables, 0/420 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 28/1085 variables, 11/431 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1085 variables, 0/431 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 14/1099 variables, 11/442 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1099 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 0/1099 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1099/1099 variables, and 442 constraints, problems are : Problem set: 1 solved, 16 unsolved in 3712 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 16/17 constraints, Known Traps: 5/5 constraints]
After SMT, in 6464ms problems are : Problem set: 1 solved, 16 unsolved
Parikh walk visited 0 properties in 3534 ms.
Support contains 20 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 283 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 5 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 403 transition count 616
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 119 place count 346 transition count 612
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 345 transition count 612
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 120 place count 345 transition count 580
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 184 place count 313 transition count 580
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 189 place count 308 transition count 573
Iterating global reduction 3 with 5 rules applied. Total rules applied 194 place count 308 transition count 573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 308 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 195 place count 308 transition count 571
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 307 transition count 571
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 198 place count 306 transition count 569
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 306 transition count 569
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 283 place count 264 transition count 526
Performed 41 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 365 place count 223 transition count 619
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 368 place count 223 transition count 616
Free-agglomeration rule applied 19 times.
Iterating global reduction 4 with 19 rules applied. Total rules applied 387 place count 223 transition count 597
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 406 place count 204 transition count 597
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 411 place count 199 transition count 592
Iterating global reduction 5 with 5 rules applied. Total rules applied 416 place count 199 transition count 592
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 422 place count 199 transition count 586
Applied a total of 422 rules in 171 ms. Remains 199 /411 variables (removed 212) and now considering 586/688 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 199/411 places, 586/688 transitions.
RANDOM walk for 40000 steps (1288 resets) in 1082 ms. (36 steps per ms) remains 8/16 properties
BEST_FIRST walk for 40003 steps (254 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (270 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (285 resets) in 93 ms. (425 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (287 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (263 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (256 resets) in 143 ms. (277 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (270 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
[2024-06-03 00:47:55] [INFO ] Flow matrix only has 565 transitions (discarded 21 similar events)
// Phase 1: matrix 565 rows 199 cols
[2024-06-03 00:47:55] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:47:55] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 109/187 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-03 00:47:55] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 1 ms to minimize.
[2024-06-03 00:47:55] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:47:55] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-06-03 00:47:55] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 565/752 variables, 187/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 15/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/764 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/764 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/764 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 228 constraints, problems are : Problem set: 0 solved, 6 unsolved in 897 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 109/187 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-03 00:47:56] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 565/752 variables, 187/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 15/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-03 00:47:56] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/752 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 12/764 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/764 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 236 constraints, problems are : Problem set: 0 solved, 6 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 1877ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1160 ms.
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 586/586 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 199 transition count 582
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 195 transition count 582
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 195 transition count 580
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 193 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 192 transition count 577
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 192 transition count 577
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 191 transition count 575
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 191 transition count 575
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 190 transition count 573
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 190 transition count 573
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 189 transition count 571
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 189 transition count 571
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 188 transition count 570
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 185 transition count 573
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 185 transition count 571
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 41 place count 183 transition count 562
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 69 place count 183 transition count 534
Applied a total of 69 rules in 90 ms. Remains 183 /199 variables (removed 16) and now considering 534/586 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 183/199 places, 534/586 transitions.
RANDOM walk for 40000 steps (1266 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (251 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (250 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (246 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (250 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (250 resets) in 71 ms. (555 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (255 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
[2024-06-03 00:47:58] [INFO ] Flow matrix only has 523 transitions (discarded 11 similar events)
// Phase 1: matrix 523 rows 183 cols
[2024-06-03 00:47:58] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:47:58] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 102/171 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:47:58] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 523/694 variables, 171/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/694 variables, 69/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/694 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/706 variables, 12/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/706 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/706 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 706/706 variables, and 263 constraints, problems are : Problem set: 0 solved, 5 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 102/171 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:47:59] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-06-03 00:47:59] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2024-06-03 00:47:59] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-06-03 00:47:59] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 523/694 variables, 171/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/694 variables, 69/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/694 variables, 5/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/694 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 12/706 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/706 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/706 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 706/706 variables, and 272 constraints, problems are : Problem set: 0 solved, 5 unsolved in 981 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 183/183 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 1455ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1605 ms.
Support contains 7 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 534/534 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 182 transition count 533
Applied a total of 2 rules in 25 ms. Remains 182 /183 variables (removed 1) and now considering 533/534 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 182/183 places, 533/534 transitions.
RANDOM walk for 40000 steps (1258 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (255 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (264 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (281 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (253 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (257 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 425270 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 5
Probabilistic random walk after 425270 steps, saw 140522 distinct states, run finished after 3004 ms. (steps per millisecond=141 ) properties seen :0
[2024-06-03 00:48:04] [INFO ] Flow matrix only has 522 transitions (discarded 11 similar events)
// Phase 1: matrix 522 rows 182 cols
[2024-06-03 00:48:04] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:48:04] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:48:05] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:48:05] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:48:05] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 522/692 variables, 170/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/692 variables, 69/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/692 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/704 variables, 12/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/704 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/704 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 704/704 variables, and 264 constraints, problems are : Problem set: 0 solved, 5 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:48:05] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-06-03 00:48:05] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 522/692 variables, 170/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/692 variables, 69/254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/692 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/692 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 12/704 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/704 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/704 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 704/704 variables, and 271 constraints, problems are : Problem set: 0 solved, 5 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 1384ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1208 ms.
Support contains 7 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 533/533 transitions.
Applied a total of 0 rules in 8 ms. Remains 182 /182 variables (removed 0) and now considering 533/533 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 182/182 places, 533/533 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 533/533 transitions.
Applied a total of 0 rules in 10 ms. Remains 182 /182 variables (removed 0) and now considering 533/533 (removed 0) transitions.
[2024-06-03 00:48:07] [INFO ] Flow matrix only has 522 transitions (discarded 11 similar events)
[2024-06-03 00:48:07] [INFO ] Invariant cache hit.
[2024-06-03 00:48:07] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-03 00:48:07] [INFO ] Flow matrix only has 522 transitions (discarded 11 similar events)
[2024-06-03 00:48:07] [INFO ] Invariant cache hit.
[2024-06-03 00:48:07] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-03 00:48:07] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-06-03 00:48:08] [INFO ] Redundant transitions in 55 ms returned [522]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 524 sub problems to find dead transitions.
[2024-06-03 00:48:08] [INFO ] Flow matrix only has 521 transitions (discarded 11 similar events)
// Phase 1: matrix 521 rows 182 cols
[2024-06-03 00:48:08] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:48:08] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-03 00:48:12] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-06-03 00:48:12] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2024-06-03 00:48:12] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-06-03 00:48:12] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-03 00:48:12] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:48:13] [INFO ] Deduced a trap composed of 126 places in 86 ms of which 2 ms to minimize.
[2024-06-03 00:48:13] [INFO ] Deduced a trap composed of 100 places in 82 ms of which 1 ms to minimize.
[2024-06-03 00:48:14] [INFO ] Deduced a trap composed of 135 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 521/703 variables, 182/200 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 69/269 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (OVERLAPS) 0/703 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 524 unsolved
No progress, stopping.
After SMT solving in domain Real declared 703/703 variables, and 269 constraints, problems are : Problem set: 0 solved, 524 unsolved in 22150 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 521/703 variables, 182/200 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 69/269 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 524/793 constraints. Problems are: Problem set: 0 solved, 524 unsolved
[2024-06-03 00:48:42] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 794 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 9/9 constraints]
After SMT, in 52896ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 52901ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 182/182 places, 532/533 transitions.
Applied a total of 0 rules in 18 ms. Remains 182 /182 variables (removed 0) and now considering 532/532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 53440 ms. Remains : 182/182 places, 532/533 transitions.
RANDOM walk for 40000 steps (1307 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (251 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (266 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (256 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (252 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (247 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 410754 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 5
Probabilistic random walk after 410754 steps, saw 136711 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2024-06-03 00:49:04] [INFO ] Flow matrix only has 521 transitions (discarded 11 similar events)
[2024-06-03 00:49:04] [INFO ] Invariant cache hit.
[2024-06-03 00:49:04] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:49:04] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-06-03 00:49:04] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-06-03 00:49:04] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-06-03 00:49:04] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 521/691 variables, 170/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 69/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/691 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/703 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/703 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/703 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 703/703 variables, and 265 constraints, problems are : Problem set: 0 solved, 5 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 62/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/170 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:49:05] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-06-03 00:49:05] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 521/691 variables, 170/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/691 variables, 69/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/691 variables, 5/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/691 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 12/703 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/703 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/703 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 703/703 variables, and 272 constraints, problems are : Problem set: 0 solved, 5 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 182/182 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 1564ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 1108 ms.
Support contains 6 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 532/532 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 181 transition count 531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 180 transition count 530
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 180 transition count 530
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 7 place count 180 transition count 527
Applied a total of 7 rules in 12 ms. Remains 180 /182 variables (removed 2) and now considering 527/532 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 180/182 places, 527/532 transitions.
RANDOM walk for 40000 steps (1303 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (246 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (252 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (247 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (251 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 469607 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 4
Probabilistic random walk after 469607 steps, saw 151770 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
[2024-06-03 00:49:09] [INFO ] Flow matrix only has 516 transitions (discarded 11 similar events)
// Phase 1: matrix 516 rows 180 cols
[2024-06-03 00:49:09] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:49:10] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 61/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 101/168 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:49:10] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-06-03 00:49:10] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 516/684 variables, 168/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 68/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/684 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/696 variables, 12/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/696 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/696 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 696/696 variables, and 260 constraints, problems are : Problem set: 0 solved, 4 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 61/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 101/168 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:49:10] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 2 ms to minimize.
[2024-06-03 00:49:10] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 516/684 variables, 168/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/684 variables, 68/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/684 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/696 variables, 12/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/696 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/696 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 696/696 variables, and 266 constraints, problems are : Problem set: 0 solved, 4 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 1207ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1188 ms.
Support contains 6 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 527/527 transitions.
Applied a total of 0 rules in 7 ms. Remains 180 /180 variables (removed 0) and now considering 527/527 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 180/180 places, 527/527 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 527/527 transitions.
Applied a total of 0 rules in 7 ms. Remains 180 /180 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2024-06-03 00:49:12] [INFO ] Flow matrix only has 516 transitions (discarded 11 similar events)
[2024-06-03 00:49:12] [INFO ] Invariant cache hit.
[2024-06-03 00:49:12] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-03 00:49:12] [INFO ] Flow matrix only has 516 transitions (discarded 11 similar events)
[2024-06-03 00:49:12] [INFO ] Invariant cache hit.
[2024-06-03 00:49:12] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-03 00:49:12] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-06-03 00:49:12] [INFO ] Redundant transitions in 37 ms returned []
Running 519 sub problems to find dead transitions.
[2024-06-03 00:49:12] [INFO ] Flow matrix only has 516 transitions (discarded 11 similar events)
[2024-06-03 00:49:12] [INFO ] Invariant cache hit.
[2024-06-03 00:49:12] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-03 00:49:16] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-06-03 00:49:16] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
[2024-06-03 00:49:17] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-06-03 00:49:17] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-03 00:49:17] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:49:17] [INFO ] Deduced a trap composed of 124 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:49:17] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 1 ms to minimize.
[2024-06-03 00:49:18] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:49:18] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-03 00:49:19] [INFO ] Deduced a trap composed of 133 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 516/696 variables, 180/200 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 68/268 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/696 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 7 (OVERLAPS) 0/696 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 519 unsolved
No progress, stopping.
After SMT solving in domain Real declared 696/696 variables, and 268 constraints, problems are : Problem set: 0 solved, 519 unsolved in 22220 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 516/696 variables, 180/200 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 68/268 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/696 variables, 519/787 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-06-03 00:49:49] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 1 ms to minimize.
[2024-06-03 00:49:49] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/696 variables, 2/789 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/696 variables, and 789 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 12/12 constraints]
After SMT, in 53003ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 53008ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53550 ms. Remains : 180/180 places, 527/527 transitions.
FORMULA FireWire-PT-20-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 107 stabilizing places and 149 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X((F(p0) U p0)) U p1)) U p0)))'
Support contains 4 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 300 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 402 transition count 617
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 341 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 340 transition count 613
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 128 place count 340 transition count 579
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 196 place count 306 transition count 579
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 205 place count 297 transition count 566
Iterating global reduction 3 with 9 rules applied. Total rules applied 214 place count 297 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 297 transition count 565
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 215 place count 297 transition count 561
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 223 place count 293 transition count 561
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 225 place count 291 transition count 556
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 291 transition count 556
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 228 place count 290 transition count 554
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 290 transition count 554
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 230 place count 289 transition count 552
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 289 transition count 552
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 232 place count 288 transition count 550
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 288 transition count 550
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 309 place count 250 transition count 511
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 310 place count 249 transition count 509
Iterating global reduction 4 with 1 rules applied. Total rules applied 311 place count 249 transition count 509
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 401 place count 204 transition count 608
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 404 place count 204 transition count 605
Applied a total of 404 rules in 98 ms. Remains 204 /411 variables (removed 207) and now considering 605/688 (removed 83) transitions.
[2024-06-03 00:50:06] [INFO ] Flow matrix only has 579 transitions (discarded 26 similar events)
// Phase 1: matrix 579 rows 204 cols
[2024-06-03 00:50:06] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:50:06] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-03 00:50:06] [INFO ] Flow matrix only has 579 transitions (discarded 26 similar events)
[2024-06-03 00:50:06] [INFO ] Invariant cache hit.
[2024-06-03 00:50:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 00:50:06] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-06-03 00:50:06] [INFO ] Redundant transitions in 5 ms returned []
Running 596 sub problems to find dead transitions.
[2024-06-03 00:50:06] [INFO ] Flow matrix only has 579 transitions (discarded 26 similar events)
[2024-06-03 00:50:06] [INFO ] Invariant cache hit.
[2024-06-03 00:50:06] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (OVERLAPS) 1/204 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-03 00:50:12] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 1 ms to minimize.
[2024-06-03 00:50:12] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2024-06-03 00:50:13] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:50:13] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 1 ms to minimize.
[2024-06-03 00:50:14] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 1 ms to minimize.
[2024-06-03 00:50:14] [INFO ] Deduced a trap composed of 134 places in 84 ms of which 2 ms to minimize.
[2024-06-03 00:50:14] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-06-03 00:50:14] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:50:14] [INFO ] Deduced a trap composed of 125 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:50:14] [INFO ] Deduced a trap composed of 125 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:50:14] [INFO ] Deduced a trap composed of 140 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-03 00:50:19] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:50:20] [INFO ] Deduced a trap composed of 134 places in 97 ms of which 1 ms to minimize.
[2024-06-03 00:50:20] [INFO ] Deduced a trap composed of 146 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (OVERLAPS) 578/782 variables, 204/228 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 12/240 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 596 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 782/783 variables, and 240 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 204/204 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (OVERLAPS) 1/204 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 6 (OVERLAPS) 578/782 variables, 204/228 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 12/240 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 596/836 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2024-06-03 00:50:53] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:50:58] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:50:59] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 1 ms to minimize.
[2024-06-03 00:51:00] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 782/783 variables, and 840 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 204/204 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 18/18 constraints]
After SMT, in 60787ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60792ms
Starting structural reductions in SI_LTL mode, iteration 1 : 204/411 places, 605/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61486 ms. Remains : 204/411 places, 605/688 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-00 finished in 61826 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||G(F(p1))))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 398 transition count 672
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 398 transition count 672
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 392 transition count 660
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 392 transition count 660
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 389 transition count 655
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 389 transition count 655
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 387 transition count 650
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 385 transition count 646
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 385 transition count 646
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 383 transition count 642
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 383 transition count 642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 382 transition count 640
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 382 transition count 640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 381 transition count 638
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 381 transition count 638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 380 transition count 636
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 380 transition count 636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 379 transition count 635
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 379 transition count 635
Applied a total of 64 rules in 38 ms. Remains 379 /411 variables (removed 32) and now considering 635/688 (removed 53) transitions.
// Phase 1: matrix 635 rows 379 cols
[2024-06-03 00:51:08] [INFO ] Computed 10 invariants in 6 ms
[2024-06-03 00:51:08] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-03 00:51:08] [INFO ] Invariant cache hit.
[2024-06-03 00:51:08] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 634 sub problems to find dead transitions.
[2024-06-03 00:51:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-06-03 00:51:16] [INFO ] Deduced a trap composed of 218 places in 117 ms of which 3 ms to minimize.
[2024-06-03 00:51:16] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:51:16] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:51:17] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:51:17] [INFO ] Deduced a trap composed of 77 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:51:18] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:51:18] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:51:18] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-03 00:51:19] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-06-03 00:51:22] [INFO ] Deduced a trap composed of 214 places in 123 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 5 (OVERLAPS) 635/1014 variables, 379/399 constraints. Problems are: Problem set: 0 solved, 634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 399 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (OVERLAPS) 635/1014 variables, 379/399 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 634/1033 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-06-03 00:51:53] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 2 ms to minimize.
[2024-06-03 00:51:55] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 2 ms to minimize.
[2024-06-03 00:51:56] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-06-03 00:52:01] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 1037 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 379/379 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 14/14 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 634 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Starting structural reductions in LTL mode, iteration 1 : 379/411 places, 635/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60815 ms. Remains : 379/411 places, 635/688 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-01
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-01 finished in 60965 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 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 301 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 402 transition count 617
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 341 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 340 transition count 613
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 128 place count 340 transition count 578
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 198 place count 305 transition count 578
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 207 place count 296 transition count 564
Iterating global reduction 3 with 9 rules applied. Total rules applied 216 place count 296 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 296 transition count 563
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 217 place count 296 transition count 560
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 223 place count 293 transition count 560
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 226 place count 290 transition count 552
Iterating global reduction 4 with 3 rules applied. Total rules applied 229 place count 290 transition count 552
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 231 place count 288 transition count 548
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 288 transition count 548
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 235 place count 286 transition count 543
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 286 transition count 543
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 239 place count 284 transition count 539
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 284 transition count 539
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 242 place count 283 transition count 536
Iterating global reduction 4 with 1 rules applied. Total rules applied 243 place count 283 transition count 536
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 282 transition count 534
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 282 transition count 534
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 281 transition count 532
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 281 transition count 532
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 248 place count 280 transition count 530
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 280 transition count 530
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 327 place count 241 transition count 490
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 240 transition count 488
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 240 transition count 488
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 419 place count 195 transition count 587
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 422 place count 195 transition count 584
Applied a total of 422 rules in 79 ms. Remains 195 /411 variables (removed 216) and now considering 584/688 (removed 104) transitions.
[2024-06-03 00:52:09] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
// Phase 1: matrix 555 rows 195 cols
[2024-06-03 00:52:09] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:52:09] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-03 00:52:09] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-03 00:52:09] [INFO ] Invariant cache hit.
[2024-06-03 00:52:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 00:52:09] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2024-06-03 00:52:09] [INFO ] Redundant transitions in 6 ms returned []
Running 575 sub problems to find dead transitions.
[2024-06-03 00:52:09] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-03 00:52:09] [INFO ] Invariant cache hit.
[2024-06-03 00:52:09] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2024-06-03 00:52:15] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-06-03 00:52:16] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-06-03 00:52:16] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-06-03 00:52:16] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-06-03 00:52:16] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-03 00:52:16] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:52:16] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (OVERLAPS) 554/749 variables, 195/212 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 8 (OVERLAPS) 0/749 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 575 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/750 variables, and 224 constraints, problems are : Problem set: 0 solved, 575 unsolved in 25595 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (OVERLAPS) 554/749 variables, 195/212 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/749 variables, 575/799 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2024-06-03 00:52:53] [INFO ] Deduced a trap composed of 132 places in 100 ms of which 1 ms to minimize.
[2024-06-03 00:52:53] [INFO ] Deduced a trap composed of 138 places in 96 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/749 variables, 2/801 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/750 variables, and 801 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 9/9 constraints]
After SMT, in 56198ms problems are : Problem set: 0 solved, 575 unsolved
Search for dead transitions found 0 dead transitions in 56204ms
Starting structural reductions in SI_LTL mode, iteration 1 : 195/411 places, 584/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56986 ms. Remains : 195/411 places, 584/688 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-02 finished in 57039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 299 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 402 transition count 618
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 125 place count 342 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 341 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 126 place count 341 transition count 579
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 196 place count 306 transition count 579
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 206 place count 296 transition count 564
Iterating global reduction 3 with 10 rules applied. Total rules applied 216 place count 296 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 296 transition count 563
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 217 place count 296 transition count 559
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 225 place count 292 transition count 559
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 289 transition count 551
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 289 transition count 551
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 287 transition count 547
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 287 transition count 547
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 285 transition count 542
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 285 transition count 542
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 241 place count 283 transition count 538
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 283 transition count 538
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 282 transition count 535
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 282 transition count 535
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 281 transition count 533
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 281 transition count 533
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 248 place count 280 transition count 531
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 280 transition count 531
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 250 place count 279 transition count 529
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 279 transition count 529
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 325 place count 242 transition count 491
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 326 place count 241 transition count 489
Iterating global reduction 4 with 1 rules applied. Total rules applied 327 place count 241 transition count 489
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 415 place count 197 transition count 587
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 418 place count 197 transition count 584
Applied a total of 418 rules in 88 ms. Remains 197 /411 variables (removed 214) and now considering 584/688 (removed 104) transitions.
[2024-06-03 00:53:06] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
// Phase 1: matrix 555 rows 197 cols
[2024-06-03 00:53:06] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:53:06] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-03 00:53:06] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-03 00:53:06] [INFO ] Invariant cache hit.
[2024-06-03 00:53:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 00:53:06] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2024-06-03 00:53:06] [INFO ] Redundant transitions in 11 ms returned []
Running 575 sub problems to find dead transitions.
[2024-06-03 00:53:06] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-03 00:53:06] [INFO ] Invariant cache hit.
[2024-06-03 00:53:06] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2024-06-03 00:53:12] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-06-03 00:53:12] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-06-03 00:53:12] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-06-03 00:53:12] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2024-06-03 00:53:13] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-06-03 00:53:13] [INFO ] Deduced a trap composed of 141 places in 93 ms of which 1 ms to minimize.
[2024-06-03 00:53:13] [INFO ] Deduced a trap composed of 138 places in 90 ms of which 1 ms to minimize.
[2024-06-03 00:53:13] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-06-03 00:53:13] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2024-06-03 00:53:18] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-06-03 00:53:18] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (OVERLAPS) 554/751 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/752 variables, and 230 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (OVERLAPS) 554/751 variables, 197/218 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 575/805 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2024-06-03 00:53:51] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2024-06-03 00:53:55] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/751 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/752 variables, and 807 constraints, problems are : Problem set: 0 solved, 575 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 13/13 constraints]
After SMT, in 60577ms problems are : Problem set: 0 solved, 575 unsolved
Search for dead transitions found 0 dead transitions in 60582ms
Starting structural reductions in SI_LTL mode, iteration 1 : 197/411 places, 584/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61395 ms. Remains : 197/411 places, 584/688 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-04
Product exploration explored 100000 steps with 2 reset in 137 ms.
Product exploration explored 100000 steps with 11 reset in 125 ms.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 170 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (1450 resets) in 558 ms. (71 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (263 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (259 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (272 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
[2024-06-03 00:54:08] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-03 00:54:08] [INFO ] Invariant cache hit.
[2024-06-03 00:54:08] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 117/185 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:54:08] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 554/739 variables, 185/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/739 variables, 12/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/739 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 12/751 variables, 12/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/751 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 751/752 variables, and 220 constraints, problems are : Problem set: 0 solved, 3 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 117/185 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 554/739 variables, 185/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/739 variables, 12/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/739 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/739 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 12/751 variables, 12/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-03 00:54:09] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/751 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/751 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 751/752 variables, and 224 constraints, problems are : Problem set: 0 solved, 3 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1014ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 584/584 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 581
Free-agglomeration rule applied 21 times.
Iterating global reduction 1 with 21 rules applied. Total rules applied 24 place count 197 transition count 560
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 54 place count 176 transition count 551
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 170 transition count 545
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 170 transition count 545
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 75 place count 170 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 102 place count 170 transition count 509
Applied a total of 102 rules in 26 ms. Remains 170 /197 variables (removed 27) and now considering 509/584 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 170/197 places, 509/584 transitions.
RANDOM walk for 40000 steps (1260 resets) in 503 ms. (79 steps per ms) remains 1/3 properties
BEST_FIRST walk for 34625 steps (244 resets) in 62 ms. (549 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 13 factoid took 258 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-20-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-20-LTLFireability-04 finished in 63953 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(F(p0))||G(p1)) U p2)))'
Support contains 5 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 669
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 397 transition count 668
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 392 transition count 657
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 392 transition count 657
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 389 transition count 652
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 389 transition count 652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 387 transition count 647
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 387 transition count 647
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 385 transition count 643
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 385 transition count 643
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 383 transition count 639
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 383 transition count 639
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 382 transition count 637
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 382 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 381 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 381 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 633
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 633
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 632
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 632
Applied a total of 65 rules in 41 ms. Remains 379 /411 variables (removed 32) and now considering 632/688 (removed 56) transitions.
// Phase 1: matrix 632 rows 379 cols
[2024-06-03 00:54:10] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:54:10] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-03 00:54:10] [INFO ] Invariant cache hit.
[2024-06-03 00:54:10] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 631 sub problems to find dead transitions.
[2024-06-03 00:54:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:54:18] [INFO ] Deduced a trap composed of 243 places in 137 ms of which 3 ms to minimize.
[2024-06-03 00:54:18] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 3 ms to minimize.
[2024-06-03 00:54:18] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:54:18] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 2 ms to minimize.
[2024-06-03 00:54:19] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:54:19] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:54:20] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:54:20] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-06-03 00:54:21] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:54:22] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:54:24] [INFO ] Deduced a trap composed of 227 places in 115 ms of which 3 ms to minimize.
[2024-06-03 00:54:25] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (OVERLAPS) 632/1011 variables, 379/401 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:54:40] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 2 ms to minimize.
SMT process timed out in 30306ms, After SMT, problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 30313ms
Starting structural reductions in LTL mode, iteration 1 : 379/411 places, 632/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30864 ms. Remains : 379/411 places, 632/688 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Computed a total of 86 stabilizing places and 110 stable transitions
Computed a total of 86 stabilizing places and 110 stable transitions
Detected a total of 86/379 stabilizing places and 110/632 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p2)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 14 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-20-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-20-LTLFireability-05 finished in 31465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X(p1)))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 670
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 397 transition count 669
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 391 transition count 657
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 391 transition count 657
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 388 transition count 652
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 388 transition count 652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 386 transition count 647
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 386 transition count 647
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 384 transition count 643
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 384 transition count 643
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 382 transition count 639
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 382 transition count 639
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 381 transition count 637
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 381 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 633
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 633
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 378 transition count 632
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 378 transition count 632
Applied a total of 67 rules in 51 ms. Remains 378 /411 variables (removed 33) and now considering 632/688 (removed 56) transitions.
// Phase 1: matrix 632 rows 378 cols
[2024-06-03 00:54:41] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:54:41] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-03 00:54:41] [INFO ] Invariant cache hit.
[2024-06-03 00:54:42] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Running 631 sub problems to find dead transitions.
[2024-06-03 00:54:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:54:49] [INFO ] Deduced a trap composed of 244 places in 123 ms of which 3 ms to minimize.
[2024-06-03 00:54:49] [INFO ] Deduced a trap composed of 252 places in 111 ms of which 2 ms to minimize.
[2024-06-03 00:54:50] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:54:50] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:54:50] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:54:50] [INFO ] Deduced a trap composed of 77 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:54:51] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 0 ms to minimize.
[2024-06-03 00:54:52] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-06-03 00:54:52] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-06-03 00:54:53] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (OVERLAPS) 632/1010 variables, 378/398 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:55:06] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 631 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:55:16] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 0 ms to minimize.
[2024-06-03 00:55:17] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:55:17] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:55:17] [INFO ] Deduced a trap composed of 92 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:55:17] [INFO ] Deduced a trap composed of 96 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:55:20] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:55:22] [INFO ] Deduced a trap composed of 96 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:55:22] [INFO ] Deduced a trap composed of 92 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 6 (OVERLAPS) 632/1010 variables, 378/407 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1010 variables, 631/1038 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:55:39] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1039 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 20/20 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 60259ms
Starting structural reductions in LTL mode, iteration 1 : 378/411 places, 632/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60844 ms. Remains : 378/411 places, 632/688 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-06
Product exploration explored 100000 steps with 4 reset in 103 ms.
Product exploration explored 100000 steps with 5 reset in 115 ms.
Computed a total of 84 stabilizing places and 108 stable transitions
Computed a total of 84 stabilizing places and 108 stable transitions
Detected a total of 84/378 stabilizing places and 108/632 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 312 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (20 resets) in 233 ms. (170 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (20 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (27 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
[2024-06-03 00:55:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 305/307 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/342 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 596/938 variables, 342/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 36/974 variables, 18/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/974 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 24/998 variables, 9/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/998 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 12/1010 variables, 9/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1010 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1010 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 388 constraints, problems are : Problem set: 0 solved, 3 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 305/307 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/342 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 596/938 variables, 342/352 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 2/354 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/938 variables, 0/354 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 36/974 variables, 18/372 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/974 variables, 0/372 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 24/998 variables, 9/381 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/998 variables, 0/381 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/1010 variables, 9/390 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1010 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 390 constraints, problems are : Problem set: 1 solved, 2 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 797ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 139 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 632/632 transitions.
Graph (trivial) has 281 edges and 378 vertex of which 11 / 378 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 370 transition count 564
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 317 transition count 557
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 314 transition count 557
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 117 place count 314 transition count 517
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 197 place count 274 transition count 517
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 263 place count 241 transition count 484
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 351 place count 197 transition count 579
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 354 place count 197 transition count 576
Free-agglomeration rule applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 376 place count 197 transition count 554
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 407 place count 175 transition count 545
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 413 place count 169 transition count 539
Iterating global reduction 4 with 6 rules applied. Total rules applied 419 place count 169 transition count 539
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 428 place count 169 transition count 530
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 455 place count 169 transition count 503
Applied a total of 455 rules in 50 ms. Remains 169 /378 variables (removed 209) and now considering 503/632 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 169/378 places, 503/632 transitions.
RANDOM walk for 355 steps (8 resets) in 8 ms. (39 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 7 factoid took 479 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (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 213 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 632/632 transitions.
Applied a total of 0 rules in 4 ms. Remains 378 /378 variables (removed 0) and now considering 632/632 (removed 0) transitions.
[2024-06-03 00:55:45] [INFO ] Invariant cache hit.
[2024-06-03 00:55:45] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-03 00:55:45] [INFO ] Invariant cache hit.
[2024-06-03 00:55:45] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 631 sub problems to find dead transitions.
[2024-06-03 00:55:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:55:53] [INFO ] Deduced a trap composed of 244 places in 116 ms of which 2 ms to minimize.
[2024-06-03 00:55:53] [INFO ] Deduced a trap composed of 252 places in 116 ms of which 2 ms to minimize.
[2024-06-03 00:55:54] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:55:54] [INFO ] Deduced a trap composed of 77 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:55:54] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 1 ms to minimize.
[2024-06-03 00:55:54] [INFO ] Deduced a trap composed of 77 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:55:55] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:55:56] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-06-03 00:55:56] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 2 ms to minimize.
[2024-06-03 00:55:57] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (OVERLAPS) 632/1010 variables, 378/398 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:56:10] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 631 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:56:20] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:56:20] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:56:21] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 0 ms to minimize.
[2024-06-03 00:56:21] [INFO ] Deduced a trap composed of 92 places in 42 ms of which 1 ms to minimize.
[2024-06-03 00:56:21] [INFO ] Deduced a trap composed of 96 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:56:24] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:56:26] [INFO ] Deduced a trap composed of 96 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:56:26] [INFO ] Deduced a trap composed of 92 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 6 (OVERLAPS) 632/1010 variables, 378/407 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1010 variables, 631/1038 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:56:42] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 2 ms to minimize.
[2024-06-03 00:56:45] [INFO ] Deduced a trap composed of 222 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1040 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 21/21 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Finished structural reductions in LTL mode , in 1 iterations and 60781 ms. Remains : 378/378 places, 632/632 transitions.
Computed a total of 84 stabilizing places and 108 stable transitions
Computed a total of 84 stabilizing places and 108 stable transitions
Detected a total of 84/378 stabilizing places and 108/632 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (33 resets) in 127 ms. (312 steps per ms) remains 2/4 properties
BEST_FIRST walk for 30572 steps (12 resets) in 91 ms. (332 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 360 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (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 197 ms :[true, (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 182 ms :[true, (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 10 reset in 103 ms.
Product exploration explored 100000 steps with 3 reset in 98 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 378/378 places, 632/632 transitions.
Graph (trivial) has 281 edges and 378 vertex of which 11 / 378 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 370 transition count 623
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 370 transition count 619
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 58 place count 370 transition count 652
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 370 transition count 652
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 364 transition count 646
Deduced a syphon composed of 71 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 364 transition count 646
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 142 place count 364 transition count 665
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 158 place count 348 transition count 649
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 174 place count 348 transition count 649
Performed 48 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 222 place count 348 transition count 931
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 225 place count 348 transition count 928
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 232 place count 341 transition count 914
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 239 place count 341 transition count 914
Deduced a syphon composed of 144 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 242 place count 341 transition count 911
Deduced a syphon composed of 144 places in 0 ms
Applied a total of 242 rules in 70 ms. Remains 341 /378 variables (removed 37) and now considering 911/632 (removed -279) transitions.
[2024-06-03 00:56:48] [INFO ] Redundant transitions in 62 ms returned []
Running 910 sub problems to find dead transitions.
[2024-06-03 00:56:48] [INFO ] Flow matrix only has 882 transitions (discarded 29 similar events)
// Phase 1: matrix 882 rows 341 cols
[2024-06-03 00:56:48] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:56:48] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 910 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 910 unsolved
[2024-06-03 00:56:58] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 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 TDEAD27 is UNSAT
[2024-06-03 00:56:58] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-03 00:56:59] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-06-03 00:56:59] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 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 TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-06-03 00:56:59] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
[2024-06-03 00:56:59] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-06-03 00:56:59] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 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
[2024-06-03 00:56:59] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
[2024-06-03 00:56:59] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
[2024-06-03 00:56:59] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
[2024-06-03 00:56:59] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 2 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
[2024-06-03 00:56:59] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 2 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
[2024-06-03 00:57:01] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2024-06-03 00:57:01] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:57:01] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2024-06-03 00:57:01] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
[2024-06-03 00:57:01] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 1 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
[2024-06-03 00:57:02] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:57:02] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 2 ms to minimize.
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
[2024-06-03 00:57:04] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 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 TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 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 TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 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 TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 20/30 constraints. Problems are: Problem set: 308 solved, 602 unsolved
[2024-06-03 00:57:08] [INFO ] Deduced a trap composed of 129 places in 150 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 1/31 constraints. Problems are: Problem set: 308 solved, 602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/31 constraints. Problems are: Problem set: 308 solved, 602 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD438 is UNSAT
At refinement iteration 5 (OVERLAPS) 881/1222 variables, 341/372 constraints. Problems are: Problem set: 329 solved, 581 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/1222 variables, 12/384 constraints. Problems are: Problem set: 329 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1222/1223 variables, and 384 constraints, problems are : Problem set: 329 solved, 581 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 341/341 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 910/910 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 329 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 133/329 variables, 10/10 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 21/31 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/31 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 878/1207 variables, 329/360 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1207 variables, 12/372 constraints. Problems are: Problem set: 329 solved, 581 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 581/953 constraints. Problems are: Problem set: 329 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1207/1223 variables, and 953 constraints, problems are : Problem set: 329 solved, 581 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 329/341 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 581/910 constraints, Known Traps: 21/21 constraints]
After SMT, in 60910ms problems are : Problem set: 329 solved, 581 unsolved
Search for dead transitions found 329 dead transitions in 60918ms
Found 329 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 329 transitions
Dead transitions reduction (with SMT) removed 329 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 341/378 places, 582/632 transitions.
Graph (complete) has 1051 edges and 341 vertex of which 197 are kept as prefixes of interest. Removing 144 places using SCC suffix rule.2 ms
Discarding 144 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 197 /341 variables (removed 144) and now considering 582/582 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 197/378 places, 582/632 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61078 ms. Remains : 197/378 places, 582/632 transitions.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 632/632 transitions.
Applied a total of 0 rules in 4 ms. Remains 378 /378 variables (removed 0) and now considering 632/632 (removed 0) transitions.
// Phase 1: matrix 632 rows 378 cols
[2024-06-03 00:57:49] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 00:57:49] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-03 00:57:49] [INFO ] Invariant cache hit.
[2024-06-03 00:57:50] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 631 sub problems to find dead transitions.
[2024-06-03 00:57:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:57:57] [INFO ] Deduced a trap composed of 244 places in 119 ms of which 4 ms to minimize.
[2024-06-03 00:57:57] [INFO ] Deduced a trap composed of 252 places in 110 ms of which 2 ms to minimize.
[2024-06-03 00:57:57] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:57:57] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:57:58] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-06-03 00:57:58] [INFO ] Deduced a trap composed of 77 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:57:59] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:57:59] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2024-06-03 00:58:00] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-06-03 00:58:01] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 4 (OVERLAPS) 632/1010 variables, 378/398 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:58:13] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 631 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 631 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:58:23] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 1 ms to minimize.
[2024-06-03 00:58:24] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:58:25] [INFO ] Deduced a trap composed of 79 places in 41 ms of which 1 ms to minimize.
[2024-06-03 00:58:25] [INFO ] Deduced a trap composed of 92 places in 36 ms of which 1 ms to minimize.
[2024-06-03 00:58:25] [INFO ] Deduced a trap composed of 96 places in 39 ms of which 1 ms to minimize.
[2024-06-03 00:58:28] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:58:30] [INFO ] Deduced a trap composed of 96 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:58:30] [INFO ] Deduced a trap composed of 92 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 6 (OVERLAPS) 632/1010 variables, 378/407 constraints. Problems are: Problem set: 0 solved, 631 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1010 variables, 631/1038 constraints. Problems are: Problem set: 0 solved, 631 unsolved
[2024-06-03 00:58:46] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 2 ms to minimize.
[2024-06-03 00:58:49] [INFO ] Deduced a trap composed of 222 places in 129 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1040 constraints, problems are : Problem set: 0 solved, 631 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 631/631 constraints, Known Traps: 21/21 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 631 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Finished structural reductions in LTL mode , in 1 iterations and 60816 ms. Remains : 378/378 places, 632/632 transitions.
Treatment of property FireWire-PT-20-LTLFireability-06 finished in 248873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 669
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 397 transition count 668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 391 transition count 656
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 391 transition count 656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 388 transition count 651
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 388 transition count 651
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 386 transition count 646
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 386 transition count 646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 384 transition count 642
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 384 transition count 642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 382 transition count 638
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 382 transition count 638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 381 transition count 636
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 381 transition count 636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 634
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 632
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 378 transition count 631
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 378 transition count 631
Applied a total of 67 rules in 40 ms. Remains 378 /411 variables (removed 33) and now considering 631/688 (removed 57) transitions.
// Phase 1: matrix 631 rows 378 cols
[2024-06-03 00:58:50] [INFO ] Computed 10 invariants in 8 ms
[2024-06-03 00:58:50] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-03 00:58:50] [INFO ] Invariant cache hit.
[2024-06-03 00:58:50] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 630 sub problems to find dead transitions.
[2024-06-03 00:58:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-03 00:58:58] [INFO ] Deduced a trap composed of 244 places in 118 ms of which 2 ms to minimize.
[2024-06-03 00:58:58] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:58:58] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 2 ms to minimize.
[2024-06-03 00:58:59] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2024-06-03 00:58:59] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 1 ms to minimize.
[2024-06-03 00:59:00] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:59:00] [INFO ] Deduced a trap composed of 78 places in 46 ms of which 0 ms to minimize.
[2024-06-03 00:59:00] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-06-03 00:59:01] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2024-06-03 00:59:01] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-03 00:59:04] [INFO ] Deduced a trap composed of 239 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (OVERLAPS) 631/1009 variables, 378/399 constraints. Problems are: Problem set: 0 solved, 630 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 1009/1009 variables, and 399 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (OVERLAPS) 631/1009 variables, 378/399 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 630/1029 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-03 00:59:36] [INFO ] Deduced a trap composed of 221 places in 130 ms of which 3 ms to minimize.
[2024-06-03 00:59:36] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
[2024-06-03 00:59:37] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 1032 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 14/14 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 630 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 378/411 places, 631/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60829 ms. Remains : 378/411 places, 631/688 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FireWire-PT-20-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-07 finished in 61101 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 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 396 transition count 668
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 396 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 396 transition count 667
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 391 transition count 658
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 391 transition count 658
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 389 transition count 655
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 389 transition count 655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 388 transition count 652
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 388 transition count 652
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 387 transition count 650
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 387 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 386 transition count 647
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 386 transition count 647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 385 transition count 645
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 385 transition count 645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 384 transition count 643
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 384 transition count 643
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 383 transition count 641
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 383 transition count 641
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 382 transition count 640
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 382 transition count 640
Applied a total of 59 rules in 42 ms. Remains 382 /411 variables (removed 29) and now considering 640/688 (removed 48) transitions.
// Phase 1: matrix 640 rows 382 cols
[2024-06-03 00:59:51] [INFO ] Computed 10 invariants in 8 ms
[2024-06-03 00:59:51] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-03 00:59:51] [INFO ] Invariant cache hit.
[2024-06-03 00:59:51] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 639 sub problems to find dead transitions.
[2024-06-03 00:59:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 00:59:59] [INFO ] Deduced a trap composed of 270 places in 113 ms of which 3 ms to minimize.
[2024-06-03 00:59:59] [INFO ] Deduced a trap composed of 233 places in 116 ms of which 2 ms to minimize.
[2024-06-03 00:59:59] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2024-06-03 00:59:59] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-03 01:00:00] [INFO ] Deduced a trap composed of 76 places in 39 ms of which 1 ms to minimize.
[2024-06-03 01:00:01] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 1 ms to minimize.
[2024-06-03 01:00:01] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 0 ms to minimize.
[2024-06-03 01:00:01] [INFO ] Deduced a trap composed of 89 places in 42 ms of which 0 ms to minimize.
[2024-06-03 01:00:02] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2024-06-03 01:00:04] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:00:05] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 1 ms to minimize.
[2024-06-03 01:00:07] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (OVERLAPS) 640/1022 variables, 382/404 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:00:20] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 4 ms to minimize.
[2024-06-03 01:00:21] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 406 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:00:27] [INFO ] Deduced a trap composed of 97 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:00:32] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 6 (OVERLAPS) 640/1022 variables, 382/408 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1022 variables, 639/1047 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:00:48] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 2 ms to minimize.
[2024-06-03 01:00:48] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 2 ms to minimize.
[2024-06-03 01:00:50] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1050 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 19/19 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in LTL mode, iteration 1 : 382/411 places, 640/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60775 ms. Remains : 382/411 places, 640/688 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-08
Product exploration explored 100000 steps with 25000 reset in 159 ms.
Product exploration explored 100000 steps with 25000 reset in 164 ms.
Computed a total of 89 stabilizing places and 118 stable transitions
Computed a total of 89 stabilizing places and 118 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 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 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (28 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (38 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1258729 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :0 out of 1
Probabilistic random walk after 1258729 steps, saw 204790 distinct states, run finished after 3003 ms. (steps per millisecond=419 ) properties seen :0
[2024-06-03 01:00:56] [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) 123/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/346 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/950 variables, 346/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/986 variables, 18/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/986 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/1010 variables, 9/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/1022 variables, 9/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1022 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1022 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 392 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 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) 123/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/346 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/950 variables, 346/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/950 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 36/986 variables, 18/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/986 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/1010 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1010 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/1022 variables, 9/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1022 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1022 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 606ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 640/640 transitions.
Graph (trivial) has 282 edges and 382 vertex of which 11 / 382 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 374 transition count 572
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 321 transition count 565
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 318 transition count 565
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 117 place count 318 transition count 524
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 199 place count 277 transition count 524
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 267 place count 243 transition count 490
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 357 place count 198 transition count 589
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 360 place count 198 transition count 586
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 380 place count 198 transition count 566
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 409 place count 178 transition count 557
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 415 place count 172 transition count 551
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 172 transition count 551
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 430 place count 172 transition count 542
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 457 place count 172 transition count 515
Applied a total of 457 rules in 42 ms. Remains 172 /382 variables (removed 210) and now considering 515/640 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 172/382 places, 515/640 transitions.
RANDOM walk for 40000 steps (1289 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (247 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 329593 steps, run visited all 1 properties in 995 ms. (steps per millisecond=331 )
Probabilistic random walk after 329593 steps, saw 106119 distinct states, run finished after 999 ms. (steps per millisecond=329 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 113 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 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 382/382 places, 640/640 transitions.
Applied a total of 0 rules in 5 ms. Remains 382 /382 variables (removed 0) and now considering 640/640 (removed 0) transitions.
[2024-06-03 01:00:58] [INFO ] Invariant cache hit.
[2024-06-03 01:00:58] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-03 01:00:58] [INFO ] Invariant cache hit.
[2024-06-03 01:00:58] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 639 sub problems to find dead transitions.
[2024-06-03 01:00:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:01:06] [INFO ] Deduced a trap composed of 270 places in 132 ms of which 2 ms to minimize.
[2024-06-03 01:01:06] [INFO ] Deduced a trap composed of 233 places in 130 ms of which 3 ms to minimize.
[2024-06-03 01:01:06] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 2 ms to minimize.
[2024-06-03 01:01:06] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2024-06-03 01:01:06] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 0 ms to minimize.
[2024-06-03 01:01:08] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2024-06-03 01:01:08] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2024-06-03 01:01:08] [INFO ] Deduced a trap composed of 89 places in 45 ms of which 1 ms to minimize.
[2024-06-03 01:01:09] [INFO ] Deduced a trap composed of 56 places in 160 ms of which 2 ms to minimize.
[2024-06-03 01:01:11] [INFO ] Deduced a trap composed of 77 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:01:12] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 1 ms to minimize.
[2024-06-03 01:01:14] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (OVERLAPS) 640/1022 variables, 382/404 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:01:28] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 405 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:01:34] [INFO ] Deduced a trap composed of 97 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:01:39] [INFO ] Deduced a trap composed of 96 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:01:43] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
[2024-06-03 01:01:45] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 7 (OVERLAPS) 640/1022 variables, 382/409 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1022 variables, 639/1048 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1048 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 17/17 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Finished structural reductions in LTL mode , in 1 iterations and 60750 ms. Remains : 382/382 places, 640/640 transitions.
Computed a total of 89 stabilizing places and 118 stable transitions
Computed a total of 89 stabilizing places and 118 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 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 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (16 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (24 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1250529 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :0 out of 1
Probabilistic random walk after 1250529 steps, saw 203565 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
[2024-06-03 01:02:02] [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) 123/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/346 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/950 variables, 346/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/986 variables, 18/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/986 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/1010 variables, 9/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/1022 variables, 9/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1022 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1022 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 392 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 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) 123/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/346 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 604/950 variables, 346/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/950 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 36/986 variables, 18/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/986 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/1010 variables, 9/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1010 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/1022 variables, 9/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1022 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1022 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 595ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 640/640 transitions.
Graph (trivial) has 282 edges and 382 vertex of which 11 / 382 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 374 transition count 572
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 321 transition count 565
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 318 transition count 565
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 117 place count 318 transition count 524
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 199 place count 277 transition count 524
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 267 place count 243 transition count 490
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 357 place count 198 transition count 589
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 360 place count 198 transition count 586
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 380 place count 198 transition count 566
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 409 place count 178 transition count 557
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 415 place count 172 transition count 551
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 172 transition count 551
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 430 place count 172 transition count 542
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 457 place count 172 transition count 515
Applied a total of 457 rules in 43 ms. Remains 172 /382 variables (removed 210) and now considering 515/640 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 172/382 places, 515/640 transitions.
RANDOM walk for 38520 steps (1250 resets) in 113 ms. (337 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 87 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 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 103 ms.
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 640/640 transitions.
Graph (trivial) has 282 edges and 382 vertex of which 11 / 382 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 374 transition count 631
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 374 transition count 627
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 58 place count 374 transition count 661
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 83 place count 374 transition count 661
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 368 transition count 655
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 368 transition count 655
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 121 places in 1 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 144 place count 368 transition count 674
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 160 place count 352 transition count 658
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 176 place count 352 transition count 658
Performed 49 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 154 places in 1 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 225 place count 352 transition count 954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 228 place count 352 transition count 951
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 235 place count 345 transition count 937
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 242 place count 345 transition count 937
Deduced a syphon composed of 147 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 245 place count 345 transition count 934
Deduced a syphon composed of 147 places in 0 ms
Applied a total of 245 rules in 47 ms. Remains 345 /382 variables (removed 37) and now considering 934/640 (removed -294) transitions.
[2024-06-03 01:02:03] [INFO ] Redundant transitions in 11 ms returned []
Running 926 sub problems to find dead transitions.
[2024-06-03 01:02:04] [INFO ] Flow matrix only has 905 transitions (discarded 29 similar events)
// Phase 1: matrix 905 rows 345 cols
[2024-06-03 01:02:04] [INFO ] Computed 10 invariants in 4 ms
[2024-06-03 01:02:04] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 926 unsolved
At refinement iteration 1 (OVERLAPS) 1/345 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 926 unsolved
[2024-06-03 01:02:14] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 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
[2024-06-03 01:02:14] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
[2024-06-03 01:02:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-03 01:02:14] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 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 TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-06-03 01:02:14] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
[2024-06-03 01:02:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-03 01:02:15] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-06-03 01:02:15] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
Problem TDEAD76 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 TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
[2024-06-03 01:02:15] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
[2024-06-03 01:02:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
[2024-06-03 01:02:15] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 2 ms to minimize.
[2024-06-03 01:02:15] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
[2024-06-03 01:02:15] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
[2024-06-03 01:02:17] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-03 01:02:17] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-03 01:02:17] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-03 01:02:17] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
[2024-06-03 01:02:17] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 1 ms to minimize.
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 18/28 constraints. Problems are: Problem set: 321 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/345 variables, 0/28 constraints. Problems are: Problem set: 321 solved, 605 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD444 is UNSAT
At refinement iteration 4 (OVERLAPS) 904/1249 variables, 345/373 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1249 variables, 12/385 constraints. Problems are: Problem set: 342 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/1250 variables, and 385 constraints, problems are : Problem set: 342 solved, 584 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 345/345 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 926/926 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 342 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 136/333 variables, 10/10 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 18/28 constraints. Problems are: Problem set: 342 solved, 584 unsolved
[2024-06-03 01:02:39] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 1/29 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/29 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 5 (OVERLAPS) 901/1234 variables, 333/362 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1234 variables, 12/374 constraints. Problems are: Problem set: 342 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1234 variables, 584/958 constraints. Problems are: Problem set: 342 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1234/1250 variables, and 958 constraints, problems are : Problem set: 342 solved, 584 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/345 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 584/926 constraints, Known Traps: 19/19 constraints]
After SMT, in 60948ms problems are : Problem set: 342 solved, 584 unsolved
Search for dead transitions found 342 dead transitions in 60956ms
Found 342 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 342 transitions
Dead transitions reduction (with SMT) removed 342 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 345/382 places, 592/640 transitions.
Graph (complete) has 1067 edges and 345 vertex of which 198 are kept as prefixes of interest. Removing 147 places using SCC suffix rule.1 ms
Discarding 147 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 198 /345 variables (removed 147) and now considering 592/592 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/382 places, 592/640 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61043 ms. Remains : 198/382 places, 592/640 transitions.
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 382/382 places, 640/640 transitions.
Applied a total of 0 rules in 3 ms. Remains 382 /382 variables (removed 0) and now considering 640/640 (removed 0) transitions.
// Phase 1: matrix 640 rows 382 cols
[2024-06-03 01:03:04] [INFO ] Computed 10 invariants in 8 ms
[2024-06-03 01:03:05] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-03 01:03:05] [INFO ] Invariant cache hit.
[2024-06-03 01:03:05] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 639 sub problems to find dead transitions.
[2024-06-03 01:03:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:03:13] [INFO ] Deduced a trap composed of 270 places in 120 ms of which 2 ms to minimize.
[2024-06-03 01:03:13] [INFO ] Deduced a trap composed of 233 places in 119 ms of which 3 ms to minimize.
[2024-06-03 01:03:13] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-06-03 01:03:13] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2024-06-03 01:03:13] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 0 ms to minimize.
[2024-06-03 01:03:14] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2024-06-03 01:03:15] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2024-06-03 01:03:15] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
[2024-06-03 01:03:16] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-06-03 01:03:18] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:03:19] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 1 ms to minimize.
[2024-06-03 01:03:21] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 5 (OVERLAPS) 640/1022 variables, 382/404 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:03:34] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 405 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:03:41] [INFO ] Deduced a trap composed of 97 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:03:46] [INFO ] Deduced a trap composed of 96 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 639 unsolved
[2024-06-03 01:03:50] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 3 ms to minimize.
[2024-06-03 01:03:52] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 7 (OVERLAPS) 640/1022 variables, 382/409 constraints. Problems are: Problem set: 0 solved, 639 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1022 variables, 639/1048 constraints. Problems are: Problem set: 0 solved, 639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1048 constraints, problems are : Problem set: 0 solved, 639 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 639/639 constraints, Known Traps: 17/17 constraints]
After SMT, in 60279ms problems are : Problem set: 0 solved, 639 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Finished structural reductions in LTL mode , in 1 iterations and 60746 ms. Remains : 382/382 places, 640/640 transitions.
Treatment of property FireWire-PT-20-LTLFireability-08 finished in 254283 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 U (p1&&X(!p1))))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 669
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 397 transition count 668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 391 transition count 656
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 391 transition count 656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 388 transition count 651
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 388 transition count 651
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 386 transition count 646
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 386 transition count 646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 384 transition count 642
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 384 transition count 642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 382 transition count 638
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 382 transition count 638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 381 transition count 636
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 381 transition count 636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 634
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 632
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 378 transition count 631
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 378 transition count 631
Applied a total of 67 rules in 32 ms. Remains 378 /411 variables (removed 33) and now considering 631/688 (removed 57) transitions.
// Phase 1: matrix 631 rows 378 cols
[2024-06-03 01:04:05] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 01:04:05] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-03 01:04:05] [INFO ] Invariant cache hit.
[2024-06-03 01:04:06] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 630 sub problems to find dead transitions.
[2024-06-03 01:04:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-03 01:04:13] [INFO ] Deduced a trap composed of 252 places in 111 ms of which 2 ms to minimize.
[2024-06-03 01:04:13] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 3 ms to minimize.
[2024-06-03 01:04:13] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
[2024-06-03 01:04:14] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 1 ms to minimize.
[2024-06-03 01:04:14] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 1 ms to minimize.
[2024-06-03 01:04:14] [INFO ] Deduced a trap composed of 77 places in 38 ms of which 1 ms to minimize.
[2024-06-03 01:04:15] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 1 ms to minimize.
[2024-06-03 01:04:16] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-06-03 01:04:16] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-06-03 01:04:17] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-06-03 01:04:17] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (OVERLAPS) 631/1009 variables, 378/399 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-03 01:04:30] [INFO ] Deduced a trap composed of 108 places in 100 ms of which 2 ms to minimize.
[2024-06-03 01:04:30] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-06-03 01:04:30] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 3/402 constraints. Problems are: Problem set: 0 solved, 630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 402 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/377 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 1 (OVERLAPS) 1/378 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 4 (OVERLAPS) 631/1009 variables, 378/402 constraints. Problems are: Problem set: 0 solved, 630 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 630/1032 constraints. Problems are: Problem set: 0 solved, 630 unsolved
[2024-06-03 01:04:50] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-06-03 01:04:51] [INFO ] Deduced a trap composed of 264 places in 130 ms of which 2 ms to minimize.
[2024-06-03 01:04:51] [INFO ] Deduced a trap composed of 254 places in 131 ms of which 2 ms to minimize.
[2024-06-03 01:04:53] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 2 ms to minimize.
[2024-06-03 01:04:56] [INFO ] Deduced a trap composed of 241 places in 117 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 1037 constraints, problems are : Problem set: 0 solved, 630 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 630/630 constraints, Known Traps: 19/19 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 630 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in LTL mode, iteration 1 : 378/411 places, 631/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60771 ms. Remains : 378/411 places, 631/688 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, true, p1, p1]
Running random walk in product with property : FireWire-PT-20-LTLFireability-11
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-11 finished in 60950 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)&&(p1||G(p2)))))'
Support contains 5 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 396 transition count 668
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 396 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 396 transition count 667
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 390 transition count 655
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 387 transition count 650
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 385 transition count 645
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 385 transition count 645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 384 transition count 643
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 384 transition count 643
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 383 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 383 transition count 642
Applied a total of 57 rules in 28 ms. Remains 383 /411 variables (removed 28) and now considering 642/688 (removed 46) transitions.
// Phase 1: matrix 642 rows 383 cols
[2024-06-03 01:05:06] [INFO ] Computed 10 invariants in 7 ms
[2024-06-03 01:05:06] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-03 01:05:06] [INFO ] Invariant cache hit.
[2024-06-03 01:05:07] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 641 sub problems to find dead transitions.
[2024-06-03 01:05:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (OVERLAPS) 1/383 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-03 01:05:14] [INFO ] Deduced a trap composed of 237 places in 121 ms of which 2 ms to minimize.
[2024-06-03 01:05:14] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 3 ms to minimize.
[2024-06-03 01:05:14] [INFO ] Deduced a trap composed of 220 places in 109 ms of which 2 ms to minimize.
[2024-06-03 01:05:14] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-06-03 01:05:15] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-06-03 01:05:15] [INFO ] Deduced a trap composed of 221 places in 108 ms of which 2 ms to minimize.
[2024-06-03 01:05:15] [INFO ] Deduced a trap composed of 223 places in 121 ms of which 2 ms to minimize.
[2024-06-03 01:05:15] [INFO ] Deduced a trap composed of 229 places in 112 ms of which 2 ms to minimize.
[2024-06-03 01:05:15] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 1 ms to minimize.
[2024-06-03 01:05:15] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2024-06-03 01:05:15] [INFO ] Deduced a trap composed of 218 places in 110 ms of which 2 ms to minimize.
[2024-06-03 01:05:16] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-06-03 01:05:16] [INFO ] Deduced a trap composed of 217 places in 117 ms of which 2 ms to minimize.
[2024-06-03 01:05:17] [INFO ] Deduced a trap composed of 222 places in 118 ms of which 2 ms to minimize.
[2024-06-03 01:05:18] [INFO ] Deduced a trap composed of 219 places in 110 ms of which 2 ms to minimize.
[2024-06-03 01:05:18] [INFO ] Deduced a trap composed of 226 places in 122 ms of which 3 ms to minimize.
[2024-06-03 01:05:18] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-06-03 01:05:18] [INFO ] Deduced a trap composed of 223 places in 117 ms of which 2 ms to minimize.
[2024-06-03 01:05:18] [INFO ] Deduced a trap composed of 222 places in 113 ms of which 2 ms to minimize.
[2024-06-03 01:05:19] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-03 01:05:19] [INFO ] Deduced a trap composed of 230 places in 121 ms of which 2 ms to minimize.
[2024-06-03 01:05:19] [INFO ] Deduced a trap composed of 225 places in 114 ms of which 2 ms to minimize.
[2024-06-03 01:05:20] [INFO ] Deduced a trap composed of 222 places in 119 ms of which 2 ms to minimize.
[2024-06-03 01:05:20] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 1 ms to minimize.
[2024-06-03 01:05:21] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 1 ms to minimize.
[2024-06-03 01:05:21] [INFO ] Deduced a trap composed of 220 places in 120 ms of which 2 ms to minimize.
[2024-06-03 01:05:22] [INFO ] Deduced a trap composed of 246 places in 119 ms of which 2 ms to minimize.
[2024-06-03 01:05:22] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 2 ms to minimize.
[2024-06-03 01:05:22] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 3 ms to minimize.
[2024-06-03 01:05:24] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 5 (OVERLAPS) 642/1025 variables, 383/423 constraints. Problems are: Problem set: 0 solved, 641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1025/1025 variables, and 423 constraints, problems are : Problem set: 0 solved, 641 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 641/641 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 1 (OVERLAPS) 1/383 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-03 01:05:44] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-06-03 01:05:44] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-06-03 01:05:44] [INFO ] Deduced a trap composed of 218 places in 106 ms of which 2 ms to minimize.
[2024-06-03 01:05:44] [INFO ] Deduced a trap composed of 225 places in 107 ms of which 2 ms to minimize.
[2024-06-03 01:05:44] [INFO ] Deduced a trap composed of 219 places in 107 ms of which 2 ms to minimize.
[2024-06-03 01:05:44] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 5 (OVERLAPS) 642/1025 variables, 383/429 constraints. Problems are: Problem set: 0 solved, 641 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1025 variables, 641/1070 constraints. Problems are: Problem set: 0 solved, 641 unsolved
[2024-06-03 01:05:58] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-06-03 01:06:02] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1025/1025 variables, and 1072 constraints, problems are : Problem set: 0 solved, 641 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 383/383 constraints, PredecessorRefiner: 641/641 constraints, Known Traps: 38/38 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 641 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Starting structural reductions in LTL mode, iteration 1 : 383/411 places, 642/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60722 ms. Remains : 383/411 places, 642/688 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-12 finished in 60913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(p1))))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 396 transition count 668
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 396 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 396 transition count 667
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 390 transition count 655
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 387 transition count 650
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 385 transition count 645
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 385 transition count 645
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 383 transition count 641
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 383 transition count 641
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 381 transition count 637
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 381 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 633
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 633
Applied a total of 65 rules in 34 ms. Remains 379 /411 variables (removed 32) and now considering 633/688 (removed 55) transitions.
// Phase 1: matrix 633 rows 379 cols
[2024-06-03 01:06:07] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 01:06:07] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-03 01:06:07] [INFO ] Invariant cache hit.
[2024-06-03 01:06:08] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 632 sub problems to find dead transitions.
[2024-06-03 01:06:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 01:06:15] [INFO ] Deduced a trap composed of 246 places in 118 ms of which 2 ms to minimize.
[2024-06-03 01:06:15] [INFO ] Deduced a trap composed of 253 places in 110 ms of which 2 ms to minimize.
[2024-06-03 01:06:15] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 1 ms to minimize.
[2024-06-03 01:06:15] [INFO ] Deduced a trap composed of 76 places in 40 ms of which 1 ms to minimize.
[2024-06-03 01:06:15] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2024-06-03 01:06:16] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 1 ms to minimize.
[2024-06-03 01:06:16] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 1 ms to minimize.
[2024-06-03 01:06:17] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
[2024-06-03 01:06:17] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 0 ms to minimize.
[2024-06-03 01:06:17] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-06-03 01:06:18] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 01:06:21] [INFO ] Deduced a trap composed of 226 places in 108 ms of which 2 ms to minimize.
[2024-06-03 01:06:21] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-06-03 01:06:21] [INFO ] Deduced a trap composed of 223 places in 106 ms of which 2 ms to minimize.
[2024-06-03 01:06:21] [INFO ] Deduced a trap composed of 228 places in 103 ms of which 2 ms to minimize.
[2024-06-03 01:06:22] [INFO ] Deduced a trap composed of 216 places in 109 ms of which 2 ms to minimize.
[2024-06-03 01:06:22] [INFO ] Deduced a trap composed of 216 places in 109 ms of which 2 ms to minimize.
[2024-06-03 01:06:24] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 01:06:31] [INFO ] Deduced a trap composed of 224 places in 113 ms of which 3 ms to minimize.
[2024-06-03 01:06:32] [INFO ] Deduced a trap composed of 221 places in 119 ms of which 2 ms to minimize.
[2024-06-03 01:06:33] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 2 ms to minimize.
[2024-06-03 01:06:33] [INFO ] Deduced a trap composed of 220 places in 114 ms of which 2 ms to minimize.
[2024-06-03 01:06:34] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-06-03 01:06:34] [INFO ] Deduced a trap composed of 223 places in 108 ms of which 6 ms to minimize.
[2024-06-03 01:06:34] [INFO ] Deduced a trap composed of 227 places in 114 ms of which 2 ms to minimize.
[2024-06-03 01:06:34] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-06-03 01:06:34] [INFO ] Deduced a trap composed of 239 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 01:06:38] [INFO ] Deduced a trap composed of 96 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/1012 variables, and 38 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/379 constraints, PredecessorRefiner: 632/632 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 1 (OVERLAPS) 1/379 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 01:06:42] [INFO ] Deduced a trap composed of 216 places in 114 ms of which 2 ms to minimize.
[2024-06-03 01:06:42] [INFO ] Deduced a trap composed of 216 places in 109 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 01:06:48] [INFO ] Deduced a trap composed of 223 places in 118 ms of which 2 ms to minimize.
[2024-06-03 01:06:49] [INFO ] Deduced a trap composed of 223 places in 112 ms of which 2 ms to minimize.
[2024-06-03 01:06:49] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-03 01:06:49] [INFO ] Deduced a trap composed of 222 places in 108 ms of which 2 ms to minimize.
[2024-06-03 01:06:49] [INFO ] Deduced a trap composed of 236 places in 104 ms of which 2 ms to minimize.
[2024-06-03 01:06:49] [INFO ] Deduced a trap composed of 244 places in 117 ms of which 2 ms to minimize.
[2024-06-03 01:06:49] [INFO ] Deduced a trap composed of 215 places in 106 ms of which 2 ms to minimize.
[2024-06-03 01:06:49] [INFO ] Deduced a trap composed of 217 places in 103 ms of which 2 ms to minimize.
[2024-06-03 01:06:51] [INFO ] Deduced a trap composed of 220 places in 117 ms of which 2 ms to minimize.
[2024-06-03 01:06:51] [INFO ] Deduced a trap composed of 218 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 01:06:55] [INFO ] Deduced a trap composed of 224 places in 114 ms of which 2 ms to minimize.
[2024-06-03 01:06:55] [INFO ] Deduced a trap composed of 223 places in 109 ms of which 2 ms to minimize.
[2024-06-03 01:06:55] [INFO ] Deduced a trap composed of 217 places in 105 ms of which 2 ms to minimize.
[2024-06-03 01:06:58] [INFO ] Deduced a trap composed of 217 places in 115 ms of which 2 ms to minimize.
[2024-06-03 01:06:58] [INFO ] Deduced a trap composed of 223 places in 102 ms of which 2 ms to minimize.
[2024-06-03 01:06:58] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 632 unsolved
[2024-06-03 01:07:03] [INFO ] Deduced a trap composed of 228 places in 113 ms of which 2 ms to minimize.
[2024-06-03 01:07:03] [INFO ] Deduced a trap composed of 225 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/1012 variables, and 58 constraints, problems are : Problem set: 0 solved, 632 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/379 constraints, PredecessorRefiner: 0/632 constraints, Known Traps: 48/48 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 632 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 379/411 places, 633/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60746 ms. Remains : 379/411 places, 633/688 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-13
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-13 finished in 60881 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 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 300 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 402 transition count 618
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 125 place count 342 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 341 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 126 place count 341 transition count 579
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 196 place count 306 transition count 579
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 206 place count 296 transition count 564
Iterating global reduction 3 with 10 rules applied. Total rules applied 216 place count 296 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 296 transition count 563
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 217 place count 296 transition count 559
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 225 place count 292 transition count 559
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 289 transition count 551
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 289 transition count 551
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 287 transition count 547
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 287 transition count 547
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 285 transition count 542
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 285 transition count 542
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 241 place count 283 transition count 538
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 283 transition count 538
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 282 transition count 535
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 282 transition count 535
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 281 transition count 533
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 281 transition count 533
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 248 place count 280 transition count 531
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 280 transition count 531
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 250 place count 279 transition count 529
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 279 transition count 529
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 327 place count 241 transition count 490
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 417 place count 196 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 420 place count 196 transition count 583
Applied a total of 420 rules in 59 ms. Remains 196 /411 variables (removed 215) and now considering 583/688 (removed 105) transitions.
[2024-06-03 01:07:08] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
// Phase 1: matrix 557 rows 196 cols
[2024-06-03 01:07:08] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 01:07:08] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-03 01:07:08] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 01:07:08] [INFO ] Invariant cache hit.
[2024-06-03 01:07:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 01:07:08] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-06-03 01:07:09] [INFO ] Redundant transitions in 4 ms returned []
Running 574 sub problems to find dead transitions.
[2024-06-03 01:07:09] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 01:07:09] [INFO ] Invariant cache hit.
[2024-06-03 01:07:09] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 01:07:13] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-06-03 01:07:14] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-06-03 01:07:15] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-06-03 01:07:15] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2024-06-03 01:07:15] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 01:07:19] [INFO ] Deduced a trap composed of 118 places in 93 ms of which 1 ms to minimize.
[2024-06-03 01:07:19] [INFO ] Deduced a trap composed of 111 places in 91 ms of which 1 ms to minimize.
[2024-06-03 01:07:20] [INFO ] Deduced a trap composed of 111 places in 83 ms of which 1 ms to minimize.
[2024-06-03 01:07:20] [INFO ] Deduced a trap composed of 111 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (OVERLAPS) 556/752 variables, 196/215 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 9 (OVERLAPS) 0/752 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
No progress, stopping.
After SMT solving in domain Real declared 752/753 variables, and 227 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 01:07:43] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (OVERLAPS) 556/752 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 574/802 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 802 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 10/10 constraints]
After SMT, in 60555ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60560ms
Starting structural reductions in SI_LTL mode, iteration 1 : 196/411 places, 583/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61066 ms. Remains : 196/411 places, 583/688 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-14
Product exploration explored 100000 steps with 1 reset in 56 ms.
Product exploration explored 100000 steps with 4 reset in 77 ms.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 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 27 ms :[(NOT p0)]
RANDOM walk for 34395 steps (1297 resets) in 82 ms. (414 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 87 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 583/583 transitions.
Applied a total of 0 rules in 8 ms. Remains 196 /196 variables (removed 0) and now considering 583/583 (removed 0) transitions.
[2024-06-03 01:08:10] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 01:08:10] [INFO ] Invariant cache hit.
[2024-06-03 01:08:10] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-03 01:08:10] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 01:08:10] [INFO ] Invariant cache hit.
[2024-06-03 01:08:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 01:08:10] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-06-03 01:08:10] [INFO ] Redundant transitions in 7 ms returned []
Running 574 sub problems to find dead transitions.
[2024-06-03 01:08:10] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 01:08:10] [INFO ] Invariant cache hit.
[2024-06-03 01:08:10] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 01:08:15] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2024-06-03 01:08:15] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-03 01:08:16] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2024-06-03 01:08:16] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 1 ms to minimize.
[2024-06-03 01:08:17] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 01:08:21] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 1 ms to minimize.
[2024-06-03 01:08:21] [INFO ] Deduced a trap composed of 111 places in 88 ms of which 1 ms to minimize.
[2024-06-03 01:08:21] [INFO ] Deduced a trap composed of 111 places in 82 ms of which 1 ms to minimize.
[2024-06-03 01:08:21] [INFO ] Deduced a trap composed of 111 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (OVERLAPS) 556/752 variables, 196/215 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/752 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
No progress, stopping.
After SMT solving in domain Real declared 752/753 variables, and 227 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 01:08:44] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (OVERLAPS) 556/752 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 574/802 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 802 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 10/10 constraints]
After SMT, in 60582ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60587ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61008 ms. Remains : 196/196 places, 583/583 transitions.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 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 25 ms :[(NOT p0)]
RANDOM walk for 24073 steps (911 resets) in 47 ms. (501 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 166 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4 reset in 49 ms.
Product exploration explored 100000 steps with 8 reset in 50 ms.
Support contains 1 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 583/583 transitions.
Applied a total of 0 rules in 5 ms. Remains 196 /196 variables (removed 0) and now considering 583/583 (removed 0) transitions.
[2024-06-03 01:09:11] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 01:09:11] [INFO ] Invariant cache hit.
[2024-06-03 01:09:11] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-03 01:09:11] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 01:09:11] [INFO ] Invariant cache hit.
[2024-06-03 01:09:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 01:09:11] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-06-03 01:09:11] [INFO ] Redundant transitions in 7 ms returned []
Running 574 sub problems to find dead transitions.
[2024-06-03 01:09:11] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-03 01:09:11] [INFO ] Invariant cache hit.
[2024-06-03 01:09:11] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 01:09:17] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-06-03 01:09:17] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-06-03 01:09:18] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2024-06-03 01:09:18] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 2 ms to minimize.
[2024-06-03 01:09:18] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 01:09:23] [INFO ] Deduced a trap composed of 118 places in 90 ms of which 2 ms to minimize.
[2024-06-03 01:09:23] [INFO ] Deduced a trap composed of 111 places in 84 ms of which 2 ms to minimize.
[2024-06-03 01:09:23] [INFO ] Deduced a trap composed of 111 places in 82 ms of which 2 ms to minimize.
[2024-06-03 01:09:23] [INFO ] Deduced a trap composed of 111 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (OVERLAPS) 556/752 variables, 196/215 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 9 (OVERLAPS) 0/752 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 574 unsolved
No progress, stopping.
After SMT solving in domain Real declared 752/753 variables, and 227 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 574 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 574 unsolved
[2024-06-03 01:09:46] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 7 (OVERLAPS) 556/752 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 574/802 constraints. Problems are: Problem set: 0 solved, 574 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 574 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 802 constraints, problems are : Problem set: 0 solved, 574 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 574/574 constraints, Known Traps: 10/10 constraints]
After SMT, in 60647ms problems are : Problem set: 0 solved, 574 unsolved
Search for dead transitions found 0 dead transitions in 60656ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61080 ms. Remains : 196/196 places, 583/583 transitions.
Treatment of property FireWire-PT-20-LTLFireability-14 finished in 184173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 300 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 402 transition count 617
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 341 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 340 transition count 613
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 128 place count 340 transition count 578
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 198 place count 305 transition count 578
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 206 place count 297 transition count 566
Iterating global reduction 3 with 8 rules applied. Total rules applied 214 place count 297 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 297 transition count 565
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 215 place count 297 transition count 562
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 294 transition count 562
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 223 place count 292 transition count 557
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 292 transition count 557
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 226 place count 291 transition count 555
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 291 transition count 555
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 228 place count 290 transition count 552
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 290 transition count 552
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 230 place count 289 transition count 550
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 289 transition count 550
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 232 place count 288 transition count 547
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 288 transition count 547
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 234 place count 287 transition count 545
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 287 transition count 545
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 236 place count 286 transition count 543
Iterating global reduction 4 with 1 rules applied. Total rules applied 237 place count 286 transition count 543
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 238 place count 285 transition count 541
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 285 transition count 541
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 317 place count 246 transition count 501
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 318 place count 245 transition count 499
Iterating global reduction 4 with 1 rules applied. Total rules applied 319 place count 245 transition count 499
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 409 place count 200 transition count 598
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 412 place count 200 transition count 595
Applied a total of 412 rules in 62 ms. Remains 200 /411 variables (removed 211) and now considering 595/688 (removed 93) transitions.
[2024-06-03 01:10:12] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
// Phase 1: matrix 566 rows 200 cols
[2024-06-03 01:10:12] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 01:10:12] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-03 01:10:12] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 01:10:12] [INFO ] Invariant cache hit.
[2024-06-03 01:10:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 01:10:13] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-06-03 01:10:13] [INFO ] Redundant transitions in 6 ms returned []
Running 586 sub problems to find dead transitions.
[2024-06-03 01:10:13] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 01:10:13] [INFO ] Invariant cache hit.
[2024-06-03 01:10:13] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:10:18] [INFO ] Deduced a trap composed of 49 places in 29 ms of which 0 ms to minimize.
[2024-06-03 01:10:18] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-06-03 01:10:18] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-06-03 01:10:19] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-06-03 01:10:19] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
[2024-06-03 01:10:19] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-06-03 01:10:20] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (OVERLAPS) 565/765 variables, 200/217 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 12/229 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 586 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/766 variables, and 229 constraints, problems are : Problem set: 0 solved, 586 unsolved in 24220 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:10:41] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:10:45] [INFO ] Deduced a trap composed of 119 places in 91 ms of which 1 ms to minimize.
[2024-06-03 01:10:45] [INFO ] Deduced a trap composed of 125 places in 89 ms of which 1 ms to minimize.
[2024-06-03 01:10:45] [INFO ] Deduced a trap composed of 131 places in 92 ms of which 1 ms to minimize.
[2024-06-03 01:10:45] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 8 (OVERLAPS) 565/765 variables, 200/222 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/765 variables, 12/234 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/765 variables, 586/820 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:11:00] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-03 01:11:02] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2024-06-03 01:11:02] [INFO ] Deduced a trap composed of 128 places in 101 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/766 variables, and 823 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 15/15 constraints]
After SMT, in 54789ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 54794ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/411 places, 595/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55389 ms. Remains : 200/411 places, 595/688 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-15 finished in 55531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X(p1)))))'
Found a Lengthening insensitive property : FireWire-PT-20-LTLFireability-06
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 299 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 403 transition count 618
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 342 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 341 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 128 place count 341 transition count 579
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 198 place count 306 transition count 579
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 207 place count 297 transition count 566
Iterating global reduction 3 with 9 rules applied. Total rules applied 216 place count 297 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 297 transition count 565
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 217 place count 297 transition count 561
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 225 place count 293 transition count 561
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 290 transition count 553
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 290 transition count 553
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 288 transition count 549
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 288 transition count 549
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 286 transition count 544
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 286 transition count 544
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 241 place count 284 transition count 540
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 284 transition count 540
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 283 transition count 537
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 283 transition count 537
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 282 transition count 535
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 282 transition count 535
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 248 place count 281 transition count 533
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 281 transition count 533
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 250 place count 280 transition count 531
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 280 transition count 531
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 327 place count 242 transition count 492
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 241 transition count 490
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 241 transition count 490
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 417 place count 197 transition count 585
Applied a total of 417 rules in 60 ms. Remains 197 /411 variables (removed 214) and now considering 585/688 (removed 103) transitions.
[2024-06-03 01:11:08] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
// Phase 1: matrix 556 rows 197 cols
[2024-06-03 01:11:08] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 01:11:08] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-03 01:11:08] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 01:11:08] [INFO ] Invariant cache hit.
[2024-06-03 01:11:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-03 01:11:08] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2024-06-03 01:11:08] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 01:11:08] [INFO ] Invariant cache hit.
[2024-06-03 01:11:08] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:11:13] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-06-03 01:11:13] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-06-03 01:11:14] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-03 01:11:14] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-06-03 01:11:14] [INFO ] Deduced a trap composed of 120 places in 87 ms of which 2 ms to minimize.
[2024-06-03 01:11:15] [INFO ] Deduced a trap composed of 123 places in 91 ms of which 1 ms to minimize.
[2024-06-03 01:11:16] [INFO ] Deduced a trap composed of 155 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:11:18] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 1 ms to minimize.
[2024-06-03 01:11:19] [INFO ] Deduced a trap composed of 114 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (OVERLAPS) 555/752 variables, 197/216 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 8 (OVERLAPS) 1/753 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/753 variables, and 229 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:11:42] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 1 ms to minimize.
[2024-06-03 01:11:43] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:11:45] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-06-03 01:11:46] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-06-03 01:11:46] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 6 (OVERLAPS) 555/752 variables, 197/221 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 584/817 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:12:04] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2024-06-03 01:12:04] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 819 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 16/16 constraints]
After SMT, in 60583ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60588ms
Starting structural reductions in LI_LTL mode, iteration 1 : 197/411 places, 585/688 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61057 ms. Remains : 197/411 places, 585/688 transitions.
Running random walk in product with property : FireWire-PT-20-LTLFireability-06
Product exploration explored 100000 steps with 1 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 70 ms.
Computed a total of 32 stabilizing places and 57 stable transitions
Computed a total of 32 stabilizing places and 57 stable transitions
Detected a total of 32/197 stabilizing places and 57/585 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 119 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1450 resets) in 220 ms. (180 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (257 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2024-06-03 01:12:10] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 01:12:10] [INFO ] Invariant cache hit.
[2024-06-03 01:12:10] [INFO ] State equation strengthened by 13 read => feed constraints.
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) 164/166 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/185 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 555/740 variables, 185/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 12/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/752 variables, 12/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/753 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/753 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 753/753 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 13/13 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
Problem apf2 is UNSAT
After SMT solving in domain Int declared 166/753 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, State Equation: 0/197 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 224ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 10 factoid took 383 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[true, (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 215 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 585/585 transitions.
Applied a total of 0 rules in 4 ms. Remains 197 /197 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2024-06-03 01:12:11] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 01:12:11] [INFO ] Invariant cache hit.
[2024-06-03 01:12:11] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-03 01:12:11] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 01:12:11] [INFO ] Invariant cache hit.
[2024-06-03 01:12:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-03 01:12:11] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2024-06-03 01:12:11] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 01:12:11] [INFO ] Invariant cache hit.
[2024-06-03 01:12:11] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:12:16] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2024-06-03 01:12:16] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2024-06-03 01:12:16] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-06-03 01:12:17] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2024-06-03 01:12:17] [INFO ] Deduced a trap composed of 120 places in 92 ms of which 1 ms to minimize.
[2024-06-03 01:12:17] [INFO ] Deduced a trap composed of 123 places in 89 ms of which 1 ms to minimize.
[2024-06-03 01:12:19] [INFO ] Deduced a trap composed of 155 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:12:20] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 1 ms to minimize.
[2024-06-03 01:12:22] [INFO ] Deduced a trap composed of 114 places in 98 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (OVERLAPS) 555/752 variables, 197/216 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 8 (OVERLAPS) 1/753 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/753 variables, and 229 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:12:45] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 1 ms to minimize.
[2024-06-03 01:12:45] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:12:48] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 1 ms to minimize.
[2024-06-03 01:12:48] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2024-06-03 01:12:48] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 6 (OVERLAPS) 555/752 variables, 197/221 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 584/817 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:13:07] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2024-06-03 01:13:07] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 819 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 16/16 constraints]
After SMT, in 60525ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60529ms
Finished structural reductions in LTL mode , in 1 iterations and 60928 ms. Remains : 197/197 places, 585/585 transitions.
Computed a total of 32 stabilizing places and 57 stable transitions
Computed a total of 32 stabilizing places and 57 stable transitions
Detected a total of 32/197 stabilizing places and 57/585 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1)), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 27783 steps (1019 resets) in 94 ms. (292 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1)), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[true, (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 210 ms :[true, (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 223 ms :[true, (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 57 ms.
Product exploration explored 100000 steps with 1 reset in 54 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 585/585 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 582
Applied a total of 3 rules in 20 ms. Remains 197 /197 variables (removed 0) and now considering 582/585 (removed 3) transitions.
[2024-06-03 01:13:13] [INFO ] Redundant transitions in 6 ms returned []
Running 581 sub problems to find dead transitions.
[2024-06-03 01:13:13] [INFO ] Flow matrix only has 553 transitions (discarded 29 similar events)
// Phase 1: matrix 553 rows 197 cols
[2024-06-03 01:13:13] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 01:13:13] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-03 01:13:18] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2024-06-03 01:13:19] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2024-06-03 01:13:19] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-06-03 01:13:19] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 1 ms to minimize.
[2024-06-03 01:13:20] [INFO ] Deduced a trap composed of 155 places in 101 ms of which 1 ms to minimize.
[2024-06-03 01:13:21] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 552/749 variables, 197/213 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/749 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 7 (OVERLAPS) 1/750 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/750 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/750 variables, and 226 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (OVERLAPS) 552/749 variables, 197/213 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/749 variables, 12/225 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 581/806 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-06-03 01:13:58] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-06-03 01:13:58] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-03 01:14:03] [INFO ] Deduced a trap composed of 120 places in 100 ms of which 1 ms to minimize.
[2024-06-03 01:14:03] [INFO ] Deduced a trap composed of 120 places in 97 ms of which 1 ms to minimize.
[2024-06-03 01:14:04] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 5/811 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/750 variables, and 811 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 11/11 constraints]
After SMT, in 60671ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60677ms
Starting structural reductions in SI_LTL mode, iteration 1 : 197/197 places, 582/585 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60713 ms. Remains : 197/197 places, 582/585 transitions.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 585/585 transitions.
Applied a total of 0 rules in 2 ms. Remains 197 /197 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2024-06-03 01:14:14] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
// Phase 1: matrix 556 rows 197 cols
[2024-06-03 01:14:14] [INFO ] Computed 10 invariants in 4 ms
[2024-06-03 01:14:14] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-03 01:14:14] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 01:14:14] [INFO ] Invariant cache hit.
[2024-06-03 01:14:14] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-03 01:14:14] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2024-06-03 01:14:14] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-03 01:14:14] [INFO ] Invariant cache hit.
[2024-06-03 01:14:14] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:14:19] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2024-06-03 01:14:19] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-06-03 01:14:19] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-06-03 01:14:20] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-06-03 01:14:20] [INFO ] Deduced a trap composed of 120 places in 102 ms of which 1 ms to minimize.
[2024-06-03 01:14:20] [INFO ] Deduced a trap composed of 123 places in 95 ms of which 1 ms to minimize.
[2024-06-03 01:14:22] [INFO ] Deduced a trap composed of 155 places in 103 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:14:23] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2024-06-03 01:14:25] [INFO ] Deduced a trap composed of 114 places in 101 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (OVERLAPS) 555/752 variables, 197/216 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 12/228 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 8 (OVERLAPS) 1/753 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/753 variables, and 229 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:14:48] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 1 ms to minimize.
[2024-06-03 01:14:48] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:14:51] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 1 ms to minimize.
[2024-06-03 01:14:51] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-06-03 01:14:51] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 6 (OVERLAPS) 555/752 variables, 197/221 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 584/817 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-06-03 01:15:09] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2024-06-03 01:15:09] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/753 variables, and 819 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 16/16 constraints]
After SMT, in 60569ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60574ms
Finished structural reductions in LTL mode , in 1 iterations and 60995 ms. Remains : 197/197 places, 585/585 transitions.
Treatment of property FireWire-PT-20-LTLFireability-06 finished in 247254 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)))))'
Found a Shortening insensitive property : FireWire-PT-20-LTLFireability-08
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 301 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 402 transition count 617
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 341 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 340 transition count 613
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 128 place count 340 transition count 578
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 198 place count 305 transition count 578
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 208 place count 295 transition count 563
Iterating global reduction 3 with 10 rules applied. Total rules applied 218 place count 295 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 219 place count 295 transition count 562
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 219 place count 295 transition count 558
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 227 place count 291 transition count 558
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 229 place count 289 transition count 553
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 289 transition count 553
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 232 place count 288 transition count 551
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 288 transition count 551
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 234 place count 287 transition count 548
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 287 transition count 548
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 236 place count 286 transition count 546
Iterating global reduction 4 with 1 rules applied. Total rules applied 237 place count 286 transition count 546
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 238 place count 285 transition count 543
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 285 transition count 543
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 240 place count 284 transition count 541
Iterating global reduction 4 with 1 rules applied. Total rules applied 241 place count 284 transition count 541
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 242 place count 283 transition count 539
Iterating global reduction 4 with 1 rules applied. Total rules applied 243 place count 283 transition count 539
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 282 transition count 537
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 282 transition count 537
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 321 place count 244 transition count 498
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 322 place count 243 transition count 496
Iterating global reduction 4 with 1 rules applied. Total rules applied 323 place count 243 transition count 496
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 413 place count 198 transition count 595
Applied a total of 413 rules in 59 ms. Remains 198 /411 variables (removed 213) and now considering 595/688 (removed 93) transitions.
[2024-06-03 01:15:15] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
// Phase 1: matrix 566 rows 198 cols
[2024-06-03 01:15:15] [INFO ] Computed 10 invariants in 3 ms
[2024-06-03 01:15:15] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-03 01:15:15] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 01:15:15] [INFO ] Invariant cache hit.
[2024-06-03 01:15:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 01:15:16] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 586 sub problems to find dead transitions.
[2024-06-03 01:15:16] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 01:15:16] [INFO ] Invariant cache hit.
[2024-06-03 01:15:16] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:15:21] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-06-03 01:15:21] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 1 ms to minimize.
[2024-06-03 01:15:21] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2024-06-03 01:15:21] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-06-03 01:15:22] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-03 01:15:22] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-03 01:15:22] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-06-03 01:15:23] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:15:28] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:15:30] [INFO ] Deduced a trap composed of 112 places in 100 ms of which 1 ms to minimize.
[2024-06-03 01:15:31] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:15:34] [INFO ] Deduced a trap composed of 114 places in 95 ms of which 1 ms to minimize.
[2024-06-03 01:15:34] [INFO ] Deduced a trap composed of 111 places in 85 ms of which 1 ms to minimize.
[2024-06-03 01:15:34] [INFO ] Deduced a trap composed of 134 places in 87 ms of which 1 ms to minimize.
[2024-06-03 01:15:34] [INFO ] Deduced a trap composed of 140 places in 89 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 8 (OVERLAPS) 565/763 variables, 198/223 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 12/235 constraints. Problems are: Problem set: 0 solved, 586 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 763/764 variables, and 235 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (OVERLAPS) 1/198 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 6 (OVERLAPS) 565/763 variables, 198/223 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 12/235 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 586/821 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:16:04] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/764 variables, and 822 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 16/16 constraints]
After SMT, in 60574ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 60581ms
Starting structural reductions in LI_LTL mode, iteration 1 : 198/411 places, 595/688 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61151 ms. Remains : 198/411 places, 595/688 transitions.
Running random walk in product with property : FireWire-PT-20-LTLFireability-08
Product exploration explored 100000 steps with 25000 reset in 178 ms.
Product exploration explored 100000 steps with 25000 reset in 187 ms.
Computed a total of 35 stabilizing places and 65 stable transitions
Computed a total of 35 stabilizing places and 65 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 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 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1516 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (261 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1012212 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 1
Probabilistic random walk after 1012212 steps, saw 295745 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
[2024-06-03 01:16:20] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 01:16:20] [INFO ] Invariant cache hit.
[2024-06-03 01:16:20] [INFO ] State equation strengthened by 12 read => feed constraints.
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) 67/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/186 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 565/751 variables, 186/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/751 variables, 12/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/763 variables, 12/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/763 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 763/764 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 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) 67/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/186 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 01:16:20] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 565/751 variables, 186/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/751 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/763 variables, 12/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/763 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/763 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 763/764 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 415ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 595/595 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 198 transition count 592
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 198 transition count 589
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 26 place count 198 transition count 569
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 55 place count 178 transition count 560
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 172 transition count 554
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 172 transition count 554
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 76 place count 172 transition count 545
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 103 place count 172 transition count 518
Applied a total of 103 rules in 22 ms. Remains 172 /198 variables (removed 26) and now considering 518/595 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 172/198 places, 518/595 transitions.
RANDOM walk for 40000 steps (1282 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (248 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 44759 steps, run visited all 1 properties in 139 ms. (steps per millisecond=322 )
Probabilistic random walk after 44759 steps, saw 16885 distinct states, run finished after 139 ms. (steps per millisecond=322 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 96 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 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 595/595 transitions.
Applied a total of 0 rules in 1 ms. Remains 198 /198 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-03 01:16:21] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 01:16:21] [INFO ] Invariant cache hit.
[2024-06-03 01:16:21] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-03 01:16:21] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 01:16:21] [INFO ] Invariant cache hit.
[2024-06-03 01:16:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 01:16:21] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 586 sub problems to find dead transitions.
[2024-06-03 01:16:22] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 01:16:22] [INFO ] Invariant cache hit.
[2024-06-03 01:16:22] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:16:27] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2024-06-03 01:16:27] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 1 ms to minimize.
[2024-06-03 01:16:27] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2024-06-03 01:16:27] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-06-03 01:16:28] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-06-03 01:16:28] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-03 01:16:28] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-06-03 01:16:28] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:16:33] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:16:36] [INFO ] Deduced a trap composed of 112 places in 91 ms of which 1 ms to minimize.
[2024-06-03 01:16:36] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:16:39] [INFO ] Deduced a trap composed of 114 places in 86 ms of which 2 ms to minimize.
[2024-06-03 01:16:39] [INFO ] Deduced a trap composed of 111 places in 84 ms of which 1 ms to minimize.
[2024-06-03 01:16:39] [INFO ] Deduced a trap composed of 134 places in 79 ms of which 1 ms to minimize.
[2024-06-03 01:16:39] [INFO ] Deduced a trap composed of 140 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 8 (OVERLAPS) 565/763 variables, 198/223 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 12/235 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/763 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/764 variables, and 235 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (OVERLAPS) 1/198 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 6 (OVERLAPS) 565/763 variables, 198/223 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 12/235 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 586/821 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:17:09] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/764 variables, and 822 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 16/16 constraints]
After SMT, in 60582ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 60588ms
Finished structural reductions in LTL mode , in 1 iterations and 61088 ms. Remains : 198/198 places, 595/595 transitions.
Computed a total of 35 stabilizing places and 65 stable transitions
Computed a total of 35 stabilizing places and 65 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 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)]
RANDOM walk for 40000 steps (1521 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (261 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1002843 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 1
Probabilistic random walk after 1002843 steps, saw 292213 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
[2024-06-03 01:17:25] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 01:17:25] [INFO ] Invariant cache hit.
[2024-06-03 01:17:25] [INFO ] State equation strengthened by 12 read => feed constraints.
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) 67/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/186 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 565/751 variables, 186/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/751 variables, 12/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/763 variables, 12/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/763 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 763/764 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 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) 67/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/186 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 01:17:26] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 565/751 variables, 186/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/751 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/751 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/763 variables, 12/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/763 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/763 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 763/764 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 411ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 595/595 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 198 transition count 592
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 198 transition count 589
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 26 place count 198 transition count 569
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 55 place count 178 transition count 560
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 172 transition count 554
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 172 transition count 554
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 76 place count 172 transition count 545
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 103 place count 172 transition count 518
Applied a total of 103 rules in 25 ms. Remains 172 /198 variables (removed 26) and now considering 518/595 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 172/198 places, 518/595 transitions.
RANDOM walk for 29633 steps (966 resets) in 89 ms. (329 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 88 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 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 234 ms.
Product exploration explored 100000 steps with 25000 reset in 211 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 595/595 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 198 transition count 592
Applied a total of 3 rules in 15 ms. Remains 198 /198 variables (removed 0) and now considering 592/595 (removed 3) transitions.
[2024-06-03 01:17:27] [INFO ] Redundant transitions in 4 ms returned []
Running 583 sub problems to find dead transitions.
[2024-06-03 01:17:27] [INFO ] Flow matrix only has 563 transitions (discarded 29 similar events)
// Phase 1: matrix 563 rows 198 cols
[2024-06-03 01:17:27] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 01:17:27] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-06-03 01:17:32] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2024-06-03 01:17:32] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-06-03 01:17:32] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-06-03 01:17:33] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-03 01:17:33] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-03 01:17:33] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-06-03 01:17:34] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-06-03 01:17:38] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2024-06-03 01:17:38] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2024-06-03 01:17:38] [INFO ] Deduced a trap composed of 112 places in 81 ms of which 1 ms to minimize.
[2024-06-03 01:17:39] [INFO ] Deduced a trap composed of 114 places in 86 ms of which 1 ms to minimize.
[2024-06-03 01:17:39] [INFO ] Deduced a trap composed of 111 places in 85 ms of which 1 ms to minimize.
[2024-06-03 01:17:39] [INFO ] Deduced a trap composed of 134 places in 85 ms of which 1 ms to minimize.
[2024-06-03 01:17:39] [INFO ] Deduced a trap composed of 140 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 6 (OVERLAPS) 562/760 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 12/234 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/761 variables, and 234 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 1/198 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-06-03 01:18:02] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 7 (OVERLAPS) 562/760 variables, 198/223 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 12/235 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 583/818 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-06-03 01:18:14] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/761 variables, and 819 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 16/16 constraints]
After SMT, in 60550ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60556ms
Starting structural reductions in SI_LTL mode, iteration 1 : 198/198 places, 592/595 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60583 ms. Remains : 198/198 places, 592/595 transitions.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 595/595 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-06-03 01:18:28] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
// Phase 1: matrix 566 rows 198 cols
[2024-06-03 01:18:28] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 01:18:28] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-03 01:18:28] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 01:18:28] [INFO ] Invariant cache hit.
[2024-06-03 01:18:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-03 01:18:28] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 586 sub problems to find dead transitions.
[2024-06-03 01:18:28] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-03 01:18:28] [INFO ] Invariant cache hit.
[2024-06-03 01:18:28] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:18:33] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-06-03 01:18:33] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 1 ms to minimize.
[2024-06-03 01:18:33] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2024-06-03 01:18:34] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-03 01:18:34] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 1 ms to minimize.
[2024-06-03 01:18:34] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-03 01:18:35] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2024-06-03 01:18:35] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:18:40] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:18:42] [INFO ] Deduced a trap composed of 112 places in 87 ms of which 1 ms to minimize.
[2024-06-03 01:18:43] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:18:46] [INFO ] Deduced a trap composed of 114 places in 88 ms of which 2 ms to minimize.
[2024-06-03 01:18:46] [INFO ] Deduced a trap composed of 111 places in 82 ms of which 2 ms to minimize.
[2024-06-03 01:18:46] [INFO ] Deduced a trap composed of 134 places in 88 ms of which 2 ms to minimize.
[2024-06-03 01:18:46] [INFO ] Deduced a trap composed of 140 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 8 (OVERLAPS) 565/763 variables, 198/223 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 12/235 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/764 variables, and 235 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (OVERLAPS) 1/198 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 6 (OVERLAPS) 565/763 variables, 198/223 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 12/235 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 586/821 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-03 01:19:16] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/764 variables, and 822 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 16/16 constraints]
After SMT, in 60582ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 60587ms
Finished structural reductions in LTL mode , in 1 iterations and 61099 ms. Remains : 198/198 places, 595/595 transitions.
Treatment of property FireWire-PT-20-LTLFireability-08 finished in 253702 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)))'
[2024-06-03 01:19:29] [INFO ] Flatten gal took : 33 ms
[2024-06-03 01:19:29] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-03 01:19:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 411 places, 688 transitions and 2123 arcs took 4 ms.
Total runtime 1968027 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 411
TRANSITIONS: 688
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 4079
MODEL NAME: /home/mcc/execution/414/model
411 places, 688 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-20-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-20-LTLFireability-06 CANNOT_COMPUTE
FORMULA FireWire-PT-20-LTLFireability-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717378129259

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

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

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-20, 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 r549-tall-171734898300324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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