About the Execution of GreatSPN+red for NoC3x3-PT-4A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3504.264 | 3600000.00 | 3716346.00 | 8158.50 | ?TFTTFFFTFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r245-tall-171654350300603.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 NoC3x3-PT-4A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350300603
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 07:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 07:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 144K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-4A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716687264209
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 01:34:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 01:34:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 01:34:25] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-05-26 01:34:25] [INFO ] Transformed 293 places.
[2024-05-26 01:34:25] [INFO ] Transformed 608 transitions.
[2024-05-26 01:34:25] [INFO ] Found NUPN structural information;
[2024-05-26 01:34:25] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
FORMULA NoC3x3-PT-4A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 242 transition count 370
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 242 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 142 place count 242 transition count 330
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 149 place count 235 transition count 330
Applied a total of 149 rules in 69 ms. Remains 235 /293 variables (removed 58) and now considering 330/453 (removed 123) transitions.
// Phase 1: matrix 330 rows 235 cols
[2024-05-26 01:34:25] [INFO ] Computed 59 invariants in 19 ms
[2024-05-26 01:34:26] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-26 01:34:26] [INFO ] Invariant cache hit.
[2024-05-26 01:34:26] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2024-05-26 01:34:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (OVERLAPS) 2/235 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (OVERLAPS) 330/565 variables, 235/294 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 0/565 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 294 constraints, problems are : Problem set: 0 solved, 329 unsolved in 13657 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (OVERLAPS) 2/235 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (OVERLAPS) 330/565 variables, 235/294 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 329/623 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 623 constraints, problems are : Problem set: 0 solved, 329 unsolved in 14802 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
After SMT, in 28596ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 28625ms
Starting structural reductions in LTL mode, iteration 1 : 235/293 places, 330/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29324 ms. Remains : 235/293 places, 330/453 transitions.
Support contains 26 out of 235 places after structural reductions.
[2024-05-26 01:34:55] [INFO ] Flatten gal took : 55 ms
[2024-05-26 01:34:55] [INFO ] Flatten gal took : 27 ms
[2024-05-26 01:34:55] [INFO ] Input system was already deterministic with 330 transitions.
Support contains 24 out of 235 places (down from 26) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1849 ms. (21 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
[2024-05-26 01:34:56] [INFO ] Invariant cache hit.
Problem AtomicPropp8 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 8/565 variables, and 3 constraints, problems are : Problem set: 2 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 3/59 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA NoC3x3-PT-4A-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA NoC3x3-PT-4A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 785 edges and 235 vertex of which 233 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U !X((X(p1) U p0))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 229 transition count 325
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 229 transition count 325
Applied a total of 11 rules in 12 ms. Remains 229 /235 variables (removed 6) and now considering 325/330 (removed 5) transitions.
// Phase 1: matrix 325 rows 229 cols
[2024-05-26 01:34:56] [INFO ] Computed 58 invariants in 9 ms
[2024-05-26 01:34:56] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-26 01:34:56] [INFO ] Invariant cache hit.
[2024-05-26 01:34:56] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-05-26 01:34:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 1/229 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 325/554 variables, 229/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 0/554 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 287 constraints, problems are : Problem set: 0 solved, 324 unsolved in 12641 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 1/229 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 325/554 variables, 229/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 324/611 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 0/554 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 611 constraints, problems are : Problem set: 0 solved, 324 unsolved in 13701 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
After SMT, in 26416ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 26420ms
Starting structural reductions in LTL mode, iteration 1 : 229/235 places, 325/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26731 ms. Remains : 229/235 places, 325/330 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-00
Product exploration explored 100000 steps with 33369 reset in 510 ms.
Product exploration explored 100000 steps with 33391 reset in 402 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 774 edges and 229 vertex of which 228 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/229 stabilizing places and 1/325 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 117 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 8106 steps (1 resets) in 145 ms. (55 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 202 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 325/325 transitions.
Applied a total of 0 rules in 7 ms. Remains 229 /229 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-26 01:35:25] [INFO ] Invariant cache hit.
[2024-05-26 01:35:25] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-26 01:35:25] [INFO ] Invariant cache hit.
[2024-05-26 01:35:25] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-05-26 01:35:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 1/229 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 325/554 variables, 229/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 0/554 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 287 constraints, problems are : Problem set: 0 solved, 324 unsolved in 12689 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 1/229 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 325/554 variables, 229/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 324/611 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 0/554 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 611 constraints, problems are : Problem set: 0 solved, 324 unsolved in 13851 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
After SMT, in 26605ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 26609ms
Finished structural reductions in LTL mode , in 1 iterations and 26885 ms. Remains : 229/229 places, 325/325 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 774 edges and 229 vertex of which 228 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/229 stabilizing places and 1/325 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 136 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 4512 steps (0 resets) in 50 ms. (88 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 33273 reset in 359 ms.
Product exploration explored 100000 steps with 33329 reset in 372 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 325/325 transitions.
Graph (trivial) has 137 edges and 229 vertex of which 73 / 229 are part of one of the 32 SCC in 7 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 188 transition count 243
Applied a total of 2 rules in 36 ms. Remains 188 /229 variables (removed 41) and now considering 243/325 (removed 82) transitions.
[2024-05-26 01:35:54] [INFO ] Redundant transitions in 9 ms returned []
Running 242 sub problems to find dead transitions.
[2024-05-26 01:35:54] [INFO ] Flow matrix only has 212 transitions (discarded 31 similar events)
// Phase 1: matrix 212 rows 188 cols
[2024-05-26 01:35:54] [INFO ] Computed 58 invariants in 1 ms
[2024-05-26 01:35:54] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 211/399 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 102/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 349 constraints, problems are : Problem set: 0 solved, 242 unsolved in 11881 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 188/188 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 211/399 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 102/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 242/590 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 1/400 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (OVERLAPS) 0/400 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 591 constraints, problems are : Problem set: 0 solved, 242 unsolved in 11921 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 188/188 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
After SMT, in 23850ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 23854ms
Starting structural reductions in SI_LTL mode, iteration 1 : 188/229 places, 243/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23907 ms. Remains : 188/229 places, 243/325 transitions.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 325/325 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 229 cols
[2024-05-26 01:36:18] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 01:36:18] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-26 01:36:18] [INFO ] Invariant cache hit.
[2024-05-26 01:36:18] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-05-26 01:36:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 1/229 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 325/554 variables, 229/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 0/554 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 287 constraints, problems are : Problem set: 0 solved, 324 unsolved in 12544 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 1/229 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 325/554 variables, 229/287 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 324/611 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 0/554 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 611 constraints, problems are : Problem set: 0 solved, 324 unsolved in 13892 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
After SMT, in 26511ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 26514ms
Finished structural reductions in LTL mode , in 1 iterations and 26805 ms. Remains : 229/229 places, 325/325 transitions.
Treatment of property NoC3x3-PT-4A-LTLCardinality-00 finished in 108633 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))))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 228 transition count 325
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 228 transition count 325
Applied a total of 12 rules in 9 ms. Remains 228 /235 variables (removed 7) and now considering 325/330 (removed 5) transitions.
// Phase 1: matrix 325 rows 228 cols
[2024-05-26 01:36:44] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 01:36:45] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-26 01:36:45] [INFO ] Invariant cache hit.
[2024-05-26 01:36:45] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-05-26 01:36:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 0/553 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 285 constraints, problems are : Problem set: 0 solved, 324 unsolved in 10024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (OVERLAPS) 325/553 variables, 228/285 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 324/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 609 constraints, problems are : Problem set: 0 solved, 324 unsolved in 12234 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
After SMT, in 22319ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 22329ms
Starting structural reductions in LTL mode, iteration 1 : 228/235 places, 325/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22620 ms. Remains : 228/235 places, 325/330 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 314 ms.
Product exploration explored 100000 steps with 33333 reset in 337 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-4A-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-4A-LTLCardinality-04 finished in 23475 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)||F(G(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Graph (trivial) has 137 edges and 235 vertex of which 72 / 235 are part of one of the 32 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 705 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 184 transition count 222
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 57 place count 164 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 160 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 160 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 90 place count 160 transition count 193
Applied a total of 90 rules in 22 ms. Remains 160 /235 variables (removed 75) and now considering 193/330 (removed 137) transitions.
// Phase 1: matrix 193 rows 160 cols
[2024-05-26 01:37:08] [INFO ] Computed 49 invariants in 1 ms
[2024-05-26 01:37:08] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-26 01:37:08] [INFO ] Invariant cache hit.
[2024-05-26 01:37:08] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-26 01:37:08] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-26 01:37:08] [INFO ] Redundant transitions in 86 ms returned []
Running 171 sub problems to find dead transitions.
[2024-05-26 01:37:08] [INFO ] Invariant cache hit.
[2024-05-26 01:37:08] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 192/352 variables, 160/209 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 56/265 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/352 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/353 variables, and 265 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5182 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 160/160 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 192/352 variables, 160/209 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 56/265 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 171/436 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/353 variables, and 436 constraints, problems are : Problem set: 0 solved, 171 unsolved in 4144 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 160/160 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
After SMT, in 9353ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 9355ms
Starting structural reductions in SI_LTL mode, iteration 1 : 160/235 places, 193/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9790 ms. Remains : 160/235 places, 193/330 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-05 finished in 9910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Graph (trivial) has 137 edges and 235 vertex of which 73 / 235 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 704 edges and 194 vertex of which 192 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 182 transition count 217
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 65 place count 159 transition count 217
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 69 place count 155 transition count 213
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 155 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 97 place count 155 transition count 189
Applied a total of 97 rules in 23 ms. Remains 155 /235 variables (removed 80) and now considering 189/330 (removed 141) transitions.
// Phase 1: matrix 189 rows 155 cols
[2024-05-26 01:37:18] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 01:37:18] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-26 01:37:18] [INFO ] Invariant cache hit.
[2024-05-26 01:37:18] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-26 01:37:18] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-26 01:37:18] [INFO ] Redundant transitions in 61 ms returned []
Running 164 sub problems to find dead transitions.
[2024-05-26 01:37:18] [INFO ] Invariant cache hit.
[2024-05-26 01:37:18] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 188/343 variables, 155/203 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 55/258 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 0/343 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/344 variables, and 258 constraints, problems are : Problem set: 0 solved, 164 unsolved in 3187 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 155/155 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 188/343 variables, 155/203 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 55/258 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 164/422 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/344 variables, and 422 constraints, problems are : Problem set: 0 solved, 164 unsolved in 3373 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 155/155 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 6616ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 6624ms
Starting structural reductions in SI_LTL mode, iteration 1 : 155/235 places, 189/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6930 ms. Remains : 155/235 places, 189/330 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-06 finished in 7031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 330
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 229 transition count 326
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 229 transition count 326
Applied a total of 10 rules in 5 ms. Remains 229 /235 variables (removed 6) and now considering 326/330 (removed 4) transitions.
// Phase 1: matrix 326 rows 229 cols
[2024-05-26 01:37:25] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 01:37:25] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-26 01:37:25] [INFO ] Invariant cache hit.
[2024-05-26 01:37:25] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 325 sub problems to find dead transitions.
[2024-05-26 01:37:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 0/555 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 286 constraints, problems are : Problem set: 0 solved, 325 unsolved in 9879 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 325 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 326/555 variables, 229/286 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 325/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 325 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 611 constraints, problems are : Problem set: 0 solved, 325 unsolved in 13448 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 325/325 constraints, Known Traps: 0/0 constraints]
After SMT, in 23406ms problems are : Problem set: 0 solved, 325 unsolved
Search for dead transitions found 0 dead transitions in 23409ms
Starting structural reductions in LTL mode, iteration 1 : 229/235 places, 326/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23754 ms. Remains : 229/235 places, 326/330 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 474 steps with 0 reset in 8 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-11 finished in 23920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Graph (trivial) has 133 edges and 235 vertex of which 70 / 235 are part of one of the 31 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Graph (complete) has 708 edges and 196 vertex of which 194 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 185 transition count 224
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 59 place count 164 transition count 224
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 159 transition count 219
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 159 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 95 place count 159 transition count 193
Applied a total of 95 rules in 20 ms. Remains 159 /235 variables (removed 76) and now considering 193/330 (removed 137) transitions.
// Phase 1: matrix 193 rows 159 cols
[2024-05-26 01:37:49] [INFO ] Computed 49 invariants in 2 ms
[2024-05-26 01:37:49] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-26 01:37:49] [INFO ] Invariant cache hit.
[2024-05-26 01:37:49] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-26 01:37:49] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-05-26 01:37:49] [INFO ] Redundant transitions in 56 ms returned []
Running 169 sub problems to find dead transitions.
[2024-05-26 01:37:49] [INFO ] Invariant cache hit.
[2024-05-26 01:37:49] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 192/351 variables, 159/208 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 54/262 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/351 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/352 variables, and 262 constraints, problems are : Problem set: 0 solved, 169 unsolved in 4970 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 159/159 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 192/351 variables, 159/208 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 54/262 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 169/431 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/351 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/352 variables, and 431 constraints, problems are : Problem set: 0 solved, 169 unsolved in 3962 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 159/159 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints]
After SMT, in 8962ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 8964ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/235 places, 193/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9273 ms. Remains : 159/235 places, 193/330 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-13 finished in 9334 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(((G(p0) U p1) U p2))))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Graph (trivial) has 136 edges and 235 vertex of which 73 / 235 are part of one of the 32 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 704 edges and 194 vertex of which 192 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 182 transition count 217
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 65 place count 159 transition count 217
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 156 transition count 214
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 156 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 94 place count 156 transition count 191
Applied a total of 94 rules in 16 ms. Remains 156 /235 variables (removed 79) and now considering 191/330 (removed 139) transitions.
// Phase 1: matrix 191 rows 156 cols
[2024-05-26 01:37:58] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 01:37:58] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-26 01:37:58] [INFO ] Invariant cache hit.
[2024-05-26 01:37:58] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-26 01:37:58] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-26 01:37:58] [INFO ] Redundant transitions in 59 ms returned []
Running 166 sub problems to find dead transitions.
[2024-05-26 01:37:58] [INFO ] Invariant cache hit.
[2024-05-26 01:37:58] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 190/346 variables, 156/204 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 55/259 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/346 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/347 variables, and 259 constraints, problems are : Problem set: 0 solved, 166 unsolved in 3402 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 156/156 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 190/346 variables, 156/204 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 55/259 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 166/425 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/346 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/347 variables, and 425 constraints, problems are : Problem set: 0 solved, 166 unsolved in 3593 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 156/156 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 7020ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 7022ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/235 places, 191/330 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7330 ms. Remains : 156/235 places, 191/330 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-14
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-4A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLCardinality-14 finished in 7581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U !X((X(p1) U p0))))'
Found a Lengthening insensitive property : NoC3x3-PT-4A-LTLCardinality-00
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 235/235 places, 330/330 transitions.
Graph (trivial) has 137 edges and 235 vertex of which 73 / 235 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 704 edges and 194 vertex of which 193 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 188 transition count 244
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 188 transition count 244
Applied a total of 12 rules in 14 ms. Remains 188 /235 variables (removed 47) and now considering 244/330 (removed 86) transitions.
[2024-05-26 01:38:06] [INFO ] Flow matrix only has 213 transitions (discarded 31 similar events)
// Phase 1: matrix 213 rows 188 cols
[2024-05-26 01:38:06] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 01:38:06] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-26 01:38:06] [INFO ] Flow matrix only has 213 transitions (discarded 31 similar events)
[2024-05-26 01:38:06] [INFO ] Invariant cache hit.
[2024-05-26 01:38:06] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-26 01:38:06] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-26 01:38:06] [INFO ] Flow matrix only has 213 transitions (discarded 31 similar events)
[2024-05-26 01:38:06] [INFO ] Invariant cache hit.
[2024-05-26 01:38:06] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 212/400 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 102/348 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 1/401 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 349 constraints, problems are : Problem set: 0 solved, 243 unsolved in 12207 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 188/188 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 212/400 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 102/348 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 243/591 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 1/401 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 0/401 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 592 constraints, problems are : Problem set: 0 solved, 243 unsolved in 11442 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 188/188 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints]
After SMT, in 23695ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 23700ms
Starting structural reductions in LI_LTL mode, iteration 1 : 188/235 places, 244/330 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 24041 ms. Remains : 188/235 places, 244/330 transitions.
Running random walk in product with property : NoC3x3-PT-4A-LTLCardinality-00
Product exploration explored 100000 steps with 33467 reset in 428 ms.
Product exploration explored 100000 steps with 33438 reset in 381 ms.
Computed a total of 11 stabilizing places and 1 stable transitions
Graph (complete) has 693 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 1 stable transitions
Detected a total of 11/188 stabilizing places and 1/244 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 129 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 301 steps (0 resets) in 18 ms. (15 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 244/244 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 244/244 (removed 0) transitions.
[2024-05-26 01:38:32] [INFO ] Flow matrix only has 213 transitions (discarded 31 similar events)
[2024-05-26 01:38:32] [INFO ] Invariant cache hit.
[2024-05-26 01:38:32] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-26 01:38:32] [INFO ] Flow matrix only has 213 transitions (discarded 31 similar events)
[2024-05-26 01:38:32] [INFO ] Invariant cache hit.
[2024-05-26 01:38:32] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-26 01:38:32] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-26 01:38:32] [INFO ] Flow matrix only has 213 transitions (discarded 31 similar events)
[2024-05-26 01:38:32] [INFO ] Invariant cache hit.
[2024-05-26 01:38:32] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 212/400 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 102/348 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 1/401 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 349 constraints, problems are : Problem set: 0 solved, 243 unsolved in 12080 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 188/188 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 212/400 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 102/348 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 243/591 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 1/401 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 0/401 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 592 constraints, problems are : Problem set: 0 solved, 243 unsolved in 11255 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 188/188 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints]
After SMT, in 23372ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 23375ms
Finished structural reductions in LTL mode , in 1 iterations and 23742 ms. Remains : 188/188 places, 244/244 transitions.
Computed a total of 11 stabilizing places and 1 stable transitions
Graph (complete) has 693 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 1 stable transitions
Detected a total of 11/188 stabilizing places and 1/244 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 134 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 770 steps (0 resets) in 28 ms. (26 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 269 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 33318 reset in 331 ms.
Product exploration explored 100000 steps with 33466 reset in 351 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 244/244 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 188 transition count 243
Applied a total of 1 rules in 26 ms. Remains 188 /188 variables (removed 0) and now considering 243/244 (removed 1) transitions.
[2024-05-26 01:38:57] [INFO ] Redundant transitions in 1 ms returned []
Running 242 sub problems to find dead transitions.
[2024-05-26 01:38:57] [INFO ] Flow matrix only has 212 transitions (discarded 31 similar events)
// Phase 1: matrix 212 rows 188 cols
[2024-05-26 01:38:57] [INFO ] Computed 58 invariants in 1 ms
[2024-05-26 01:38:57] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 211/399 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 102/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 349 constraints, problems are : Problem set: 0 solved, 242 unsolved in 11672 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 188/188 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 211/399 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 102/348 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 242/590 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 1/400 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 11 (OVERLAPS) 0/400 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 591 constraints, problems are : Problem set: 0 solved, 242 unsolved in 11972 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 188/188 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
After SMT, in 23681ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 23685ms
Starting structural reductions in SI_LTL mode, iteration 1 : 188/188 places, 243/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23724 ms. Remains : 188/188 places, 243/244 transitions.
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 244/244 transitions.
Applied a total of 0 rules in 4 ms. Remains 188 /188 variables (removed 0) and now considering 244/244 (removed 0) transitions.
[2024-05-26 01:39:21] [INFO ] Flow matrix only has 213 transitions (discarded 31 similar events)
// Phase 1: matrix 213 rows 188 cols
[2024-05-26 01:39:21] [INFO ] Computed 58 invariants in 1 ms
[2024-05-26 01:39:21] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-26 01:39:21] [INFO ] Flow matrix only has 213 transitions (discarded 31 similar events)
[2024-05-26 01:39:21] [INFO ] Invariant cache hit.
[2024-05-26 01:39:21] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-26 01:39:21] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 243 sub problems to find dead transitions.
[2024-05-26 01:39:21] [INFO ] Flow matrix only has 213 transitions (discarded 31 similar events)
[2024-05-26 01:39:21] [INFO ] Invariant cache hit.
[2024-05-26 01:39:21] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 212/400 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 102/348 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 1/401 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 349 constraints, problems are : Problem set: 0 solved, 243 unsolved in 11548 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 188/188 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 212/400 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 102/348 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 243/591 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 9 (OVERLAPS) 1/401 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 11 (OVERLAPS) 0/401 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 592 constraints, problems are : Problem set: 0 solved, 243 unsolved in 11251 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 188/188 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 0/0 constraints]
After SMT, in 22836ms problems are : Problem set: 0 solved, 243 unsolved
Search for dead transitions found 0 dead transitions in 22841ms
Finished structural reductions in LTL mode , in 1 iterations and 23182 ms. Remains : 188/188 places, 244/244 transitions.
Treatment of property NoC3x3-PT-4A-LTLCardinality-00 finished in 98607 ms.
[2024-05-26 01:39:44] [INFO ] Flatten gal took : 19 ms
[2024-05-26 01:39:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-26 01:39:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 235 places, 330 transitions and 1096 arcs took 7 ms.
Total runtime 319466 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running NoC3x3-PT-4A
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 235
TRANSITIONS: 330
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.004s]
SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 1179
MODEL NAME: /home/mcc/execution/410/model
235 places, 330 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...
BK_TIME_CONFINEMENT_REACHED
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-4A"
export BK_EXAMINATION="LTLCardinality"
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 NoC3x3-PT-4A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654350300603"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-4A.tgz
mv NoC3x3-PT-4A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;