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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K 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 54K 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.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 608K 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-4B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716689759077

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-4B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 02:16:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 02:16:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:16:00] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-26 02:16:00] [INFO ] Transformed 2328 places.
[2024-05-26 02:16:00] [INFO ] Transformed 2701 transitions.
[2024-05-26 02:16:00] [INFO ] Found NUPN structural information;
[2024-05-26 02:16:00] [INFO ] Parsed PT model containing 2328 places and 2701 transitions and 6091 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-4B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Discarding 609 places :
Symmetric choice reduction at 0 with 609 rule applications. Total rules 609 place count 1719 transition count 2092
Iterating global reduction 0 with 609 rules applied. Total rules applied 1218 place count 1719 transition count 2092
Discarding 308 places :
Symmetric choice reduction at 0 with 308 rule applications. Total rules 1526 place count 1411 transition count 1784
Iterating global reduction 0 with 308 rules applied. Total rules applied 1834 place count 1411 transition count 1784
Ensure Unique test removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 0 with 109 rules applied. Total rules applied 1943 place count 1411 transition count 1675
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 1975 place count 1379 transition count 1643
Iterating global reduction 1 with 32 rules applied. Total rules applied 2007 place count 1379 transition count 1643
Applied a total of 2007 rules in 745 ms. Remains 1379 /2328 variables (removed 949) and now considering 1643/2701 (removed 1058) transitions.
// Phase 1: matrix 1643 rows 1379 cols
[2024-05-26 02:16:01] [INFO ] Computed 66 invariants in 31 ms
[2024-05-26 02:16:02] [INFO ] Implicit Places using invariants in 677 ms returned []
[2024-05-26 02:16:02] [INFO ] Invariant cache hit.
[2024-05-26 02:16:03] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 1917 ms to find 0 implicit places.
Running 1642 sub problems to find dead transitions.
[2024-05-26 02:16:03] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1378/3022 variables, and 0 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1378 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1379/3022 variables, and 66 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 0/0 constraints]
After SMT, in 60622ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 60656ms
Starting structural reductions in LTL mode, iteration 1 : 1379/2328 places, 1643/2701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63347 ms. Remains : 1379/2328 places, 1643/2701 transitions.
Support contains 28 out of 1379 places after structural reductions.
[2024-05-26 02:17:04] [INFO ] Flatten gal took : 136 ms
[2024-05-26 02:17:04] [INFO ] Flatten gal took : 68 ms
[2024-05-26 02:17:04] [INFO ] Input system was already deterministic with 1643 transitions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (27 resets) in 1495 ms. (26 steps per ms) remains 3/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
[2024-05-26 02:17:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 225/230 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1149/1379 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1379 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1643/3022 variables, 1379/1445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3022 variables, 0/1445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3022 variables, 0/1445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3022/3022 variables, and 1445 constraints, problems are : Problem set: 0 solved, 3 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1379/1379 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 225/230 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1149/1379 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1379 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1643/3022 variables, 1379/1445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3022 variables, 3/1448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3022 variables, 0/1448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/3022 variables, 0/1448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3022/3022 variables, and 1448 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1273 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1379/1379 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2086ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 514 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=57 )
Parikh walk visited 3 properties in 14 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NoC3x3-PT-4B-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NoC3x3-PT-4B-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(F(p0))'
Support contains 1 out of 1379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1379/1379 places, 1643/1643 transitions.
Graph (trivial) has 1290 edges and 1379 vertex of which 857 / 1379 are part of one of the 33 SCC in 4 ms
Free SCC test removed 824 places
Ensure Unique test removed 965 transitions
Reduce isomorphic transitions removed 965 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 554 transition count 671
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 548 transition count 670
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 547 transition count 670
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 15 place count 547 transition count 633
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 89 place count 510 transition count 633
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 117 place count 482 transition count 571
Iterating global reduction 3 with 28 rules applied. Total rules applied 145 place count 482 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 145 place count 482 transition count 570
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 481 transition count 570
Performed 99 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 345 place count 382 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 346 place count 382 transition count 469
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 348 place count 381 transition count 477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 349 place count 381 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 350 place count 380 transition count 475
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 261 edges and 371 vertex of which 46 / 371 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Iterating post reduction 5 with 10 rules applied. Total rules applied 360 place count 348 transition count 475
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 6 with 46 rules applied. Total rules applied 406 place count 348 transition count 429
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 7 with 2 rules applied. Total rules applied 408 place count 347 transition count 428
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 412 place count 347 transition count 424
Applied a total of 412 rules in 280 ms. Remains 347 /1379 variables (removed 1032) and now considering 424/1643 (removed 1219) transitions.
[2024-05-26 02:17:08] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
// Phase 1: matrix 392 rows 347 cols
[2024-05-26 02:17:08] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:17:08] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-26 02:17:08] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2024-05-26 02:17:08] [INFO ] Invariant cache hit.
[2024-05-26 02:17:08] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-26 02:17:08] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-05-26 02:17:08] [INFO ] Redundant transitions in 20 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-26 02:17:08] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2024-05-26 02:17:08] [INFO ] Invariant cache hit.
[2024-05-26 02:17:08] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 33/347 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 391/738 variables, 347/404 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/738 variables, 16/420 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/738 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 0/738 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 738/739 variables, and 420 constraints, problems are : Problem set: 0 solved, 210 unsolved in 10700 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 347/347 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 33/347 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 391/738 variables, 347/404 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/738 variables, 16/420 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/738 variables, 210/630 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/738 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/738 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 738/739 variables, and 630 constraints, problems are : Problem set: 0 solved, 210 unsolved in 10297 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 347/347 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
After SMT, in 21043ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 21047ms
Starting structural reductions in SI_LTL mode, iteration 1 : 347/1379 places, 424/1643 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21867 ms. Remains : 347/1379 places, 424/1643 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-02 finished in 22075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1379/1379 places, 1643/1643 transitions.
Graph (trivial) has 1293 edges and 1379 vertex of which 869 / 1379 are part of one of the 33 SCC in 1 ms
Free SCC test removed 836 places
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 1 place count 542 transition count 625
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 75 place count 505 transition count 625
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 102 place count 478 transition count 564
Iterating global reduction 0 with 27 rules applied. Total rules applied 129 place count 478 transition count 564
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 325 place count 380 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 326 place count 379 transition count 465
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 370 vertex of which 48 / 370 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 336 place count 346 transition count 465
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 384 place count 346 transition count 417
Applied a total of 384 rules in 109 ms. Remains 346 /1379 variables (removed 1033) and now considering 417/1643 (removed 1226) transitions.
[2024-05-26 02:17:29] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
// Phase 1: matrix 385 rows 346 cols
[2024-05-26 02:17:29] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 02:17:30] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-26 02:17:30] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2024-05-26 02:17:30] [INFO ] Invariant cache hit.
[2024-05-26 02:17:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 02:17:30] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2024-05-26 02:17:30] [INFO ] Redundant transitions in 5 ms returned []
Running 199 sub problems to find dead transitions.
[2024-05-26 02:17:30] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2024-05-26 02:17:30] [INFO ] Invariant cache hit.
[2024-05-26 02:17:30] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 33/346 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 384/730 variables, 346/403 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/730 variables, 14/417 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/730 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 730/731 variables, and 417 constraints, problems are : Problem set: 0 solved, 199 unsolved in 9572 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 346/346 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 33/346 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 384/730 variables, 346/403 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/730 variables, 14/417 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 199/616 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/730 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/730 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 730/731 variables, and 616 constraints, problems are : Problem set: 0 solved, 199 unsolved in 9526 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 346/346 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
After SMT, in 19126ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 19128ms
Starting structural reductions in SI_LTL mode, iteration 1 : 346/1379 places, 417/1643 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19706 ms. Remains : 346/1379 places, 417/1643 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-03 finished in 19768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1379/1379 places, 1643/1643 transitions.
Graph (trivial) has 1290 edges and 1379 vertex of which 867 / 1379 are part of one of the 33 SCC in 3 ms
Free SCC test removed 834 places
Ensure Unique test removed 978 transitions
Reduce isomorphic transitions removed 978 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 544 transition count 663
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 543 transition count 663
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 3 place count 543 transition count 626
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 77 place count 506 transition count 626
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 104 place count 479 transition count 565
Iterating global reduction 2 with 27 rules applied. Total rules applied 131 place count 479 transition count 565
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 327 place count 381 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 380 transition count 466
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 263 edges and 371 vertex of which 46 / 371 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 339 place count 348 transition count 465
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 387 place count 347 transition count 418
Applied a total of 387 rules in 81 ms. Remains 347 /1379 variables (removed 1032) and now considering 418/1643 (removed 1225) transitions.
[2024-05-26 02:17:49] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2024-05-26 02:17:49] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 02:17:49] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-26 02:17:49] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
[2024-05-26 02:17:49] [INFO ] Invariant cache hit.
[2024-05-26 02:17:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 02:17:50] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-05-26 02:17:50] [INFO ] Redundant transitions in 3 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-26 02:17:50] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
[2024-05-26 02:17:50] [INFO ] Invariant cache hit.
[2024-05-26 02:17:50] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 33/347 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 385/732 variables, 347/404 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/732 variables, 14/418 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/732 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 732/733 variables, and 418 constraints, problems are : Problem set: 0 solved, 202 unsolved in 9597 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 347/347 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 33/347 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 385/732 variables, 347/404 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/732 variables, 14/418 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 202/620 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/732 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 732/733 variables, and 620 constraints, problems are : Problem set: 0 solved, 202 unsolved in 9679 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 347/347 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 19304ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 19307ms
Starting structural reductions in SI_LTL mode, iteration 1 : 347/1379 places, 418/1643 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19963 ms. Remains : 347/1379 places, 418/1643 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-04 finished in 20043 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(p2)&&p1))))'
Support contains 3 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 1643/1643 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1368 transition count 1632
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1368 transition count 1632
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1368 transition count 1630
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 1365 transition count 1627
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 1365 transition count 1627
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 1365 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 1364 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 1364 transition count 1624
Applied a total of 34 rules in 140 ms. Remains 1364 /1379 variables (removed 15) and now considering 1624/1643 (removed 19) transitions.
// Phase 1: matrix 1624 rows 1364 cols
[2024-05-26 02:18:09] [INFO ] Computed 66 invariants in 15 ms
[2024-05-26 02:18:10] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-26 02:18:10] [INFO ] Invariant cache hit.
[2024-05-26 02:18:11] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
Running 1623 sub problems to find dead transitions.
[2024-05-26 02:18:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1623 unsolved
SMT process timed out in 30335ms, After SMT, problems are : Problem set: 0 solved, 1623 unsolved
Search for dead transitions found 0 dead transitions in 30350ms
Starting structural reductions in LTL mode, iteration 1 : 1364/1379 places, 1624/1643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31810 ms. Remains : 1364/1379 places, 1624/1643 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-05
Stuttering criterion allowed to conclude after 1408 steps with 0 reset in 21 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-05 finished in 31951 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 (p1||F(p2))) U (p3||X(X(G(p0))))))'
Support contains 4 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 1643/1643 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1369 transition count 1633
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1369 transition count 1633
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 1369 transition count 1631
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 1366 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 1366 transition count 1628
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 1366 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 1365 transition count 1625
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 1365 transition count 1625
Applied a total of 32 rules in 193 ms. Remains 1365 /1379 variables (removed 14) and now considering 1625/1643 (removed 18) transitions.
// Phase 1: matrix 1625 rows 1365 cols
[2024-05-26 02:18:41] [INFO ] Computed 66 invariants in 11 ms
[2024-05-26 02:18:42] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-26 02:18:42] [INFO ] Invariant cache hit.
[2024-05-26 02:18:43] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
Running 1624 sub problems to find dead transitions.
[2024-05-26 02:18:43] [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/1364 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
SMT process timed out in 30333ms, After SMT, problems are : Problem set: 0 solved, 1624 unsolved
Search for dead transitions found 0 dead transitions in 30348ms
Starting structural reductions in LTL mode, iteration 1 : 1365/1379 places, 1625/1643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31815 ms. Remains : 1365/1379 places, 1625/1643 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-06
Stuttering criterion allowed to conclude after 1583 steps with 0 reset in 7 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-06 finished in 32062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U G((p1&&F(p2)))))'
Support contains 3 out of 1379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1379/1379 places, 1643/1643 transitions.
Graph (trivial) has 1286 edges and 1379 vertex of which 862 / 1379 are part of one of the 33 SCC in 2 ms
Free SCC test removed 829 places
Ensure Unique test removed 971 transitions
Reduce isomorphic transitions removed 971 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 549 transition count 669
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 547 transition count 668
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 9 place count 546 transition count 666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 545 transition count 666
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 10 place count 545 transition count 629
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 84 place count 508 transition count 629
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 111 place count 481 transition count 568
Iterating global reduction 4 with 27 rules applied. Total rules applied 138 place count 481 transition count 568
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 332 place count 384 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 333 place count 383 transition count 470
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 264 edges and 374 vertex of which 46 / 374 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 11 rules applied. Total rules applied 344 place count 351 transition count 469
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 392 place count 350 transition count 422
Applied a total of 392 rules in 74 ms. Remains 350 /1379 variables (removed 1029) and now considering 422/1643 (removed 1221) transitions.
[2024-05-26 02:19:13] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
// Phase 1: matrix 390 rows 350 cols
[2024-05-26 02:19:13] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:19:13] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-26 02:19:13] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
[2024-05-26 02:19:13] [INFO ] Invariant cache hit.
[2024-05-26 02:19:14] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 02:19:14] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-05-26 02:19:14] [INFO ] Redundant transitions in 3 ms returned []
Running 205 sub problems to find dead transitions.
[2024-05-26 02:19:14] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
[2024-05-26 02:19:14] [INFO ] Invariant cache hit.
[2024-05-26 02:19:14] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 33/350 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 389/739 variables, 350/407 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/739 variables, 14/421 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/739 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 739/740 variables, and 421 constraints, problems are : Problem set: 0 solved, 205 unsolved in 10397 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 350/350 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 33/350 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 389/739 variables, 350/407 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/739 variables, 14/421 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 205/626 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/739 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/739 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 739/740 variables, and 626 constraints, problems are : Problem set: 0 solved, 205 unsolved in 10455 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 350/350 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 20882ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 20885ms
Starting structural reductions in SI_LTL mode, iteration 1 : 350/1379 places, 422/1643 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21410 ms. Remains : 350/1379 places, 422/1643 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-07 finished in 21565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)||G(p2)))'
Support contains 3 out of 1379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1379/1379 places, 1643/1643 transitions.
Graph (trivial) has 1289 edges and 1379 vertex of which 864 / 1379 are part of one of the 33 SCC in 3 ms
Free SCC test removed 831 places
Ensure Unique test removed 973 transitions
Reduce isomorphic transitions removed 973 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 547 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 546 transition count 668
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 3 place count 546 transition count 631
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 77 place count 509 transition count 631
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 104 place count 482 transition count 570
Iterating global reduction 2 with 27 rules applied. Total rules applied 131 place count 482 transition count 570
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 327 place count 384 transition count 472
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 383 transition count 471
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 267 edges and 374 vertex of which 48 / 374 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 338 place count 350 transition count 471
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 386 place count 350 transition count 423
Applied a total of 386 rules in 71 ms. Remains 350 /1379 variables (removed 1029) and now considering 423/1643 (removed 1220) transitions.
[2024-05-26 02:19:35] [INFO ] Flow matrix only has 391 transitions (discarded 32 similar events)
// Phase 1: matrix 391 rows 350 cols
[2024-05-26 02:19:35] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 02:19:35] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-26 02:19:35] [INFO ] Flow matrix only has 391 transitions (discarded 32 similar events)
[2024-05-26 02:19:35] [INFO ] Invariant cache hit.
[2024-05-26 02:19:35] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 02:19:35] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-26 02:19:35] [INFO ] Redundant transitions in 2 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-26 02:19:35] [INFO ] Flow matrix only has 391 transitions (discarded 32 similar events)
[2024-05-26 02:19:35] [INFO ] Invariant cache hit.
[2024-05-26 02:19:35] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 33/350 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 390/740 variables, 350/407 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 14/421 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/740 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 740/741 variables, and 421 constraints, problems are : Problem set: 0 solved, 203 unsolved in 9760 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 350/350 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 33/350 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 390/740 variables, 350/407 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 14/421 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 203/624 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/740 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 740/741 variables, and 624 constraints, problems are : Problem set: 0 solved, 203 unsolved in 9908 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 350/350 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 19692ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 19694ms
Starting structural reductions in SI_LTL mode, iteration 1 : 350/1379 places, 423/1643 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20209 ms. Remains : 350/1379 places, 423/1643 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-08 finished in 20404 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||(p1 U (p2||G(p1)))))))'
Support contains 4 out of 1379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1379/1379 places, 1643/1643 transitions.
Graph (trivial) has 1287 edges and 1379 vertex of which 858 / 1379 are part of one of the 33 SCC in 2 ms
Free SCC test removed 825 places
Ensure Unique test removed 966 transitions
Reduce isomorphic transitions removed 966 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 553 transition count 672
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 549 transition count 671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 548 transition count 671
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 11 place count 548 transition count 633
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 87 place count 510 transition count 633
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 113 place count 484 transition count 573
Iterating global reduction 3 with 26 rules applied. Total rules applied 139 place count 484 transition count 573
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 339 place count 384 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 340 place count 384 transition count 472
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 342 place count 383 transition count 477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 343 place count 383 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 344 place count 382 transition count 475
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 260 edges and 373 vertex of which 46 / 373 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Iterating post reduction 5 with 10 rules applied. Total rules applied 354 place count 350 transition count 475
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 6 with 46 rules applied. Total rules applied 400 place count 350 transition count 429
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 7 with 2 rules applied. Total rules applied 402 place count 349 transition count 428
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 405 place count 349 transition count 425
Applied a total of 405 rules in 79 ms. Remains 349 /1379 variables (removed 1030) and now considering 425/1643 (removed 1218) transitions.
[2024-05-26 02:19:55] [INFO ] Flow matrix only has 393 transitions (discarded 32 similar events)
// Phase 1: matrix 393 rows 349 cols
[2024-05-26 02:19:55] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:19:55] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-26 02:19:55] [INFO ] Flow matrix only has 393 transitions (discarded 32 similar events)
[2024-05-26 02:19:55] [INFO ] Invariant cache hit.
[2024-05-26 02:19:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 02:19:56] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2024-05-26 02:19:56] [INFO ] Redundant transitions in 2 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-26 02:19:56] [INFO ] Flow matrix only has 393 transitions (discarded 32 similar events)
[2024-05-26 02:19:56] [INFO ] Invariant cache hit.
[2024-05-26 02:19:56] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 33/349 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 392/741 variables, 349/406 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/741 variables, 14/420 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 0/741 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 741/742 variables, and 420 constraints, problems are : Problem set: 0 solved, 210 unsolved in 10314 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 349/349 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/316 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 33/349 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 392/741 variables, 349/406 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/741 variables, 14/420 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 210/630 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/741 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 741/742 variables, and 630 constraints, problems are : Problem set: 0 solved, 210 unsolved in 10433 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 349/349 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
After SMT, in 20774ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 20775ms
Starting structural reductions in SI_LTL mode, iteration 1 : 349/1379 places, 425/1643 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21293 ms. Remains : 349/1379 places, 425/1643 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-10
Stuttering criterion allowed to conclude after 571 steps with 7 reset in 11 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-10 finished in 21399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1379/1379 places, 1643/1643 transitions.
Graph (trivial) has 1292 edges and 1379 vertex of which 865 / 1379 are part of one of the 33 SCC in 2 ms
Free SCC test removed 832 places
Ensure Unique test removed 975 transitions
Reduce isomorphic transitions removed 975 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 546 transition count 666
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 545 transition count 665
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 7 place count 544 transition count 663
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8 place count 543 transition count 663
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 8 place count 543 transition count 626
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 82 place count 506 transition count 626
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 109 place count 479 transition count 565
Iterating global reduction 4 with 27 rules applied. Total rules applied 136 place count 479 transition count 565
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 332 place count 381 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 333 place count 380 transition count 466
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 371 vertex of which 48 / 371 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 4 with 10 rules applied. Total rules applied 343 place count 347 transition count 466
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 5 with 48 rules applied. Total rules applied 391 place count 347 transition count 418
Applied a total of 391 rules in 56 ms. Remains 347 /1379 variables (removed 1032) and now considering 418/1643 (removed 1225) transitions.
[2024-05-26 02:20:17] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2024-05-26 02:20:17] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:20:17] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-26 02:20:17] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
[2024-05-26 02:20:17] [INFO ] Invariant cache hit.
[2024-05-26 02:20:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-26 02:20:17] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-05-26 02:20:17] [INFO ] Redundant transitions in 2 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-26 02:20:17] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
[2024-05-26 02:20:17] [INFO ] Invariant cache hit.
[2024-05-26 02:20:17] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 33/347 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 385/732 variables, 347/404 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/732 variables, 14/418 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/732 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 732/733 variables, and 418 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9562 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 347/347 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 33/347 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/347 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 385/732 variables, 347/404 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/732 variables, 14/418 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 200/618 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/732 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 732/733 variables, and 618 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9684 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 347/347 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 19275ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 19276ms
Starting structural reductions in SI_LTL mode, iteration 1 : 347/1379 places, 418/1643 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19777 ms. Remains : 347/1379 places, 418/1643 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-11 finished in 19866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 1643/1643 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1368 transition count 1632
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1368 transition count 1632
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 1368 transition count 1630
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 1365 transition count 1627
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 1365 transition count 1627
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 1365 transition count 1625
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 1364 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 1364 transition count 1624
Applied a total of 34 rules in 164 ms. Remains 1364 /1379 variables (removed 15) and now considering 1624/1643 (removed 19) transitions.
// Phase 1: matrix 1624 rows 1364 cols
[2024-05-26 02:20:37] [INFO ] Computed 66 invariants in 7 ms
[2024-05-26 02:20:37] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-26 02:20:37] [INFO ] Invariant cache hit.
[2024-05-26 02:20:38] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
Running 1623 sub problems to find dead transitions.
[2024-05-26 02:20:38] [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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1623 unsolved
SMT process timed out in 30347ms, After SMT, problems are : Problem set: 0 solved, 1623 unsolved
Search for dead transitions found 0 dead transitions in 30361ms
Starting structural reductions in LTL mode, iteration 1 : 1364/1379 places, 1624/1643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31699 ms. Remains : 1364/1379 places, 1624/1643 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-14 finished in 31820 ms.
All properties solved by simple procedures.
Total runtime 308463 ms.
ITS solved all properties within timeout

BK_STOP 1716690068727

--------------------
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

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-4B"
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-4B, 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-171654350300612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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