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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.2K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 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 552K 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-6B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716695121097

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 03:45:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 03:45:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:45:22] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-26 03:45:22] [INFO ] Transformed 1544 places.
[2024-05-26 03:45:22] [INFO ] Transformed 2229 transitions.
[2024-05-26 03:45:22] [INFO ] Found NUPN structural information;
[2024-05-26 03:45:22] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-6B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Discarding 363 places :
Symmetric choice reduction at 0 with 363 rule applications. Total rules 363 place count 1181 transition count 1866
Iterating global reduction 0 with 363 rules applied. Total rules applied 726 place count 1181 transition count 1866
Discarding 106 places :
Symmetric choice reduction at 0 with 106 rule applications. Total rules 832 place count 1075 transition count 1660
Iterating global reduction 0 with 106 rules applied. Total rules applied 938 place count 1075 transition count 1660
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 1027 place count 986 transition count 1513
Iterating global reduction 0 with 89 rules applied. Total rules applied 1116 place count 986 transition count 1513
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1135 place count 967 transition count 1475
Iterating global reduction 0 with 19 rules applied. Total rules applied 1154 place count 967 transition count 1475
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1167 place count 954 transition count 1445
Iterating global reduction 0 with 13 rules applied. Total rules applied 1180 place count 954 transition count 1445
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 1192 place count 942 transition count 1433
Iterating global reduction 0 with 12 rules applied. Total rules applied 1204 place count 942 transition count 1433
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1207 place count 939 transition count 1427
Iterating global reduction 0 with 3 rules applied. Total rules applied 1210 place count 939 transition count 1427
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1213 place count 936 transition count 1421
Iterating global reduction 0 with 3 rules applied. Total rules applied 1216 place count 936 transition count 1421
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1219 place count 933 transition count 1418
Iterating global reduction 0 with 3 rules applied. Total rules applied 1222 place count 933 transition count 1418
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 1230 place count 933 transition count 1410
Applied a total of 1230 rules in 500 ms. Remains 933 /1544 variables (removed 611) and now considering 1410/2229 (removed 819) transitions.
// Phase 1: matrix 1410 rows 933 cols
[2024-05-26 03:45:23] [INFO ] Computed 66 invariants in 31 ms
[2024-05-26 03:45:24] [INFO ] Implicit Places using invariants in 803 ms returned []
[2024-05-26 03:45:24] [INFO ] Invariant cache hit.
[2024-05-26 03:45:25] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
Running 1409 sub problems to find dead transitions.
[2024-05-26 03:45:25] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1409 unsolved
SMT process timed out in 30686ms, After SMT, problems are : Problem set: 0 solved, 1409 unsolved
Search for dead transitions found 0 dead transitions in 30715ms
Starting structural reductions in LTL mode, iteration 1 : 933/1544 places, 1410/2229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33082 ms. Remains : 933/1544 places, 1410/2229 transitions.
Support contains 47 out of 933 places after structural reductions.
[2024-05-26 03:45:56] [INFO ] Flatten gal took : 188 ms
[2024-05-26 03:45:56] [INFO ] Flatten gal took : 161 ms
[2024-05-26 03:45:56] [INFO ] Input system was already deterministic with 1410 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (86 resets) in 2470 ms. (16 steps per ms) remains 3/33 properties
BEST_FIRST walk for 40003 steps (9 resets) in 218 ms. (182 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
[2024-05-26 03:45:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 65/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 866/933 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1410/2343 variables, 933/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2343 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2343 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2343/2343 variables, and 999 constraints, problems are : Problem set: 0 solved, 2 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 933/933 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 65/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 866/933 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1410/2343 variables, 933/999 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2343 variables, 2/1001 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 03:45:59] [INFO ] Deduced a trap composed of 47 places in 384 ms of which 67 ms to minimize.
[2024-05-26 03:45:59] [INFO ] Deduced a trap composed of 75 places in 256 ms of which 10 ms to minimize.
[2024-05-26 03:46:00] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2343 variables, 3/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2343 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2343 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2343/2343 variables, and 1004 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2228 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 933/933 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 3065ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 495 ms.
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 933 transition count 1371
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 894 transition count 1371
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 78 place count 894 transition count 1275
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 270 place count 798 transition count 1275
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 304 place count 764 transition count 1107
Iterating global reduction 2 with 34 rules applied. Total rules applied 338 place count 764 transition count 1107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 338 place count 764 transition count 1106
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 763 transition count 1106
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 346 place count 757 transition count 1089
Iterating global reduction 2 with 6 rules applied. Total rules applied 352 place count 757 transition count 1089
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 353 place count 757 transition count 1088
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 355 place count 755 transition count 1083
Iterating global reduction 3 with 2 rules applied. Total rules applied 357 place count 755 transition count 1083
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 1 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 713 place count 577 transition count 905
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 715 place count 575 transition count 901
Iterating global reduction 3 with 2 rules applied. Total rules applied 717 place count 575 transition count 901
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 718 place count 574 transition count 899
Iterating global reduction 3 with 1 rules applied. Total rules applied 719 place count 574 transition count 899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 921 place count 473 transition count 929
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 999 place count 434 transition count 951
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1023 place count 434 transition count 927
Free-agglomeration rule applied 23 times.
Iterating global reduction 3 with 23 rules applied. Total rules applied 1046 place count 434 transition count 904
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 1083 place count 411 transition count 890
Applied a total of 1083 rules in 331 ms. Remains 411 /933 variables (removed 522) and now considering 890/1410 (removed 520) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 331 ms. Remains : 411/933 places, 890/1410 transitions.
RANDOM walk for 34307 steps (229 resets) in 905 ms. (37 steps per ms) remains 0/2 properties
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||G(p1))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1389
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1389
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 913 transition count 1376
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 913 transition count 1376
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 906 transition count 1360
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 906 transition count 1360
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 902 transition count 1355
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 902 transition count 1355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 902 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 901 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 901 transition count 1353
Applied a total of 65 rules in 80 ms. Remains 901 /933 variables (removed 32) and now considering 1353/1410 (removed 57) transitions.
// Phase 1: matrix 1353 rows 901 cols
[2024-05-26 03:46:02] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 03:46:02] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-05-26 03:46:02] [INFO ] Invariant cache hit.
[2024-05-26 03:46:03] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
Running 1352 sub problems to find dead transitions.
[2024-05-26 03:46:03] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/900 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
SMT process timed out in 30582ms, After SMT, problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 30594ms
Starting structural reductions in LTL mode, iteration 1 : 901/933 places, 1353/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32134 ms. Remains : 901/933 places, 1353/1410 transitions.
Stuttering acceptance computed with spot in 349 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 56090 steps with 127 reset in 263 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-00 finished in 32819 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((X(F(p0))&&(p1||X(p2)))))'
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 914 transition count 1376
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 914 transition count 1376
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 909 transition count 1363
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 909 transition count 1363
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 905 transition count 1358
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 905 transition count 1358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 905 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 904 transition count 1356
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 904 transition count 1356
Applied a total of 59 rules in 87 ms. Remains 904 /933 variables (removed 29) and now considering 1356/1410 (removed 54) transitions.
// Phase 1: matrix 1356 rows 904 cols
[2024-05-26 03:46:35] [INFO ] Computed 66 invariants in 9 ms
[2024-05-26 03:46:35] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-26 03:46:35] [INFO ] Invariant cache hit.
[2024-05-26 03:46:36] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
Running 1355 sub problems to find dead transitions.
[2024-05-26 03:46:36] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1355 unsolved
SMT process timed out in 30379ms, After SMT, problems are : Problem set: 0 solved, 1355 unsolved
Search for dead transitions found 0 dead transitions in 30391ms
Starting structural reductions in LTL mode, iteration 1 : 904/933 places, 1356/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31751 ms. Remains : 904/933 places, 1356/1410 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-01
Product exploration explored 100000 steps with 1935 reset in 243 ms.
Stack based approach found an accepted trace after 2870 steps with 56 reset with depth 41 and stack size 41 in 9 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-01 finished in 32197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X((G(p1)&&F(p2)))))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 913 transition count 1375
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 913 transition count 1375
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 906 transition count 1359
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 906 transition count 1359
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 902 transition count 1354
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 902 transition count 1354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 902 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 901 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 901 transition count 1352
Applied a total of 65 rules in 94 ms. Remains 901 /933 variables (removed 32) and now considering 1352/1410 (removed 58) transitions.
// Phase 1: matrix 1352 rows 901 cols
[2024-05-26 03:47:07] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 03:47:07] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-26 03:47:07] [INFO ] Invariant cache hit.
[2024-05-26 03:47:08] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
Running 1351 sub problems to find dead transitions.
[2024-05-26 03:47:08] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/900 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
SMT process timed out in 30363ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 30377ms
Starting structural reductions in LTL mode, iteration 1 : 901/933 places, 1352/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31648 ms. Remains : 901/933 places, 1352/1410 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-02
Entered a terminal (fully accepting) state of product in 46301 steps with 104 reset in 141 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-02 finished in 32013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1&&G(F(p1)))))))'
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 78 place count 893 transition count 1275
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 268 place count 798 transition count 1275
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 301 place count 765 transition count 1109
Iterating global reduction 2 with 33 rules applied. Total rules applied 334 place count 765 transition count 1109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 334 place count 765 transition count 1108
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 336 place count 764 transition count 1108
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 341 place count 759 transition count 1093
Iterating global reduction 2 with 5 rules applied. Total rules applied 346 place count 759 transition count 1093
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 759 transition count 1092
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 349 place count 757 transition count 1087
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 757 transition count 1087
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 709 place count 578 transition count 908
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 711 place count 576 transition count 904
Iterating global reduction 3 with 2 rules applied. Total rules applied 713 place count 576 transition count 904
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 714 place count 575 transition count 902
Iterating global reduction 3 with 1 rules applied. Total rules applied 715 place count 575 transition count 902
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 917 place count 474 transition count 932
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 995 place count 435 transition count 947
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1019 place count 435 transition count 923
Applied a total of 1019 rules in 198 ms. Remains 435 /933 variables (removed 498) and now considering 923/1410 (removed 487) transitions.
// Phase 1: matrix 923 rows 435 cols
[2024-05-26 03:47:39] [INFO ] Computed 66 invariants in 13 ms
[2024-05-26 03:47:39] [INFO ] Implicit Places using invariants in 301 ms returned [10, 45, 93, 132, 193, 275, 325, 364, 413]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 304 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/933 places, 923/1410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 402 transition count 899
Applied a total of 48 rules in 20 ms. Remains 402 /426 variables (removed 24) and now considering 899/923 (removed 24) transitions.
// Phase 1: matrix 899 rows 402 cols
[2024-05-26 03:47:39] [INFO ] Computed 57 invariants in 10 ms
[2024-05-26 03:47:40] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-26 03:47:40] [INFO ] Invariant cache hit.
[2024-05-26 03:47:40] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:47:40] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/933 places, 899/1410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1403 ms. Remains : 402/933 places, 899/1410 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-03
Product exploration explored 100000 steps with 685 reset in 452 ms.
Product exploration explored 100000 steps with 691 reset in 455 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 128 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (272 resets) in 534 ms. (74 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
[2024-05-26 03:47:42] [INFO ] Invariant cache hit.
[2024-05-26 03:47:42] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/393 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 897/1290 variables, 393/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1290 variables, 53/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1290 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/1301 variables, 9/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1301 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1301 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1301 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1301/1301 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/393 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 897/1290 variables, 393/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1290 variables, 53/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1290 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1290 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/1301 variables, 9/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1301 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1301 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1301 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1301/1301 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 592ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 899/899 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 402 transition count 874
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 64 place count 377 transition count 860
Applied a total of 64 rules in 26 ms. Remains 377 /402 variables (removed 25) and now considering 860/899 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 377/402 places, 860/899 transitions.
RANDOM walk for 40000 steps (295 resets) in 282 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (12 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 392807 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 392807 steps, saw 102463 distinct states, run finished after 3017 ms. (steps per millisecond=130 ) properties seen :0
// Phase 1: matrix 860 rows 377 cols
[2024-05-26 03:47:45] [INFO ] Computed 57 invariants in 8 ms
[2024-05-26 03:47:45] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 344/370 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 860/1230 variables, 370/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1230 variables, 53/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1230 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/1237 variables, 7/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1237 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1237 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1237 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1237/1237 variables, and 487 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 377/377 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 344/370 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 860/1230 variables, 370/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1230 variables, 53/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1230 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1230 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/1237 variables, 7/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1237 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1237 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1237 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1237/1237 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 377/377 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 632ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 3 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 11 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 377/377 places, 860/860 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 10 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2024-05-26 03:47:46] [INFO ] Invariant cache hit.
[2024-05-26 03:47:46] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-26 03:47:46] [INFO ] Invariant cache hit.
[2024-05-26 03:47:47] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:47:47] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2024-05-26 03:47:47] [INFO ] Redundant transitions in 51 ms returned []
Running 852 sub problems to find dead transitions.
[2024-05-26 03:47:47] [INFO ] Invariant cache hit.
[2024-05-26 03:47:47] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 1/377 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-05-26 03:47:59] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-26 03:48:02] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 5 (OVERLAPS) 860/1237 variables, 377/436 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1237 variables, 53/489 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1237/1237 variables, and 489 constraints, problems are : Problem set: 0 solved, 852 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 377/377 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 1/377 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 5 (OVERLAPS) 860/1237 variables, 377/436 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1237 variables, 53/489 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1237 variables, 852/1341 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1237/1237 variables, and 1341 constraints, problems are : Problem set: 0 solved, 852 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 377/377 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 2/2 constraints]
After SMT, in 60585ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 60598ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61440 ms. Remains : 377/377 places, 860/860 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 377 transition count 848
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 377 transition count 848
Applied a total of 15 rules in 29 ms. Remains 377 /377 variables (removed 0) and now considering 848/860 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 848 rows 377 cols
[2024-05-26 03:48:48] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:48:48] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:48:48] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-26 03:48:48] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 03:48:48] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:48:48] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 651 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 899/899 transitions.
Applied a total of 0 rules in 13 ms. Remains 402 /402 variables (removed 0) and now considering 899/899 (removed 0) transitions.
// Phase 1: matrix 899 rows 402 cols
[2024-05-26 03:48:49] [INFO ] Computed 57 invariants in 9 ms
[2024-05-26 03:48:49] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-26 03:48:49] [INFO ] Invariant cache hit.
[2024-05-26 03:48:49] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:48:50] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2024-05-26 03:48:50] [INFO ] Redundant transitions in 11 ms returned []
Running 889 sub problems to find dead transitions.
[2024-05-26 03:48:50] [INFO ] Invariant cache hit.
[2024-05-26 03:48:50] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (OVERLAPS) 2/402 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 889 unsolved
[2024-05-26 03:49:02] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-26 03:49:06] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 4 (OVERLAPS) 899/1301 variables, 402/461 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1301 variables, 53/514 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1301/1301 variables, and 514 constraints, problems are : Problem set: 0 solved, 889 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 889/889 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 889 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (OVERLAPS) 2/402 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 4 (OVERLAPS) 899/1301 variables, 402/461 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1301 variables, 53/514 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1301 variables, 889/1403 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1301/1301 variables, and 1403 constraints, problems are : Problem set: 0 solved, 889 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 889/889 constraints, Known Traps: 2/2 constraints]
After SMT, in 60495ms problems are : Problem set: 0 solved, 889 unsolved
Search for dead transitions found 0 dead transitions in 60512ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61431 ms. Remains : 402/402 places, 899/899 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (275 resets) in 213 ms. (186 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (14 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2024-05-26 03:49:50] [INFO ] Invariant cache hit.
[2024-05-26 03:49:50] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/393 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 897/1290 variables, 393/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1290 variables, 53/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1290 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/1301 variables, 9/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1301 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1301 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1301 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1301/1301 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/393 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 897/1290 variables, 393/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1290 variables, 53/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1290 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1290 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/1301 variables, 9/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1301 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1301 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1301 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1301/1301 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 899/899 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 402 transition count 874
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 64 place count 377 transition count 860
Applied a total of 64 rules in 40 ms. Remains 377 /402 variables (removed 25) and now considering 860/899 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 377/402 places, 860/899 transitions.
RANDOM walk for 40000 steps (298 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (14 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 408229 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 408229 steps, saw 105094 distinct states, run finished after 3002 ms. (steps per millisecond=135 ) properties seen :0
// Phase 1: matrix 860 rows 377 cols
[2024-05-26 03:49:54] [INFO ] Computed 57 invariants in 12 ms
[2024-05-26 03:49:54] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 344/370 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 860/1230 variables, 370/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1230 variables, 53/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1230 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/1237 variables, 7/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1237 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1237 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1237 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1237/1237 variables, and 487 constraints, problems are : Problem set: 0 solved, 1 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 377/377 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 344/370 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 860/1230 variables, 370/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1230 variables, 53/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1230 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1230 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/1237 variables, 7/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1237 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1237 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1237 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1237/1237 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 377/377 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 770ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 10 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 377/377 places, 860/860 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 10 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2024-05-26 03:49:55] [INFO ] Invariant cache hit.
[2024-05-26 03:49:55] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-26 03:49:55] [INFO ] Invariant cache hit.
[2024-05-26 03:49:55] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:49:56] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2024-05-26 03:49:56] [INFO ] Redundant transitions in 10 ms returned []
Running 852 sub problems to find dead transitions.
[2024-05-26 03:49:56] [INFO ] Invariant cache hit.
[2024-05-26 03:49:56] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 1/377 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-05-26 03:50:08] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-26 03:50:10] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 5 (OVERLAPS) 860/1237 variables, 377/436 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/1237 variables, 53/489 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1237/1237 variables, and 489 constraints, problems are : Problem set: 0 solved, 852 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 377/377 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 1/377 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 5 (OVERLAPS) 860/1237 variables, 377/436 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1237 variables, 53/489 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1237 variables, 852/1341 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1237/1237 variables, and 1341 constraints, problems are : Problem set: 0 solved, 852 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 377/377 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 2/2 constraints]
After SMT, in 60466ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61263 ms. Remains : 377/377 places, 860/860 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 377 transition count 848
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 377 transition count 848
Applied a total of 15 rules in 28 ms. Remains 377 /377 variables (removed 0) and now considering 848/860 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 848 rows 377 cols
[2024-05-26 03:50:56] [INFO ] Computed 57 invariants in 8 ms
[2024-05-26 03:50:56] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:50:56] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 03:50:57] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 03:50:57] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:50:57] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 434 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 221 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 684 reset in 391 ms.
Product exploration explored 100000 steps with 683 reset in 423 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 899/899 transitions.
Applied a total of 0 rules in 11 ms. Remains 402 /402 variables (removed 0) and now considering 899/899 (removed 0) transitions.
// Phase 1: matrix 899 rows 402 cols
[2024-05-26 03:50:58] [INFO ] Computed 57 invariants in 10 ms
[2024-05-26 03:50:58] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-26 03:50:58] [INFO ] Invariant cache hit.
[2024-05-26 03:50:59] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:50:59] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2024-05-26 03:50:59] [INFO ] Redundant transitions in 13 ms returned []
Running 889 sub problems to find dead transitions.
[2024-05-26 03:50:59] [INFO ] Invariant cache hit.
[2024-05-26 03:50:59] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (OVERLAPS) 2/402 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 889 unsolved
[2024-05-26 03:51:12] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-26 03:51:15] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 4 (OVERLAPS) 899/1301 variables, 402/461 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1301 variables, 53/514 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1301/1301 variables, and 514 constraints, problems are : Problem set: 0 solved, 889 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 889/889 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 889 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 1 (OVERLAPS) 2/402 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 4 (OVERLAPS) 899/1301 variables, 402/461 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1301 variables, 53/514 constraints. Problems are: Problem set: 0 solved, 889 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1301 variables, 889/1403 constraints. Problems are: Problem set: 0 solved, 889 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1301/1301 variables, and 1403 constraints, problems are : Problem set: 0 solved, 889 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 402/402 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 889/889 constraints, Known Traps: 2/2 constraints]
After SMT, in 60454ms problems are : Problem set: 0 solved, 889 unsolved
Search for dead transitions found 0 dead transitions in 60461ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61339 ms. Remains : 402/402 places, 899/899 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-03 finished in 260716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&(p1 U (G(p1)||(p1&&G(!p2)))))))))'
Support contains 5 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1389
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1389
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 913 transition count 1376
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 913 transition count 1376
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 906 transition count 1360
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 906 transition count 1360
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 902 transition count 1355
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 902 transition count 1355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 902 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 901 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 901 transition count 1353
Applied a total of 65 rules in 81 ms. Remains 901 /933 variables (removed 32) and now considering 1353/1410 (removed 57) transitions.
// Phase 1: matrix 1353 rows 901 cols
[2024-05-26 03:52:00] [INFO ] Computed 66 invariants in 9 ms
[2024-05-26 03:52:00] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-26 03:52:00] [INFO ] Invariant cache hit.
[2024-05-26 03:52:01] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 1352 sub problems to find dead transitions.
[2024-05-26 03:52:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/900 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
SMT process timed out in 30339ms, After SMT, problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 30353ms
Starting structural reductions in LTL mode, iteration 1 : 901/933 places, 1353/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31543 ms. Remains : 901/933 places, 1353/1410 transitions.
Stuttering acceptance computed with spot in 407 ms :[true, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), p2, (NOT p1), (AND p0 p2), (AND p2 (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-04
Product exploration explored 100000 steps with 219 reset in 352 ms.
Product exploration explored 100000 steps with 223 reset in 372 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 125 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter sensitive) to 9 states, 35 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[true, p0, p0, (NOT p1), (AND p0 (NOT p1)), p2, (AND (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 p2)]
RANDOM walk for 40000 steps (86 resets) in 239 ms. (166 steps per ms) remains 5/19 properties
BEST_FIRST walk for 39163 steps (9 resets) in 214 ms. (182 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) (NOT p2) p1)))
Knowledge based reduction with 20 factoid took 161 ms. Reduced automaton from 9 states, 35 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6B-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6B-LTLFireability-04 finished in 33497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 78 place count 893 transition count 1275
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 268 place count 798 transition count 1275
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 299 place count 767 transition count 1117
Iterating global reduction 2 with 31 rules applied. Total rules applied 330 place count 767 transition count 1117
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 334 place count 763 transition count 1109
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 763 transition count 1109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 339 place count 763 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 340 place count 762 transition count 1106
Iterating global reduction 3 with 1 rules applied. Total rules applied 341 place count 762 transition count 1106
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 701 place count 582 transition count 926
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 703 place count 580 transition count 922
Iterating global reduction 3 with 2 rules applied. Total rules applied 705 place count 580 transition count 922
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 706 place count 579 transition count 920
Iterating global reduction 3 with 1 rules applied. Total rules applied 707 place count 579 transition count 920
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 909 place count 478 transition count 952
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 987 place count 439 transition count 968
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 1012 place count 439 transition count 943
Applied a total of 1012 rules in 166 ms. Remains 439 /933 variables (removed 494) and now considering 943/1410 (removed 467) transitions.
[2024-05-26 03:52:33] [INFO ] Flow matrix only has 941 transitions (discarded 2 similar events)
// Phase 1: matrix 941 rows 439 cols
[2024-05-26 03:52:33] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 03:52:33] [INFO ] Implicit Places using invariants in 245 ms returned [12, 47, 95, 134, 194, 274, 324, 365, 417]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 247 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 430/933 places, 943/1410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 406 transition count 919
Applied a total of 48 rules in 17 ms. Remains 406 /430 variables (removed 24) and now considering 919/943 (removed 24) transitions.
[2024-05-26 03:52:33] [INFO ] Flow matrix only has 917 transitions (discarded 2 similar events)
// Phase 1: matrix 917 rows 406 cols
[2024-05-26 03:52:33] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:52:34] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-26 03:52:34] [INFO ] Flow matrix only has 917 transitions (discarded 2 similar events)
[2024-05-26 03:52:34] [INFO ] Invariant cache hit.
[2024-05-26 03:52:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 03:52:34] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 406/933 places, 919/1410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1295 ms. Remains : 406/933 places, 919/1410 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-05
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-05 finished in 1430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(p1||G(p2)))))'
Support contains 5 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 914 transition count 1376
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 914 transition count 1376
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 907 transition count 1360
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 907 transition count 1360
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 903 transition count 1355
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 903 transition count 1355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 903 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 902 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 902 transition count 1353
Applied a total of 63 rules in 82 ms. Remains 902 /933 variables (removed 31) and now considering 1353/1410 (removed 57) transitions.
// Phase 1: matrix 1353 rows 902 cols
[2024-05-26 03:52:35] [INFO ] Computed 66 invariants in 11 ms
[2024-05-26 03:52:35] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-26 03:52:35] [INFO ] Invariant cache hit.
[2024-05-26 03:52:36] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
Running 1352 sub problems to find dead transitions.
[2024-05-26 03:52:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/901 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1352 unsolved
SMT process timed out in 30358ms, After SMT, problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 30371ms
Starting structural reductions in LTL mode, iteration 1 : 902/933 places, 1353/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31647 ms. Remains : 902/933 places, 1353/1410 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-06
Entered a terminal (fully accepting) state of product in 37309 steps with 89 reset in 90 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-06 finished in 31941 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 (F(p1)||(X(G(p3))&&p2))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 920 transition count 1387
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 920 transition count 1387
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 912 transition count 1374
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 912 transition count 1374
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 905 transition count 1358
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 905 transition count 1358
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 901 transition count 1353
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 901 transition count 1353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 901 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 900 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 900 transition count 1351
Applied a total of 67 rules in 82 ms. Remains 900 /933 variables (removed 33) and now considering 1351/1410 (removed 59) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2024-05-26 03:53:06] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 03:53:07] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-26 03:53:07] [INFO ] Invariant cache hit.
[2024-05-26 03:53:08] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
Running 1350 sub problems to find dead transitions.
[2024-05-26 03:53:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/899 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1350 unsolved
SMT process timed out in 30347ms, After SMT, problems are : Problem set: 0 solved, 1350 unsolved
Search for dead transitions found 0 dead transitions in 30360ms
Starting structural reductions in LTL mode, iteration 1 : 900/933 places, 1351/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31704 ms. Remains : 900/933 places, 1351/1410 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-07
Product exploration explored 100000 steps with 9345 reset in 169 ms.
Product exploration explored 100000 steps with 9387 reset in 243 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p3))), (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 31 factoid took 122 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p3))), (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 31 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
[2024-05-26 03:53:39] [INFO ] Invariant cache hit.
[2024-05-26 03:53:40] [INFO ] [Real]Absence check using 66 positive place invariants in 45 ms returned sat
[2024-05-26 03:53:43] [INFO ] [Real]Absence check using state equation in 3180 ms returned sat
[2024-05-26 03:53:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:53:44] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2024-05-26 03:53:47] [INFO ] [Nat]Absence check using state equation in 3460 ms returned sat
[2024-05-26 03:53:47] [INFO ] Computed and/alt/rep : 1289/3840/1289 causal constraints (skipped 61 transitions) in 80 ms.
Could not prove EG (NOT p1)
Support contains 1 out of 900 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 1351/1351 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 899 transition count 1323
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 872 transition count 1323
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 54 place count 872 transition count 1226
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 248 place count 775 transition count 1226
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 272 place count 751 transition count 1076
Iterating global reduction 2 with 24 rules applied. Total rules applied 296 place count 751 transition count 1076
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 646 place count 576 transition count 901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 848 place count 475 transition count 930
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 924 place count 437 transition count 943
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 948 place count 437 transition count 919
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 949 place count 436 transition count 918
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 950 place count 435 transition count 918
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 954 place count 433 transition count 916
Applied a total of 954 rules in 101 ms. Remains 433 /900 variables (removed 467) and now considering 916/1351 (removed 435) transitions.
// Phase 1: matrix 916 rows 433 cols
[2024-05-26 03:53:58] [INFO ] Computed 65 invariants in 8 ms
[2024-05-26 03:53:58] [INFO ] Implicit Places using invariants in 246 ms returned [11, 47, 95, 134, 194, 275, 325, 364]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 248 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/900 places, 916/1351 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 403 transition count 894
Applied a total of 44 rules in 14 ms. Remains 403 /425 variables (removed 22) and now considering 894/916 (removed 22) transitions.
// Phase 1: matrix 894 rows 403 cols
[2024-05-26 03:53:58] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:53:59] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-26 03:53:59] [INFO ] Invariant cache hit.
[2024-05-26 03:53:59] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 03:53:59] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 403/900 places, 894/1351 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1168 ms. Remains : 403/900 places, 894/1351 transitions.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 5 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
[2024-05-26 03:54:00] [INFO ] Invariant cache hit.
[2024-05-26 03:54:00] [INFO ] [Real]Absence check using 57 positive place invariants in 21 ms returned sat
[2024-05-26 03:54:01] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2024-05-26 03:54:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:54:01] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2024-05-26 03:54:01] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2024-05-26 03:54:02] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 03:54:02] [INFO ] [Nat]Added 51 Read/Feed constraints in 128 ms returned sat
[2024-05-26 03:54:02] [INFO ] Computed and/alt/rep : 590/4099/590 causal constraints (skipped 298 transitions) in 59 ms.
[2024-05-26 03:54:04] [INFO ] Added : 173 causal constraints over 35 iterations in 2163 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 40320 reset in 833 ms.
Product exploration explored 100000 steps with 40156 reset in 846 ms.
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 894/894 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 893
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 400 transition count 895
Applied a total of 6 rules in 19 ms. Remains 400 /403 variables (removed 3) and now considering 895/894 (removed -1) transitions.
// Phase 1: matrix 895 rows 400 cols
[2024-05-26 03:54:06] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:54:06] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-26 03:54:06] [INFO ] Invariant cache hit.
[2024-05-26 03:54:06] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 03:54:06] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2024-05-26 03:54:06] [INFO ] Redundant transitions in 14 ms returned []
Running 885 sub problems to find dead transitions.
[2024-05-26 03:54:06] [INFO ] Invariant cache hit.
[2024-05-26 03:54:06] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 2 (OVERLAPS) 2/400 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 885 unsolved
[2024-05-26 03:54:20] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 5 (OVERLAPS) 895/1295 variables, 400/458 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 51/509 constraints. Problems are: Problem set: 0 solved, 885 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 509 constraints, problems are : Problem set: 0 solved, 885 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 400/400 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 885/885 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 885 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 2 (OVERLAPS) 2/400 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 5 (OVERLAPS) 895/1295 variables, 400/458 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 51/509 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1295 variables, 885/1394 constraints. Problems are: Problem set: 0 solved, 885 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1394 constraints, problems are : Problem set: 0 solved, 885 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 400/400 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 885/885 constraints, Known Traps: 1/1 constraints]
After SMT, in 60474ms problems are : Problem set: 0 solved, 885 unsolved
Search for dead transitions found 0 dead transitions in 60482ms
Starting structural reductions in SI_LTL mode, iteration 1 : 400/403 places, 895/894 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61351 ms. Remains : 400/403 places, 895/894 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-07 finished in 120622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 78 place count 893 transition count 1274
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 270 place count 797 transition count 1274
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 303 place count 764 transition count 1108
Iterating global reduction 2 with 33 rules applied. Total rules applied 336 place count 764 transition count 1108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 336 place count 764 transition count 1107
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 763 transition count 1107
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 344 place count 757 transition count 1090
Iterating global reduction 2 with 6 rules applied. Total rules applied 350 place count 757 transition count 1090
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 351 place count 757 transition count 1089
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 353 place count 755 transition count 1084
Iterating global reduction 3 with 2 rules applied. Total rules applied 355 place count 755 transition count 1084
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 709 place count 578 transition count 907
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 711 place count 576 transition count 903
Iterating global reduction 3 with 2 rules applied. Total rules applied 713 place count 576 transition count 903
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 714 place count 575 transition count 901
Iterating global reduction 3 with 1 rules applied. Total rules applied 715 place count 575 transition count 901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 917 place count 474 transition count 931
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 991 place count 437 transition count 943
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1015 place count 437 transition count 919
Applied a total of 1015 rules in 147 ms. Remains 437 /933 variables (removed 496) and now considering 919/1410 (removed 491) transitions.
// Phase 1: matrix 919 rows 437 cols
[2024-05-26 03:55:07] [INFO ] Computed 66 invariants in 5 ms
[2024-05-26 03:55:07] [INFO ] Implicit Places using invariants in 257 ms returned [11, 46, 94, 134, 196, 276, 327, 366, 415]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 259 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 428/933 places, 919/1410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 404 transition count 895
Applied a total of 48 rules in 14 ms. Remains 404 /428 variables (removed 24) and now considering 895/919 (removed 24) transitions.
// Phase 1: matrix 895 rows 404 cols
[2024-05-26 03:55:07] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:55:08] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-26 03:55:08] [INFO ] Invariant cache hit.
[2024-05-26 03:55:08] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-26 03:55:08] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/933 places, 895/1410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1231 ms. Remains : 404/933 places, 895/1410 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-09
Stuttering criterion allowed to conclude after 201 steps with 1 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-09 finished in 1397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&G(p1)&&X(!p2)))))'
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 920 transition count 1387
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 920 transition count 1387
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 912 transition count 1374
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 912 transition count 1374
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 906 transition count 1364
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 906 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 903 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 903 transition count 1360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 903 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 902 transition count 1358
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 902 transition count 1358
Applied a total of 63 rules in 82 ms. Remains 902 /933 variables (removed 31) and now considering 1358/1410 (removed 52) transitions.
// Phase 1: matrix 1358 rows 902 cols
[2024-05-26 03:55:09] [INFO ] Computed 66 invariants in 9 ms
[2024-05-26 03:55:09] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-26 03:55:09] [INFO ] Invariant cache hit.
[2024-05-26 03:55:10] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
Running 1357 sub problems to find dead transitions.
[2024-05-26 03:55:10] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/901 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1357 unsolved
SMT process timed out in 30369ms, After SMT, problems are : Problem set: 0 solved, 1357 unsolved
Search for dead transitions found 0 dead transitions in 30380ms
Starting structural reductions in LTL mode, iteration 1 : 902/933 places, 1358/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31680 ms. Remains : 902/933 places, 1358/1410 transitions.
Stuttering acceptance computed with spot in 189 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-10
Product exploration explored 100000 steps with 245 reset in 296 ms.
Product exploration explored 100000 steps with 252 reset in 311 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 145 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
RANDOM walk for 40000 steps (85 resets) in 246 ms. (161 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (10 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
[2024-05-26 03:55:41] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/143 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 759/902 variables, 60/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 03:55:42] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/902 variables, 1/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1358/2260 variables, 902/969 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2260 variables, 0/969 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2260 variables, 0/969 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2260/2260 variables, and 969 constraints, problems are : Problem set: 1 solved, 1 unsolved in 614 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 902/902 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/122 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 780/902 variables, 62/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/902 variables, 1/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 03:55:42] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 1/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1358/2260 variables, 902/970 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2260 variables, 1/971 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2260 variables, 0/971 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2260 variables, 0/971 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2260/2260 variables, and 971 constraints, problems are : Problem set: 1 solved, 1 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 902/902 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1302ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 4 out of 902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 902/902 places, 1358/1358 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 902 transition count 1330
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 874 transition count 1330
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 56 place count 874 transition count 1235
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 246 place count 779 transition count 1235
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 269 place count 756 transition count 1087
Iterating global reduction 2 with 23 rules applied. Total rules applied 292 place count 756 transition count 1087
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 652 place count 576 transition count 907
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 854 place count 475 transition count 937
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 932 place count 436 transition count 957
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 958 place count 436 transition count 931
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 982 place count 436 transition count 907
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1018 place count 412 transition count 895
Applied a total of 1018 rules in 106 ms. Remains 412 /902 variables (removed 490) and now considering 895/1358 (removed 463) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 412/902 places, 895/1358 transitions.
RANDOM walk for 40000 steps (270 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 365957 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 365957 steps, saw 105377 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
// Phase 1: matrix 895 rows 412 cols
[2024-05-26 03:55:46] [INFO ] Computed 66 invariants in 11 ms
[2024-05-26 03:55:46] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 370/412 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 895/1307 variables, 412/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1307 variables, 54/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1307 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1307 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1307/1307 variables, and 532 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 412/412 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 370/412 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 895/1307 variables, 412/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1307 variables, 54/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1307 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1307 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1307 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1307/1307 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 412/412 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 590ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 792 steps, including 75 resets, run visited all 1 properties in 6 ms. (steps per millisecond=132 )
Parikh walk visited 1 properties in 10 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (G (OR (NOT p2) (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 (NOT p0)))), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 325 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 132 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 6 out of 902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 902/902 places, 1358/1358 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 901 transition count 1329
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 873 transition count 1329
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 56 place count 873 transition count 1234
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 246 place count 778 transition count 1234
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 269 place count 755 transition count 1086
Iterating global reduction 2 with 23 rules applied. Total rules applied 292 place count 755 transition count 1086
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 646 place count 578 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 848 place count 477 transition count 939
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 924 place count 439 transition count 959
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 950 place count 439 transition count 933
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 951 place count 438 transition count 932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 952 place count 437 transition count 932
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 956 place count 435 transition count 930
Applied a total of 956 rules in 115 ms. Remains 435 /902 variables (removed 467) and now considering 930/1358 (removed 428) transitions.
// Phase 1: matrix 930 rows 435 cols
[2024-05-26 03:55:47] [INFO ] Computed 65 invariants in 6 ms
[2024-05-26 03:55:48] [INFO ] Implicit Places using invariants in 232 ms returned [10, 45, 93, 132, 192, 272, 322, 363]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 233 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 427/902 places, 930/1358 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 405 transition count 908
Applied a total of 44 rules in 14 ms. Remains 405 /427 variables (removed 22) and now considering 908/930 (removed 22) transitions.
// Phase 1: matrix 908 rows 405 cols
[2024-05-26 03:55:48] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:55:48] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-26 03:55:48] [INFO ] Invariant cache hit.
[2024-05-26 03:55:48] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-26 03:55:48] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 405/902 places, 908/1358 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1205 ms. Remains : 405/902 places, 908/1358 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[p0, (AND (NOT p1) p0), p0]
RANDOM walk for 10630 steps (69 resets) in 80 ms. (131 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 117 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 128 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 682 reset in 413 ms.
Product exploration explored 100000 steps with 690 reset in 445 ms.
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 908/908 transitions.
Applied a total of 0 rules in 9 ms. Remains 405 /405 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2024-05-26 03:55:50] [INFO ] Invariant cache hit.
[2024-05-26 03:55:50] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-26 03:55:50] [INFO ] Invariant cache hit.
[2024-05-26 03:55:51] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-26 03:55:51] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2024-05-26 03:55:51] [INFO ] Redundant transitions in 11 ms returned []
Running 898 sub problems to find dead transitions.
[2024-05-26 03:55:51] [INFO ] Invariant cache hit.
[2024-05-26 03:55:51] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 03:56:04] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-26 03:56:04] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-26 03:56:05] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-26 03:56:08] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-26 03:56:08] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-26 03:56:09] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 898 unsolved
SMT process timed out in 30523ms, After SMT, problems are : Problem set: 0 solved, 898 unsolved
Search for dead transitions found 0 dead transitions in 30532ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31385 ms. Remains : 405/405 places, 908/908 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-10 finished in 73155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))||G(p1))))))'
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 914 transition count 1377
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 914 transition count 1377
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 907 transition count 1361
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 907 transition count 1361
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 903 transition count 1356
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 903 transition count 1356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 903 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 902 transition count 1354
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 902 transition count 1354
Applied a total of 63 rules in 84 ms. Remains 902 /933 variables (removed 31) and now considering 1354/1410 (removed 56) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2024-05-26 03:56:22] [INFO ] Computed 66 invariants in 8 ms
[2024-05-26 03:56:22] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-26 03:56:22] [INFO ] Invariant cache hit.
[2024-05-26 03:56:23] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
Running 1353 sub problems to find dead transitions.
[2024-05-26 03:56:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/901 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
SMT process timed out in 30363ms, After SMT, problems are : Problem set: 0 solved, 1353 unsolved
Search for dead transitions found 0 dead transitions in 30375ms
Starting structural reductions in LTL mode, iteration 1 : 902/933 places, 1354/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31659 ms. Remains : 902/933 places, 1354/1410 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-12
Product exploration explored 100000 steps with 224 reset in 260 ms.
Product exploration explored 100000 steps with 221 reset in 286 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 22207 steps (46 resets) in 189 ms. (116 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Applied a total of 0 rules in 19 ms. Remains 902 /902 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
[2024-05-26 03:56:55] [INFO ] Invariant cache hit.
[2024-05-26 03:56:56] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-26 03:56:56] [INFO ] Invariant cache hit.
[2024-05-26 03:56:56] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
Running 1353 sub problems to find dead transitions.
[2024-05-26 03:56:56] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/901 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
SMT process timed out in 30358ms, After SMT, problems are : Problem set: 0 solved, 1353 unsolved
Search for dead transitions found 0 dead transitions in 30385ms
Finished structural reductions in LTL mode , in 1 iterations and 31605 ms. Remains : 902/902 places, 1354/1354 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 28994 steps (61 resets) in 189 ms. (152 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 220 reset in 274 ms.
Product exploration explored 100000 steps with 226 reset in 296 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 902 transition count 1354
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 27 place count 902 transition count 1406
Deduced a syphon composed of 79 places in 3 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 79 place count 902 transition count 1406
Performed 222 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 301 places in 0 ms
Iterating global reduction 1 with 222 rules applied. Total rules applied 301 place count 902 transition count 1406
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 382 place count 821 transition count 1199
Deduced a syphon composed of 244 places in 0 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 463 place count 821 transition count 1199
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 487 place count 797 transition count 1175
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 511 place count 797 transition count 1175
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -308
Deduced a syphon composed of 321 places in 1 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 612 place count 797 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 613 place count 796 transition count 1481
Deduced a syphon composed of 320 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 614 place count 796 transition count 1481
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -113
Deduced a syphon composed of 358 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 652 place count 796 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 653 place count 795 transition count 1592
Deduced a syphon composed of 357 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 654 place count 795 transition count 1592
Deduced a syphon composed of 357 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 678 place count 795 transition count 1568
Deduced a syphon composed of 357 places in 1 ms
Applied a total of 678 rules in 251 ms. Remains 795 /902 variables (removed 107) and now considering 1568/1354 (removed -214) transitions.
[2024-05-26 03:57:30] [INFO ] Redundant transitions in 21 ms returned []
Running 1566 sub problems to find dead transitions.
// Phase 1: matrix 1568 rows 795 cols
[2024-05-26 03:57:30] [INFO ] Computed 66 invariants in 14 ms
[2024-05-26 03:57:30] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/794 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1566 unsolved
SMT process timed out in 31139ms, After SMT, problems are : Problem set: 0 solved, 1566 unsolved
Search for dead transitions found 0 dead transitions in 31152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 795/902 places, 1568/1354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31440 ms. Remains : 795/902 places, 1568/1354 transitions.
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Applied a total of 0 rules in 29 ms. Remains 902 /902 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2024-05-26 03:58:01] [INFO ] Computed 66 invariants in 9 ms
[2024-05-26 03:58:01] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-26 03:58:01] [INFO ] Invariant cache hit.
[2024-05-26 03:58:02] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
Running 1353 sub problems to find dead transitions.
[2024-05-26 03:58:02] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/901 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1353 unsolved
SMT process timed out in 30345ms, After SMT, problems are : Problem set: 0 solved, 1353 unsolved
Search for dead transitions found 0 dead transitions in 30358ms
Finished structural reductions in LTL mode , in 1 iterations and 31577 ms. Remains : 902/902 places, 1354/1354 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 130802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((F((!p0&&X(G(p1))))||G(p0))))))'
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 921 transition count 1388
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 921 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 914 transition count 1377
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 914 transition count 1377
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 908 transition count 1363
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 908 transition count 1363
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 905 transition count 1359
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 905 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 904 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 904 transition count 1358
Applied a total of 58 rules in 111 ms. Remains 904 /933 variables (removed 29) and now considering 1358/1410 (removed 52) transitions.
// Phase 1: matrix 1358 rows 904 cols
[2024-05-26 03:58:32] [INFO ] Computed 66 invariants in 10 ms
[2024-05-26 03:58:33] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-26 03:58:33] [INFO ] Invariant cache hit.
[2024-05-26 03:58:34] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
Running 1357 sub problems to find dead transitions.
[2024-05-26 03:58:34] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1357 unsolved
SMT process timed out in 30343ms, After SMT, problems are : Problem set: 0 solved, 1357 unsolved
Search for dead transitions found 0 dead transitions in 30356ms
Starting structural reductions in LTL mode, iteration 1 : 904/933 places, 1358/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31619 ms. Remains : 904/933 places, 1358/1410 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-13 finished in 31811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0||X(p1))))&&F(p2)))'
Support contains 5 out of 933 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 922 transition count 1390
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 922 transition count 1390
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 916 transition count 1380
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 916 transition count 1380
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 911 transition count 1368
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 911 transition count 1368
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 909 transition count 1366
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 909 transition count 1366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 909 transition count 1365
Applied a total of 49 rules in 73 ms. Remains 909 /933 variables (removed 24) and now considering 1365/1410 (removed 45) transitions.
// Phase 1: matrix 1365 rows 909 cols
[2024-05-26 03:59:04] [INFO ] Computed 66 invariants in 4 ms
[2024-05-26 03:59:05] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-26 03:59:05] [INFO ] Invariant cache hit.
[2024-05-26 03:59:06] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
Running 1364 sub problems to find dead transitions.
[2024-05-26 03:59:06] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/908 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1364 unsolved
SMT process timed out in 30321ms, After SMT, problems are : Problem set: 0 solved, 1364 unsolved
Search for dead transitions found 0 dead transitions in 30352ms
Starting structural reductions in LTL mode, iteration 1 : 909/933 places, 1365/1410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31864 ms. Remains : 909/933 places, 1365/1410 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-15
Stuttering criterion allowed to conclude after 370 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-15 finished in 32060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1&&G(F(p1)))))))'
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 (F(p1)||(X(G(p3))&&p2))))'
Found a Lengthening insensitive property : NoC3x3-PT-6B-LTLFireability-07
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 933 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 78 place count 893 transition count 1274
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 270 place count 797 transition count 1274
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 304 place count 763 transition count 1106
Iterating global reduction 2 with 34 rules applied. Total rules applied 338 place count 763 transition count 1106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 338 place count 763 transition count 1105
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 762 transition count 1105
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 346 place count 756 transition count 1088
Iterating global reduction 2 with 6 rules applied. Total rules applied 352 place count 756 transition count 1088
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 353 place count 756 transition count 1087
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 355 place count 754 transition count 1082
Iterating global reduction 3 with 2 rules applied. Total rules applied 357 place count 754 transition count 1082
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 350 rules applied. Total rules applied 707 place count 579 transition count 907
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 709 place count 577 transition count 903
Iterating global reduction 3 with 2 rules applied. Total rules applied 711 place count 577 transition count 903
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 712 place count 576 transition count 901
Iterating global reduction 3 with 1 rules applied. Total rules applied 713 place count 576 transition count 901
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 915 place count 475 transition count 930
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 991 place count 437 transition count 943
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 992 place count 436 transition count 942
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 993 place count 435 transition count 942
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 997 place count 433 transition count 940
Applied a total of 997 rules in 167 ms. Remains 433 /933 variables (removed 500) and now considering 940/1410 (removed 470) transitions.
// Phase 1: matrix 940 rows 433 cols
[2024-05-26 03:59:37] [INFO ] Computed 65 invariants in 8 ms
[2024-05-26 03:59:37] [INFO ] Implicit Places using invariants in 254 ms returned [11, 47, 95, 134, 194, 275, 325, 364]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 256 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 425/933 places, 940/1410 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 403 transition count 918
Applied a total of 44 rules in 13 ms. Remains 403 /425 variables (removed 22) and now considering 918/940 (removed 22) transitions.
// Phase 1: matrix 918 rows 403 cols
[2024-05-26 03:59:37] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:59:37] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-26 03:59:37] [INFO ] Invariant cache hit.
[2024-05-26 03:59:37] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-26 03:59:38] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 403/933 places, 918/1410 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1272 ms. Remains : 403/933 places, 918/1410 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-07
Product exploration explored 100000 steps with 40216 reset in 836 ms.
Product exploration explored 100000 steps with 40275 reset in 849 ms.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 676 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 5 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) (NOT p0) p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (F p1)]
Knowledge based reduction with 23 factoid took 710 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
[2024-05-26 03:59:41] [INFO ] Invariant cache hit.
[2024-05-26 03:59:42] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2024-05-26 03:59:42] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2024-05-26 03:59:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:59:43] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2024-05-26 03:59:43] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2024-05-26 03:59:43] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-26 03:59:43] [INFO ] [Nat]Added 63 Read/Feed constraints in 95 ms returned sat
[2024-05-26 03:59:43] [INFO ] Computed and/alt/rep : 602/4158/602 causal constraints (skipped 310 transitions) in 53 ms.
[2024-05-26 03:59:45] [INFO ] Added : 187 causal constraints over 38 iterations in 2208 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 403 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 918/918 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 403 transition count 894
Applied a total of 24 rules in 21 ms. Remains 403 /403 variables (removed 0) and now considering 894/918 (removed 24) transitions.
// Phase 1: matrix 894 rows 403 cols
[2024-05-26 03:59:45] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 03:59:46] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-26 03:59:46] [INFO ] Invariant cache hit.
[2024-05-26 03:59:46] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 03:59:46] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2024-05-26 03:59:46] [INFO ] Redundant transitions in 9 ms returned []
Running 888 sub problems to find dead transitions.
[2024-05-26 03:59:46] [INFO ] Invariant cache hit.
[2024-05-26 03:59:46] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (OVERLAPS) 2/403 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-26 04:00:00] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-26 04:00:00] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-26 04:00:00] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-26 04:00:00] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-26 04:00:00] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-26 04:00:00] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-26 04:00:00] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 888 unsolved
[2024-05-26 04:00:11] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/1297 variables, and 65 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/403 constraints, ReadFeed: 0/51 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 2 (OVERLAPS) 2/403 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 5 (OVERLAPS) 894/1297 variables, 403/468 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1297 variables, 51/519 constraints. Problems are: Problem set: 0 solved, 888 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1297 variables, 888/1407 constraints. Problems are: Problem set: 0 solved, 888 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1407 constraints, problems are : Problem set: 0 solved, 888 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 403/403 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 888/888 constraints, Known Traps: 8/8 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 888 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Starting structural reductions in SI_LTL mode, iteration 1 : 403/403 places, 894/918 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61286 ms. Remains : 403/403 places, 894/918 transitions.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 7 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
[2024-05-26 04:00:47] [INFO ] Invariant cache hit.
[2024-05-26 04:00:48] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2024-05-26 04:00:48] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2024-05-26 04:00:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:00:49] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2024-05-26 04:00:49] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-05-26 04:00:49] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 04:00:49] [INFO ] [Nat]Added 51 Read/Feed constraints in 117 ms returned sat
[2024-05-26 04:00:49] [INFO ] Computed and/alt/rep : 590/4099/590 causal constraints (skipped 298 transitions) in 52 ms.
[2024-05-26 04:00:51] [INFO ] Added : 148 causal constraints over 30 iterations in 1851 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 40195 reset in 824 ms.
Product exploration explored 100000 steps with 40261 reset in 828 ms.
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 894/894 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 893
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 400 transition count 895
Applied a total of 6 rules in 21 ms. Remains 400 /403 variables (removed 3) and now considering 895/894 (removed -1) transitions.
// Phase 1: matrix 895 rows 400 cols
[2024-05-26 04:00:53] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 04:00:53] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-26 04:00:53] [INFO ] Invariant cache hit.
[2024-05-26 04:00:53] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-26 04:00:54] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2024-05-26 04:00:54] [INFO ] Redundant transitions in 11 ms returned []
Running 885 sub problems to find dead transitions.
[2024-05-26 04:00:54] [INFO ] Invariant cache hit.
[2024-05-26 04:00:54] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 2 (OVERLAPS) 2/400 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 885 unsolved
[2024-05-26 04:01:07] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 5 (OVERLAPS) 895/1295 variables, 400/458 constraints. Problems are: Problem set: 0 solved, 885 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 51/509 constraints. Problems are: Problem set: 0 solved, 885 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1295/1295 variables, and 509 constraints, problems are : Problem set: 0 solved, 885 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 400/400 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 885/885 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 885 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 2 (OVERLAPS) 2/400 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 5 (OVERLAPS) 895/1295 variables, 400/458 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 51/509 constraints. Problems are: Problem set: 0 solved, 885 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1295 variables, 885/1394 constraints. Problems are: Problem set: 0 solved, 885 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1394 constraints, problems are : Problem set: 0 solved, 885 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 400/400 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 885/885 constraints, Known Traps: 1/1 constraints]
After SMT, in 60457ms problems are : Problem set: 0 solved, 885 unsolved
Search for dead transitions found 0 dead transitions in 60464ms
Starting structural reductions in SI_LTL mode, iteration 1 : 400/403 places, 895/894 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61297 ms. Remains : 400/403 places, 895/894 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-07 finished in 137725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&G(p1)&&X(!p2)))))'
Found a Shortening insensitive property : NoC3x3-PT-6B-LTLFireability-10
Stuttering acceptance computed with spot in 167 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Support contains 6 out of 933 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 78 place count 893 transition count 1276
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 266 place count 799 transition count 1276
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 299 place count 766 transition count 1113
Iterating global reduction 2 with 33 rules applied. Total rules applied 332 place count 766 transition count 1113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 332 place count 766 transition count 1112
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 334 place count 765 transition count 1112
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 340 place count 759 transition count 1095
Iterating global reduction 2 with 6 rules applied. Total rules applied 346 place count 759 transition count 1095
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 759 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 348 place count 758 transition count 1092
Iterating global reduction 3 with 1 rules applied. Total rules applied 349 place count 758 transition count 1092
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 703 place count 581 transition count 915
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 705 place count 579 transition count 911
Iterating global reduction 3 with 2 rules applied. Total rules applied 707 place count 579 transition count 911
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 708 place count 578 transition count 909
Iterating global reduction 3 with 1 rules applied. Total rules applied 709 place count 578 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 911 place count 477 transition count 939
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 987 place count 439 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 988 place count 438 transition count 958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 989 place count 437 transition count 958
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 993 place count 435 transition count 956
Applied a total of 993 rules in 148 ms. Remains 435 /933 variables (removed 498) and now considering 956/1410 (removed 454) transitions.
// Phase 1: matrix 956 rows 435 cols
[2024-05-26 04:01:54] [INFO ] Computed 65 invariants in 5 ms
[2024-05-26 04:01:55] [INFO ] Implicit Places using invariants in 246 ms returned [10, 45, 93, 132, 192, 272, 322, 363]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 247 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 427/933 places, 956/1410 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 405 transition count 934
Applied a total of 44 rules in 12 ms. Remains 405 /427 variables (removed 22) and now considering 934/956 (removed 22) transitions.
// Phase 1: matrix 934 rows 405 cols
[2024-05-26 04:01:55] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 04:01:55] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-26 04:01:55] [INFO ] Invariant cache hit.
[2024-05-26 04:01:55] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-26 04:01:56] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 405/933 places, 934/1410 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1232 ms. Remains : 405/933 places, 934/1410 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-10
Product exploration explored 100000 steps with 688 reset in 403 ms.
Product exploration explored 100000 steps with 710 reset in 433 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 126 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
RANDOM walk for 40000 steps (263 resets) in 193 ms. (206 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (15 resets) in 62 ms. (634 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
[2024-05-26 04:01:57] [INFO ] Invariant cache hit.
[2024-05-26 04:01:57] [INFO ] State equation strengthened by 65 read => feed constraints.
Problem apf5 is UNSAT
After SMT solving in domain Real declared 6/1339 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 0/57 constraints, State Equation: 0/405 constraints, ReadFeed: 0/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (G (OR (NOT p2) (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 (NOT p0)))), (F p2), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 280 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 110 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 934/934 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 405 transition count 908
Applied a total of 26 rules in 22 ms. Remains 405 /405 variables (removed 0) and now considering 908/934 (removed 26) transitions.
// Phase 1: matrix 908 rows 405 cols
[2024-05-26 04:01:57] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 04:01:58] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-26 04:01:58] [INFO ] Invariant cache hit.
[2024-05-26 04:01:58] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-26 04:01:58] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2024-05-26 04:01:58] [INFO ] Redundant transitions in 11 ms returned []
Running 898 sub problems to find dead transitions.
[2024-05-26 04:01:58] [INFO ] Invariant cache hit.
[2024-05-26 04:01:58] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 04:02:11] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-26 04:02:11] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2024-05-26 04:02:12] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-26 04:02:15] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 04:02:27] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/1313 variables, and 62 constraints, problems are : Problem set: 0 solved, 898 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/405 constraints, ReadFeed: 0/52 constraints, PredecessorRefiner: 898/898 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 3 (OVERLAPS) 2/405 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 6 (OVERLAPS) 908/1313 variables, 405/467 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1313 variables, 52/519 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1313 variables, 898/1417 constraints. Problems are: Problem set: 0 solved, 898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 1417 constraints, problems are : Problem set: 0 solved, 898 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 405/405 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 898/898 constraints, Known Traps: 5/5 constraints]
After SMT, in 60426ms problems are : Problem set: 0 solved, 898 unsolved
Search for dead transitions found 0 dead transitions in 60436ms
Starting structural reductions in SI_LTL mode, iteration 1 : 405/405 places, 908/934 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61296 ms. Remains : 405/405 places, 908/934 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[p0, (AND (NOT p1) p0), p0]
RANDOM walk for 9218 steps (62 resets) in 80 ms. (113 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 115 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 124 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 687 reset in 393 ms.
Product exploration explored 100000 steps with 691 reset in 429 ms.
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 908/908 transitions.
Applied a total of 0 rules in 17 ms. Remains 405 /405 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2024-05-26 04:03:00] [INFO ] Invariant cache hit.
[2024-05-26 04:03:01] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-26 04:03:01] [INFO ] Invariant cache hit.
[2024-05-26 04:03:01] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-26 04:03:01] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2024-05-26 04:03:01] [INFO ] Redundant transitions in 9 ms returned []
Running 898 sub problems to find dead transitions.
[2024-05-26 04:03:01] [INFO ] Invariant cache hit.
[2024-05-26 04:03:01] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 04:03:14] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-05-26 04:03:14] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-26 04:03:15] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-26 04:03:18] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 898 unsolved
[2024-05-26 04:03:30] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/1313 variables, and 62 constraints, problems are : Problem set: 0 solved, 898 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/405 constraints, ReadFeed: 0/52 constraints, PredecessorRefiner: 898/898 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 3 (OVERLAPS) 2/405 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 6 (OVERLAPS) 908/1313 variables, 405/467 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1313 variables, 52/519 constraints. Problems are: Problem set: 0 solved, 898 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1313 variables, 898/1417 constraints. Problems are: Problem set: 0 solved, 898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 1417 constraints, problems are : Problem set: 0 solved, 898 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 405/405 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 898/898 constraints, Known Traps: 5/5 constraints]
After SMT, in 60446ms problems are : Problem set: 0 solved, 898 unsolved
Search for dead transitions found 0 dead transitions in 60454ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61296 ms. Remains : 405/405 places, 908/908 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-10 finished in 127611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))||G(p1))))))'
Found a Lengthening insensitive property : NoC3x3-PT-6B-LTLFireability-12
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 933/933 places, 1410/1410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 932 transition count 1370
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 893 transition count 1370
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 78 place count 893 transition count 1275
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 268 place count 798 transition count 1275
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 301 place count 765 transition count 1108
Iterating global reduction 2 with 33 rules applied. Total rules applied 334 place count 765 transition count 1108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 334 place count 765 transition count 1107
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 336 place count 764 transition count 1107
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 341 place count 759 transition count 1092
Iterating global reduction 2 with 5 rules applied. Total rules applied 346 place count 759 transition count 1092
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 347 place count 759 transition count 1091
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 349 place count 757 transition count 1086
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 757 transition count 1086
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 705 place count 580 transition count 909
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 707 place count 578 transition count 905
Iterating global reduction 3 with 2 rules applied. Total rules applied 709 place count 578 transition count 905
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 710 place count 577 transition count 903
Iterating global reduction 3 with 1 rules applied. Total rules applied 711 place count 577 transition count 903
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 913 place count 476 transition count 933
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 991 place count 437 transition count 945
Applied a total of 991 rules in 134 ms. Remains 437 /933 variables (removed 496) and now considering 945/1410 (removed 465) transitions.
// Phase 1: matrix 945 rows 437 cols
[2024-05-26 04:04:02] [INFO ] Computed 66 invariants in 3 ms
[2024-05-26 04:04:03] [INFO ] Implicit Places using invariants in 457 ms returned [11, 46, 96, 136, 197, 277, 327, 366, 415]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 460 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 428/933 places, 945/1410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 404 transition count 921
Applied a total of 48 rules in 12 ms. Remains 404 /428 variables (removed 24) and now considering 921/945 (removed 24) transitions.
// Phase 1: matrix 921 rows 404 cols
[2024-05-26 04:04:03] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 04:04:03] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-26 04:04:03] [INFO ] Invariant cache hit.
[2024-05-26 04:04:03] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-26 04:04:03] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 404/933 places, 921/1410 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1506 ms. Remains : 404/933 places, 921/1410 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-12
Product exploration explored 100000 steps with 699 reset in 385 ms.
Product exploration explored 100000 steps with 679 reset in 393 ms.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 9888 steps (64 resets) in 73 ms. (133 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 921/921 transitions.
Applied a total of 0 rules in 3 ms. Remains 404 /404 variables (removed 0) and now considering 921/921 (removed 0) transitions.
[2024-05-26 04:04:05] [INFO ] Invariant cache hit.
[2024-05-26 04:04:05] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-26 04:04:05] [INFO ] Invariant cache hit.
[2024-05-26 04:04:06] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-26 04:04:06] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
Running 917 sub problems to find dead transitions.
[2024-05-26 04:04:06] [INFO ] Invariant cache hit.
[2024-05-26 04:04:06] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 1 (OVERLAPS) 2/404 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 917 unsolved
[2024-05-26 04:04:19] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-26 04:04:20] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
[2024-05-26 04:04:20] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2024-05-26 04:04:20] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2024-05-26 04:04:20] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-26 04:04:23] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 4 (OVERLAPS) 921/1325 variables, 404/467 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1325 variables, 65/532 constraints. Problems are: Problem set: 0 solved, 917 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 532 constraints, problems are : Problem set: 0 solved, 917 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 404/404 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 917/917 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 917 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 1 (OVERLAPS) 2/404 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 4 (OVERLAPS) 921/1325 variables, 404/467 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1325 variables, 65/532 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 917/1449 constraints. Problems are: Problem set: 0 solved, 917 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1449 constraints, problems are : Problem set: 0 solved, 917 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 404/404 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 917/917 constraints, Known Traps: 6/6 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 917 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Finished structural reductions in LTL mode , in 1 iterations and 61263 ms. Remains : 404/404 places, 921/921 transitions.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 9175 steps (60 resets) in 75 ms. (120 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 682 reset in 371 ms.
Product exploration explored 100000 steps with 677 reset in 395 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 921/921 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 404 transition count 897
Applied a total of 24 rules in 19 ms. Remains 404 /404 variables (removed 0) and now considering 897/921 (removed 24) transitions.
[2024-05-26 04:05:09] [INFO ] Redundant transitions in 7 ms returned []
Running 893 sub problems to find dead transitions.
// Phase 1: matrix 897 rows 404 cols
[2024-05-26 04:05:09] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 04:05:09] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 1 (OVERLAPS) 2/404 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 893 unsolved
[2024-05-26 04:05:21] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-26 04:05:22] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-26 04:05:22] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-26 04:05:22] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2024-05-26 04:05:23] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-26 04:05:23] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-26 04:05:25] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 4 (OVERLAPS) 897/1301 variables, 404/468 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1301 variables, 53/521 constraints. Problems are: Problem set: 0 solved, 893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1301/1301 variables, and 521 constraints, problems are : Problem set: 0 solved, 893 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 404/404 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 893/893 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 893 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 1 (OVERLAPS) 2/404 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 4 (OVERLAPS) 897/1301 variables, 404/468 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1301 variables, 53/521 constraints. Problems are: Problem set: 0 solved, 893 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1301 variables, 893/1414 constraints. Problems are: Problem set: 0 solved, 893 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1301/1301 variables, and 1414 constraints, problems are : Problem set: 0 solved, 893 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 404/404 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 893/893 constraints, Known Traps: 7/7 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 893 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Starting structural reductions in SI_LTL mode, iteration 1 : 404/404 places, 897/921 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60423 ms. Remains : 404/404 places, 897/921 transitions.
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 921/921 transitions.
Applied a total of 0 rules in 3 ms. Remains 404 /404 variables (removed 0) and now considering 921/921 (removed 0) transitions.
// Phase 1: matrix 921 rows 404 cols
[2024-05-26 04:06:09] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 04:06:09] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-26 04:06:09] [INFO ] Invariant cache hit.
[2024-05-26 04:06:10] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-26 04:06:10] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
Running 917 sub problems to find dead transitions.
[2024-05-26 04:06:10] [INFO ] Invariant cache hit.
[2024-05-26 04:06:10] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 1 (OVERLAPS) 2/404 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 917 unsolved
[2024-05-26 04:06:23] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2024-05-26 04:06:24] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-26 04:06:24] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2024-05-26 04:06:24] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-26 04:06:24] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 3 ms to minimize.
[2024-05-26 04:06:27] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 4 (OVERLAPS) 921/1325 variables, 404/467 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1325 variables, 65/532 constraints. Problems are: Problem set: 0 solved, 917 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 532 constraints, problems are : Problem set: 0 solved, 917 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 404/404 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 917/917 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 917 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 1 (OVERLAPS) 2/404 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 4 (OVERLAPS) 921/1325 variables, 404/467 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1325 variables, 65/532 constraints. Problems are: Problem set: 0 solved, 917 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 917/1449 constraints. Problems are: Problem set: 0 solved, 917 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1449 constraints, problems are : Problem set: 0 solved, 917 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 404/404 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 917/917 constraints, Known Traps: 6/6 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 917 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Finished structural reductions in LTL mode , in 1 iterations and 61375 ms. Remains : 404/404 places, 921/921 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 188882 ms.
[2024-05-26 04:07:11] [INFO ] Flatten gal took : 101 ms
[2024-05-26 04:07:11] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 13 ms.
[2024-05-26 04:07:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 933 places, 1410 transitions and 4435 arcs took 8 ms.
Total runtime 1308907 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NoC3x3-PT-6B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 933
TRANSITIONS: 1410
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 2863
MODEL NAME: /home/mcc/execution/413/model
933 places, 1410 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716697199639

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is NoC3x3-PT-6B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654350300644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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