Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536200316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
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 r261-smll-167863536200316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1004K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 09:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 09:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 09:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 552K Mar 5 18:23 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 1678882208044

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 12:10:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 12:10:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 12:10:11] [INFO ] Load time of PNML (sax parser for PT used): 355 ms
[2023-03-15 12:10:11] [INFO ] Transformed 1544 places.
[2023-03-15 12:10:11] [INFO ] Transformed 2229 transitions.
[2023-03-15 12:10:11] [INFO ] Found NUPN structural information;
[2023-03-15 12:10:11] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 557 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA NoC3x3-PT-6B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Discarding 362 places :
Symmetric choice reduction at 0 with 362 rule applications. Total rules 362 place count 1182 transition count 1867
Iterating global reduction 0 with 362 rules applied. Total rules applied 724 place count 1182 transition count 1867
Discarding 109 places :
Symmetric choice reduction at 0 with 109 rule applications. Total rules 833 place count 1073 transition count 1658
Iterating global reduction 0 with 109 rules applied. Total rules applied 942 place count 1073 transition count 1658
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 1028 place count 987 transition count 1522
Iterating global reduction 0 with 86 rules applied. Total rules applied 1114 place count 987 transition count 1522
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1134 place count 967 transition count 1482
Iterating global reduction 0 with 20 rules applied. Total rules applied 1154 place count 967 transition count 1482
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1167 place count 954 transition count 1456
Iterating global reduction 0 with 13 rules applied. Total rules applied 1180 place count 954 transition count 1456
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1193 place count 941 transition count 1443
Iterating global reduction 0 with 13 rules applied. Total rules applied 1206 place count 941 transition count 1443
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1209 place count 938 transition count 1437
Iterating global reduction 0 with 3 rules applied. Total rules applied 1212 place count 938 transition count 1437
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1215 place count 935 transition count 1431
Iterating global reduction 0 with 3 rules applied. Total rules applied 1218 place count 935 transition count 1431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1221 place count 932 transition count 1428
Iterating global reduction 0 with 3 rules applied. Total rules applied 1224 place count 932 transition count 1428
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1230 place count 932 transition count 1422
Applied a total of 1230 rules in 958 ms. Remains 932 /1544 variables (removed 612) and now considering 1422/2229 (removed 807) transitions.
// Phase 1: matrix 1422 rows 932 cols
[2023-03-15 12:10:13] [INFO ] Computed 66 place invariants in 44 ms
[2023-03-15 12:10:14] [INFO ] Implicit Places using invariants in 1248 ms returned []
[2023-03-15 12:10:14] [INFO ] Invariant cache hit.
[2023-03-15 12:10:16] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 2975 ms to find 0 implicit places.
[2023-03-15 12:10:16] [INFO ] Invariant cache hit.
[2023-03-15 12:10:17] [INFO ] Dead Transitions using invariants and state equation in 1416 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 932/1544 places, 1422/2229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5354 ms. Remains : 932/1544 places, 1422/2229 transitions.
Support contains 50 out of 932 places after structural reductions.
[2023-03-15 12:10:18] [INFO ] Flatten gal took : 317 ms
[2023-03-15 12:10:18] [INFO ] Flatten gal took : 130 ms
[2023-03-15 12:10:18] [INFO ] Input system was already deterministic with 1422 transitions.
Support contains 48 out of 932 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 750 ms. (steps per millisecond=13 ) properties (out of 29) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-15 12:10:20] [INFO ] Invariant cache hit.
[2023-03-15 12:10:20] [INFO ] [Real]Absence check using 66 positive place invariants in 68 ms returned sat
[2023-03-15 12:10:20] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 12:10:21] [INFO ] [Nat]Absence check using 66 positive place invariants in 67 ms returned sat
[2023-03-15 12:10:22] [INFO ] After 1125ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-15 12:10:22] [INFO ] Deduced a trap composed of 77 places in 166 ms of which 5 ms to minimize.
[2023-03-15 12:10:22] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2023-03-15 12:10:23] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 1 ms to minimize.
[2023-03-15 12:10:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 733 ms
[2023-03-15 12:10:23] [INFO ] Deduced a trap composed of 25 places in 622 ms of which 2 ms to minimize.
[2023-03-15 12:10:24] [INFO ] Deduced a trap composed of 38 places in 509 ms of which 2 ms to minimize.
[2023-03-15 12:10:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1356 ms
[2023-03-15 12:10:25] [INFO ] Deduced a trap composed of 49 places in 416 ms of which 1 ms to minimize.
[2023-03-15 12:10:25] [INFO ] Deduced a trap composed of 65 places in 297 ms of which 2 ms to minimize.
[2023-03-15 12:10:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1025 ms
[2023-03-15 12:10:25] [INFO ] After 4647ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 444 ms.
[2023-03-15 12:10:26] [INFO ] After 5671ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 8 out of 932 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 932 transition count 1389
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 899 transition count 1389
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 66 place count 899 transition count 1293
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 258 place count 803 transition count 1293
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 289 place count 772 transition count 1140
Iterating global reduction 2 with 31 rules applied. Total rules applied 320 place count 772 transition count 1140
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 327 place count 765 transition count 1119
Iterating global reduction 2 with 7 rules applied. Total rules applied 334 place count 765 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 335 place count 764 transition count 1117
Iterating global reduction 2 with 1 rules applied. Total rules applied 336 place count 764 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 763 transition count 1115
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 763 transition count 1115
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 1114
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 693 place count 586 transition count 937
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -31
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 895 place count 485 transition count 968
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 973 place count 446 transition count 994
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 996 place count 446 transition count 971
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 1020 place count 446 transition count 947
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 1058 place count 422 transition count 933
Applied a total of 1058 rules in 1300 ms. Remains 422 /932 variables (removed 510) and now considering 933/1422 (removed 489) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1300 ms. Remains : 422/932 places, 933/1422 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 933 rows 422 cols
[2023-03-15 12:10:28] [INFO ] Computed 66 place invariants in 12 ms
[2023-03-15 12:10:28] [INFO ] [Real]Absence check using 66 positive place invariants in 21 ms returned sat
[2023-03-15 12:10:28] [INFO ] After 650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 12:10:28] [INFO ] [Nat]Absence check using 66 positive place invariants in 24 ms returned sat
[2023-03-15 12:10:29] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 12:10:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 12:10:29] [INFO ] After 128ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 12:10:29] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2023-03-15 12:10:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-15 12:10:29] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-15 12:10:29] [INFO ] After 1226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 933/933 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 422 transition count 932
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 421 transition count 932
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 419 transition count 926
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 419 transition count 926
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 8 place count 418 transition count 925
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
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 12 place count 416 transition count 933
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 416 transition count 929
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 414 transition count 920
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 414 transition count 920
Applied a total of 20 rules in 139 ms. Remains 414 /422 variables (removed 8) and now considering 920/933 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 414/422 places, 920/933 transitions.
Incomplete random walk after 10000 steps, including 69 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 920 rows 414 cols
[2023-03-15 12:10:30] [INFO ] Computed 66 place invariants in 13 ms
[2023-03-15 12:10:30] [INFO ] [Real]Absence check using 66 positive place invariants in 22 ms returned sat
[2023-03-15 12:10:30] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:10:30] [INFO ] [Nat]Absence check using 66 positive place invariants in 26 ms returned sat
[2023-03-15 12:10:31] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:10:31] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-15 12:10:31] [INFO ] After 56ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:10:31] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-15 12:10:31] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 920/920 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 414 transition count 919
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 413 transition count 919
Applied a total of 2 rules in 22 ms. Remains 413 /414 variables (removed 1) and now considering 919/920 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 413/414 places, 919/920 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 212539 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212539 steps, saw 62889 distinct states, run finished after 3002 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 919 rows 413 cols
[2023-03-15 12:10:34] [INFO ] Computed 66 place invariants in 8 ms
[2023-03-15 12:10:34] [INFO ] [Real]Absence check using 66 positive place invariants in 19 ms returned sat
[2023-03-15 12:10:35] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:10:35] [INFO ] [Nat]Absence check using 66 positive place invariants in 22 ms returned sat
[2023-03-15 12:10:35] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:10:35] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-15 12:10:35] [INFO ] After 69ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:10:35] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-15 12:10:35] [INFO ] After 713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 919/919 transitions.
Applied a total of 0 rules in 29 ms. Remains 413 /413 variables (removed 0) and now considering 919/919 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 413/413 places, 919/919 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 919/919 transitions.
Applied a total of 0 rules in 29 ms. Remains 413 /413 variables (removed 0) and now considering 919/919 (removed 0) transitions.
[2023-03-15 12:10:35] [INFO ] Invariant cache hit.
[2023-03-15 12:10:36] [INFO ] Implicit Places using invariants in 480 ms returned [10, 45, 89, 130, 189, 261, 307, 346, 392]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 488 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 404/413 places, 919/919 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 380 transition count 895
Applied a total of 48 rules in 41 ms. Remains 380 /404 variables (removed 24) and now considering 895/919 (removed 24) transitions.
// Phase 1: matrix 895 rows 380 cols
[2023-03-15 12:10:36] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-15 12:10:36] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-15 12:10:36] [INFO ] Invariant cache hit.
[2023-03-15 12:10:37] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-15 12:10:37] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 380/413 places, 895/919 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2003 ms. Remains : 380/413 places, 895/919 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 237667 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237667 steps, saw 68183 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 12:10:40] [INFO ] Invariant cache hit.
[2023-03-15 12:10:41] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-15 12:10:41] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:10:41] [INFO ] [Nat]Absence check using 57 positive place invariants in 22 ms returned sat
[2023-03-15 12:10:41] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:10:41] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-15 12:10:42] [INFO ] After 114ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:10:42] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-15 12:10:42] [INFO ] After 728ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 895/895 transitions.
Applied a total of 0 rules in 24 ms. Remains 380 /380 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 380/380 places, 895/895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 895/895 transitions.
Applied a total of 0 rules in 24 ms. Remains 380 /380 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2023-03-15 12:10:42] [INFO ] Invariant cache hit.
[2023-03-15 12:10:42] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-15 12:10:42] [INFO ] Invariant cache hit.
[2023-03-15 12:10:43] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-15 12:10:43] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
[2023-03-15 12:10:43] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-15 12:10:43] [INFO ] Invariant cache hit.
[2023-03-15 12:10:44] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2521 ms. Remains : 380/380 places, 895/895 transitions.
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 380 transition count 879
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 380 transition count 879
Applied a total of 20 rules in 66 ms. Remains 380 /380 variables (removed 0) and now considering 879/895 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 879 rows 380 cols
[2023-03-15 12:10:44] [INFO ] Computed 57 place invariants in 8 ms
[2023-03-15 12:10:44] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2023-03-15 12:10:45] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:10:45] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-15 12:10:45] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:10:45] [INFO ] After 371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 12:10:45] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA NoC3x3-PT-6B-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 919 transition count 1393
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 919 transition count 1393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 911 transition count 1378
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 911 transition count 1378
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 907 transition count 1364
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 907 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 904 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 904 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 903 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 903 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 902 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 902 transition count 1357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 902 transition count 1354
Applied a total of 63 rules in 139 ms. Remains 902 /932 variables (removed 30) and now considering 1354/1422 (removed 68) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2023-03-15 12:10:46] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-15 12:10:47] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-15 12:10:47] [INFO ] Invariant cache hit.
[2023-03-15 12:10:48] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 1960 ms to find 0 implicit places.
[2023-03-15 12:10:48] [INFO ] Invariant cache hit.
[2023-03-15 12:10:49] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/932 places, 1354/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3079 ms. Remains : 902/932 places, 1354/1422 transitions.
Stuttering acceptance computed with spot in 314 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s274 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-00 finished in 3474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))||(p2 U (p3||G(p2))))))'
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 918 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 918 transition count 1392
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 909 transition count 1375
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 909 transition count 1375
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 905 transition count 1361
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 905 transition count 1361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 902 transition count 1357
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 902 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 901 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 901 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 900 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 900 transition count 1354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 900 transition count 1351
Applied a total of 67 rules in 180 ms. Remains 900 /932 variables (removed 32) and now considering 1351/1422 (removed 71) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2023-03-15 12:10:50] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-15 12:10:50] [INFO ] Implicit Places using invariants in 689 ms returned []
[2023-03-15 12:10:50] [INFO ] Invariant cache hit.
[2023-03-15 12:10:52] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 2086 ms to find 0 implicit places.
[2023-03-15 12:10:52] [INFO ] Invariant cache hit.
[2023-03-15 12:10:53] [INFO ] Dead Transitions using invariants and state equation in 1286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 900/932 places, 1351/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3555 ms. Remains : 900/932 places, 1351/1422 transitions.
Stuttering acceptance computed with spot in 398 ms :[true, (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}]], initial=1, aps=[p0:(OR (AND (EQ s436 1) (EQ s460 1)) (AND (EQ s679 1) (EQ s713 1))), p3:(AND (NEQ s671 1) (NEQ s0 1)), p2:(NEQ s0 1), p1:(AND (EQ s436 1) (EQ s460 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1332 ms.
Product exploration explored 100000 steps with 50000 reset in 1223 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Detected a total of 65/900 stabilizing places and 65/1351 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p3) p2)))
Knowledge based reduction with 15 factoid took 385 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6B-LTLFireability-01 finished in 6959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0&&F(G(p1))) U p2))))'
Support contains 4 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 921 transition count 1397
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 921 transition count 1397
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 913 transition count 1382
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 913 transition count 1382
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 909 transition count 1368
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 909 transition count 1368
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 906 transition count 1364
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 906 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 905 transition count 1362
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 905 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 904 transition count 1361
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 904 transition count 1361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 904 transition count 1358
Applied a total of 59 rules in 229 ms. Remains 904 /932 variables (removed 28) and now considering 1358/1422 (removed 64) transitions.
// Phase 1: matrix 1358 rows 904 cols
[2023-03-15 12:10:57] [INFO ] Computed 66 place invariants in 9 ms
[2023-03-15 12:10:57] [INFO ] Implicit Places using invariants in 877 ms returned []
[2023-03-15 12:10:57] [INFO ] Invariant cache hit.
[2023-03-15 12:10:59] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 2365 ms to find 0 implicit places.
[2023-03-15 12:10:59] [INFO ] Invariant cache hit.
[2023-03-15 12:11:00] [INFO ] Dead Transitions using invariants and state equation in 1113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/932 places, 1358/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3710 ms. Remains : 904/932 places, 1358/1422 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s143 1) (EQ s168 1)), p0:(EQ s214 1), p1:(EQ s538 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-02 finished in 3932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1&&G(F(p1)))))))'
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 66 place count 898 transition count 1290
Deduced a syphon composed of 98 places in 4 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 262 place count 800 transition count 1290
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 297 place count 765 transition count 1114
Iterating global reduction 2 with 35 rules applied. Total rules applied 332 place count 765 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 340 place count 757 transition count 1091
Iterating global reduction 2 with 8 rules applied. Total rules applied 348 place count 757 transition count 1091
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 757 transition count 1090
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 756 transition count 1090
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 353 place count 753 transition count 1082
Iterating global reduction 4 with 3 rules applied. Total rules applied 356 place count 753 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 357 place count 752 transition count 1080
Iterating global reduction 4 with 1 rules applied. Total rules applied 358 place count 752 transition count 1080
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 359 place count 752 transition count 1079
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 5 with 354 rules applied. Total rules applied 713 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 5 with 202 rules applied. Total rules applied 915 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 5 with 78 rules applied. Total rules applied 993 place count 435 transition count 947
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 1017 place count 435 transition count 923
Applied a total of 1017 rules in 250 ms. Remains 435 /932 variables (removed 497) and now considering 923/1422 (removed 499) transitions.
// Phase 1: matrix 923 rows 435 cols
[2023-03-15 12:11:01] [INFO ] Computed 66 place invariants in 13 ms
[2023-03-15 12:11:01] [INFO ] Implicit Places using invariants in 542 ms returned [10, 45, 93, 132, 193, 275, 325, 364, 413]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 545 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/932 places, 923/1422 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 402 transition count 899
Applied a total of 48 rules in 26 ms. Remains 402 /426 variables (removed 24) and now considering 899/923 (removed 24) transitions.
// Phase 1: matrix 899 rows 402 cols
[2023-03-15 12:11:01] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-15 12:11:02] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-15 12:11:02] [INFO ] Invariant cache hit.
[2023-03-15 12:11:02] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 12:11:03] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/932 places, 899/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2735 ms. Remains : 402/932 places, 899/1422 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s108 0) (EQ s131 0)), p1:(EQ s203 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 699 reset in 510 ms.
Product exploration explored 100000 steps with 692 reset in 1002 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 p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 206 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 12:11:05] [INFO ] Invariant cache hit.
[2023-03-15 12:11:05] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:11:05] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-15 12:11:06] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:11:06] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 12:11:06] [INFO ] After 89ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:11:06] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-15 12:11:06] [INFO ] After 712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 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 60 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 60 ms. Remains : 377/402 places, 860/899 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 254443 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254443 steps, saw 69909 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 860 rows 377 cols
[2023-03-15 12:11:09] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-15 12:11:09] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:11:09] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-15 12:11:09] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:11:09] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 12:11:10] [INFO ] After 72ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:11:10] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 12:11:10] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 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 19 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 19 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 19 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2023-03-15 12:11:10] [INFO ] Invariant cache hit.
[2023-03-15 12:11:10] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-15 12:11:10] [INFO ] Invariant cache hit.
[2023-03-15 12:11:11] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 12:11:11] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1618 ms to find 0 implicit places.
[2023-03-15 12:11:11] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-15 12:11:11] [INFO ] Invariant cache hit.
[2023-03-15 12:11:12] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2327 ms. Remains : 377/377 places, 860/860 transitions.
Drop 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 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 47 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
[2023-03-15 12:11:12] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 12:11:12] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:11:12] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-15 12:11:13] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:11:13] [INFO ] After 495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-15 12:11:13] [INFO ] After 665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 315 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 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 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 19 ms. Remains 402 /402 variables (removed 0) and now considering 899/899 (removed 0) transitions.
// Phase 1: matrix 899 rows 402 cols
[2023-03-15 12:11:13] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 12:11:14] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-15 12:11:14] [INFO ] Invariant cache hit.
[2023-03-15 12:11:14] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 12:11:15] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1645 ms to find 0 implicit places.
[2023-03-15 12:11:15] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 12:11:15] [INFO ] Invariant cache hit.
[2023-03-15 12:11:16] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2491 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 p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 287 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 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 72 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 12:11:16] [INFO ] Invariant cache hit.
[2023-03-15 12:11:16] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:11:17] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-15 12:11:17] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:11:17] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 12:11:17] [INFO ] After 81ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:11:17] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-15 12:11:17] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 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 24 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.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 253732 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253732 steps, saw 69606 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 860 rows 377 cols
[2023-03-15 12:11:20] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 12:11:20] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:11:20] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-15 12:11:21] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:11:21] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 12:11:21] [INFO ] After 109ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:11:21] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-15 12:11:21] [INFO ] After 791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 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 17 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 17 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 15 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2023-03-15 12:11:21] [INFO ] Invariant cache hit.
[2023-03-15 12:11:21] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-15 12:11:22] [INFO ] Invariant cache hit.
[2023-03-15 12:11:22] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 12:11:23] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
[2023-03-15 12:11:23] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 12:11:23] [INFO ] Invariant cache hit.
[2023-03-15 12:11:24] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2598 ms. Remains : 377/377 places, 860/860 transitions.
Drop 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 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 35 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
[2023-03-15 12:11:24] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 12:11:24] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:11:24] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-15 12:11:24] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:11:24] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-15 12:11:24] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 291 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 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 686 reset in 641 ms.
Product exploration explored 100000 steps with 689 reset in 468 ms.
Built C files in :
/tmp/ltsmin13270746131261542481
[2023-03-15 12:11:26] [INFO ] Computing symmetric may disable matrix : 899 transitions.
[2023-03-15 12:11:26] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:11:26] [INFO ] Computing symmetric may enable matrix : 899 transitions.
[2023-03-15 12:11:26] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:11:26] [INFO ] Computing Do-Not-Accords matrix : 899 transitions.
[2023-03-15 12:11:26] [INFO ] Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:11:26] [INFO ] Built C files in 310ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13270746131261542481
Running compilation step : cd /tmp/ltsmin13270746131261542481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13270746131261542481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13270746131261542481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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
[2023-03-15 12:11:29] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 12:11:30] [INFO ] Implicit Places using invariants in 515 ms returned []
[2023-03-15 12:11:30] [INFO ] Invariant cache hit.
[2023-03-15 12:11:30] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 12:11:31] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1963 ms to find 0 implicit places.
[2023-03-15 12:11:31] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-15 12:11:31] [INFO ] Invariant cache hit.
[2023-03-15 12:11:32] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2972 ms. Remains : 402/402 places, 899/899 transitions.
Built C files in :
/tmp/ltsmin14478504758385318693
[2023-03-15 12:11:32] [INFO ] Computing symmetric may disable matrix : 899 transitions.
[2023-03-15 12:11:32] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:11:32] [INFO ] Computing symmetric may enable matrix : 899 transitions.
[2023-03-15 12:11:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:11:33] [INFO ] Computing Do-Not-Accords matrix : 899 transitions.
[2023-03-15 12:11:33] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:11:33] [INFO ] Built C files in 299ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14478504758385318693
Running compilation step : cd /tmp/ltsmin14478504758385318693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14478504758385318693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14478504758385318693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 12:11:36] [INFO ] Flatten gal took : 80 ms
[2023-03-15 12:11:36] [INFO ] Flatten gal took : 108 ms
[2023-03-15 12:11:36] [INFO ] Time to serialize gal into /tmp/LTL1620159609657850882.gal : 16 ms
[2023-03-15 12:11:36] [INFO ] Time to serialize properties into /tmp/LTL6679022386461405294.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1620159609657850882.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6561323370793797815.hoa' '-atoms' '/tmp/LTL6679022386461405294.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6679022386461405294.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6561323370793797815.hoa
Detected timeout of ITS tools.
[2023-03-15 12:11:51] [INFO ] Flatten gal took : 94 ms
[2023-03-15 12:11:51] [INFO ] Flatten gal took : 77 ms
[2023-03-15 12:11:51] [INFO ] Time to serialize gal into /tmp/LTL15247663958717929376.gal : 12 ms
[2023-03-15 12:11:51] [INFO ] Time to serialize properties into /tmp/LTL13303126186375254097.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15247663958717929376.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13303126186375254097.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((p436==0)||(p521==0))"))||(X(("(p808==0)")&&(G(F("(p808==0)"))))))))
Formula 0 simplified : G(F!"((p436==0)||(p521==0))" & X(!"(p808==0)" | FG!"(p808==0)"))
Detected timeout of ITS tools.
[2023-03-15 12:12:07] [INFO ] Flatten gal took : 52 ms
[2023-03-15 12:12:07] [INFO ] Applying decomposition
[2023-03-15 12:12:07] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15630266528432450195.txt' '-o' '/tmp/graph15630266528432450195.bin' '-w' '/tmp/graph15630266528432450195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15630266528432450195.bin' '-l' '-1' '-v' '-w' '/tmp/graph15630266528432450195.weights' '-q' '0' '-e' '0.001'
[2023-03-15 12:12:07] [INFO ] Decomposing Gal with order
[2023-03-15 12:12:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 12:12:07] [INFO ] Removed a total of 762 redundant transitions.
[2023-03-15 12:12:07] [INFO ] Flatten gal took : 264 ms
[2023-03-15 12:12:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 617 labels/synchronizations in 131 ms.
[2023-03-15 12:12:08] [INFO ] Time to serialize gal into /tmp/LTL12942455513380694212.gal : 25 ms
[2023-03-15 12:12:08] [INFO ] Time to serialize properties into /tmp/LTL5572274982145095168.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12942455513380694212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5572274982145095168.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i3.u10.p436==0)||(i3.u10.p521==0))"))||(X(("(i4.i1.u16.p808==0)")&&(G(F("(i4.i1.u16.p808==0)"))))))))
Formula 0 simplified : G(F!"((i3.u10.p436==0)||(i3.u10.p521==0))" & X(!"(i4.i1.u16.p808==0)" | FG!"(i4.i1.u16.p808==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5087118058341812833
[2023-03-15 12:12:23] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5087118058341812833
Running compilation step : cd /tmp/ltsmin5087118058341812833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2956 ms.
Running link step : cd /tmp/ltsmin5087118058341812833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin5087118058341812833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(((LTLAPp1==true)&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-6B-LTLFireability-03 finished in 97450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 918 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 918 transition count 1392
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 910 transition count 1377
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 910 transition count 1377
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 906 transition count 1363
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 906 transition count 1363
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 903 transition count 1359
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 903 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 902 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 902 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 901 transition count 1356
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 901 transition count 1356
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 901 transition count 1353
Applied a total of 65 rules in 143 ms. Remains 901 /932 variables (removed 31) and now considering 1353/1422 (removed 69) transitions.
// Phase 1: matrix 1353 rows 901 cols
[2023-03-15 12:12:38] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-15 12:12:39] [INFO ] Implicit Places using invariants in 936 ms returned []
[2023-03-15 12:12:39] [INFO ] Invariant cache hit.
[2023-03-15 12:12:41] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2672 ms to find 0 implicit places.
[2023-03-15 12:12:41] [INFO ] Invariant cache hit.
[2023-03-15 12:12:42] [INFO ] Dead Transitions using invariants and state equation in 1601 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 901/932 places, 1353/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4429 ms. Remains : 901/932 places, 1353/1422 transitions.
Stuttering acceptance computed with spot in 469 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 8}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 8}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 8}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p2 p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(AND (EQ s136 1) (EQ s224 1)), p1:(NEQ s372 1), p2:(AND (EQ s83 1) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10578 steps with 23 reset in 52 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-04 finished in 4984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 919 transition count 1398
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 919 transition count 1398
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 911 transition count 1383
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 911 transition count 1383
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 908 transition count 1375
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 908 transition count 1375
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 906 transition count 1372
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 906 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 905 transition count 1370
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 905 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 904 transition count 1369
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 904 transition count 1369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 904 transition count 1366
Applied a total of 59 rules in 138 ms. Remains 904 /932 variables (removed 28) and now considering 1366/1422 (removed 56) transitions.
// Phase 1: matrix 1366 rows 904 cols
[2023-03-15 12:12:43] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-15 12:12:44] [INFO ] Implicit Places using invariants in 730 ms returned []
[2023-03-15 12:12:44] [INFO ] Invariant cache hit.
[2023-03-15 12:12:45] [INFO ] Implicit Places using invariants and state equation in 1685 ms returned []
Implicit Place search using SMT with State Equation took 2422 ms to find 0 implicit places.
[2023-03-15 12:12:45] [INFO ] Invariant cache hit.
[2023-03-15 12:12:47] [INFO ] Dead Transitions using invariants and state equation in 1702 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/932 places, 1366/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4265 ms. Remains : 904/932 places, 1366/1422 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s755 1) (EQ s819 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 317 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-07 finished in 4382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 66 place count 898 transition count 1289
Deduced a syphon composed of 99 places in 3 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 264 place count 799 transition count 1289
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 299 place count 764 transition count 1112
Iterating global reduction 2 with 35 rules applied. Total rules applied 334 place count 764 transition count 1112
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 342 place count 756 transition count 1096
Iterating global reduction 2 with 8 rules applied. Total rules applied 350 place count 756 transition count 1096
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 351 place count 756 transition count 1095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 755 transition count 1095
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 355 place count 752 transition count 1087
Iterating global reduction 4 with 3 rules applied. Total rules applied 358 place count 752 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 359 place count 751 transition count 1085
Iterating global reduction 4 with 1 rules applied. Total rules applied 360 place count 751 transition count 1085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 361 place count 751 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 5 with 354 rules applied. Total rules applied 715 place count 574 transition count 907
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 5 with 202 rules applied. Total rules applied 917 place count 473 transition count 939
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 5 with 78 rules applied. Total rules applied 995 place count 434 transition count 954
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 1021 place count 434 transition count 928
Applied a total of 1021 rules in 217 ms. Remains 434 /932 variables (removed 498) and now considering 928/1422 (removed 494) transitions.
[2023-03-15 12:12:47] [INFO ] Flow matrix only has 924 transitions (discarded 4 similar events)
// Phase 1: matrix 924 rows 434 cols
[2023-03-15 12:12:47] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-15 12:12:48] [INFO ] Implicit Places using invariants in 558 ms returned [10, 47, 95, 134, 194, 274, 324, 363, 412]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 561 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/932 places, 928/1422 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 401 transition count 904
Applied a total of 48 rules in 21 ms. Remains 401 /425 variables (removed 24) and now considering 904/928 (removed 24) transitions.
[2023-03-15 12:12:48] [INFO ] Flow matrix only has 900 transitions (discarded 4 similar events)
// Phase 1: matrix 900 rows 401 cols
[2023-03-15 12:12:48] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 12:12:48] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-15 12:12:48] [INFO ] Flow matrix only has 900 transitions (discarded 4 similar events)
[2023-03-15 12:12:48] [INFO ] Invariant cache hit.
[2023-03-15 12:12:49] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-15 12:12:50] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 401/932 places, 904/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2748 ms. Remains : 401/932 places, 904/1422 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-08 finished in 2820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 66 place count 898 transition count 1290
Deduced a syphon composed of 98 places in 6 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 262 place count 800 transition count 1290
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 297 place count 765 transition count 1121
Iterating global reduction 2 with 35 rules applied. Total rules applied 332 place count 765 transition count 1121
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 341 place count 756 transition count 1096
Iterating global reduction 2 with 9 rules applied. Total rules applied 350 place count 756 transition count 1096
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 351 place count 756 transition count 1095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 755 transition count 1095
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 355 place count 752 transition count 1087
Iterating global reduction 4 with 3 rules applied. Total rules applied 358 place count 752 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 359 place count 751 transition count 1085
Iterating global reduction 4 with 1 rules applied. Total rules applied 360 place count 751 transition count 1085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 361 place count 751 transition count 1084
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 5 with 350 rules applied. Total rules applied 711 place count 576 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 913 place count 475 transition count 941
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 989 place count 437 transition count 953
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 1013 place count 437 transition count 929
Applied a total of 1013 rules in 338 ms. Remains 437 /932 variables (removed 495) and now considering 929/1422 (removed 493) transitions.
// Phase 1: matrix 929 rows 437 cols
[2023-03-15 12:12:50] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-15 12:12:51] [INFO ] Implicit Places using invariants in 799 ms returned [11, 48, 96, 135, 276, 326, 365, 414]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 801 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 429/932 places, 929/1422 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 409 transition count 909
Applied a total of 40 rules in 32 ms. Remains 409 /429 variables (removed 20) and now considering 909/929 (removed 20) transitions.
// Phase 1: matrix 909 rows 409 cols
[2023-03-15 12:12:51] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-15 12:12:52] [INFO ] Implicit Places using invariants in 775 ms returned []
[2023-03-15 12:12:52] [INFO ] Invariant cache hit.
[2023-03-15 12:12:52] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 12:12:53] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 2030 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 409/932 places, 909/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3203 ms. Remains : 409/932 places, 909/1422 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s381 1) (EQ s395 1)), p1:(AND (EQ s32 1) (EQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-09 finished in 3301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&G(p1)&&X(!p2)))))'
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 918 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 918 transition count 1392
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 909 transition count 1375
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 909 transition count 1375
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 906 transition count 1367
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 906 transition count 1367
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 904 transition count 1364
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 904 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 903 transition count 1362
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 903 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 902 transition count 1361
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 902 transition count 1361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 902 transition count 1358
Applied a total of 63 rules in 154 ms. Remains 902 /932 variables (removed 30) and now considering 1358/1422 (removed 64) transitions.
// Phase 1: matrix 1358 rows 902 cols
[2023-03-15 12:12:53] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-15 12:12:54] [INFO ] Implicit Places using invariants in 697 ms returned []
[2023-03-15 12:12:54] [INFO ] Invariant cache hit.
[2023-03-15 12:12:56] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2500 ms to find 0 implicit places.
[2023-03-15 12:12:56] [INFO ] Invariant cache hit.
[2023-03-15 12:12:57] [INFO ] Dead Transitions using invariants and state equation in 1266 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/932 places, 1358/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3922 ms. Remains : 902/932 places, 1358/1422 transitions.
Stuttering acceptance computed with spot in 186 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s400 1) (EQ s558 1)), p0:(AND (EQ s847 1) (EQ s897 1) (NOT (AND (EQ s761 1) (EQ s821 1)))), p2:(AND (EQ s761 1) (EQ s821 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 241 reset in 475 ms.
Product exploration explored 100000 steps with 244 reset in 623 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 (AND p0 p1 p2))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 522 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 237 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 12:13:00] [INFO ] Invariant cache hit.
[2023-03-15 12:13:00] [INFO ] [Real]Absence check using 66 positive place invariants in 43 ms returned sat
[2023-03-15 12:13:01] [INFO ] After 911ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 12:13:01] [INFO ] [Nat]Absence check using 66 positive place invariants in 42 ms returned sat
[2023-03-15 12:13:02] [INFO ] After 865ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 12:13:02] [INFO ] After 942ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-15 12:13:02] [INFO ] After 1198ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 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 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 4 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 0 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 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 153 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 154 ms. Remains : 412/902 places, 895/1358 transitions.
Incomplete random walk after 10000 steps, including 70 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 246826 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246826 steps, saw 79692 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 895 rows 412 cols
[2023-03-15 12:13:05] [INFO ] Computed 66 place invariants in 3 ms
[2023-03-15 12:13:05] [INFO ] [Real]Absence check using 66 positive place invariants in 19 ms returned sat
[2023-03-15 12:13:06] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:13:06] [INFO ] [Nat]Absence check using 66 positive place invariants in 18 ms returned sat
[2023-03-15 12:13:06] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:13:06] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-15 12:13:06] [INFO ] After 132ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:13:06] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-15 12:13:06] [INFO ] After 844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 895/895 transitions.
Applied a total of 0 rules in 17 ms. Remains 412 /412 variables (removed 0) and now considering 895/895 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 412/412 places, 895/895 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 895/895 transitions.
Applied a total of 0 rules in 15 ms. Remains 412 /412 variables (removed 0) and now considering 895/895 (removed 0) transitions.
[2023-03-15 12:13:06] [INFO ] Invariant cache hit.
[2023-03-15 12:13:07] [INFO ] Implicit Places using invariants in 569 ms returned [10, 45, 89, 128, 184, 257, 303, 344, 392]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 572 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 403/412 places, 895/895 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 379 transition count 871
Applied a total of 48 rules in 25 ms. Remains 379 /403 variables (removed 24) and now considering 871/895 (removed 24) transitions.
// Phase 1: matrix 871 rows 379 cols
[2023-03-15 12:13:07] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 12:13:07] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-15 12:13:07] [INFO ] Invariant cache hit.
[2023-03-15 12:13:08] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-15 12:13:08] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 379/412 places, 871/895 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1898 ms. Remains : 379/412 places, 871/895 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 184956 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184956 steps, saw 59660 distinct states, run finished after 3006 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 12:13:11] [INFO ] Invariant cache hit.
[2023-03-15 12:13:11] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-15 12:13:12] [INFO ] After 580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:13:12] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-15 12:13:12] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:13:12] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-15 12:13:13] [INFO ] After 121ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:13:13] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-15 12:13:13] [INFO ] After 790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(F (AND p1 p2)), (F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 12 factoid took 689 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 133 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 126 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 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 6 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 0 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 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 1 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 202 ms. Remains 435 /902 variables (removed 467) and now considering 930/1358 (removed 428) transitions.
// Phase 1: matrix 930 rows 435 cols
[2023-03-15 12:13:14] [INFO ] Computed 65 place invariants in 4 ms
[2023-03-15 12:13:15] [INFO ] Implicit Places using invariants in 811 ms returned [10, 45, 93, 132, 192, 272, 322, 363]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 817 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 1 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 32 ms. Remains 405 /427 variables (removed 22) and now considering 908/930 (removed 22) transitions.
// Phase 1: matrix 908 rows 405 cols
[2023-03-15 12:13:15] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 12:13:15] [INFO ] Implicit Places using invariants in 535 ms returned []
[2023-03-15 12:13:15] [INFO ] Invariant cache hit.
[2023-03-15 12:13:16] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-15 12:13:17] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1867 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 2919 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 p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 435 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 170 ms :[p0, (AND (NOT p1) p0), p0]
Finished random walk after 1846 steps, including 13 resets, run visited all 3 properties in 27 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 7 factoid took 505 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 174 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 159 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 161 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 671 reset in 745 ms.
Product exploration explored 100000 steps with 683 reset in 634 ms.
Built C files in :
/tmp/ltsmin6219020351868861613
[2023-03-15 12:13:20] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2023-03-15 12:13:20] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:13:20] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2023-03-15 12:13:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:13:20] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2023-03-15 12:13:20] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:13:20] [INFO ] Built C files in 159ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6219020351868861613
Running compilation step : cd /tmp/ltsmin6219020351868861613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6219020351868861613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6219020351868861613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 19 ms. Remains 405 /405 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2023-03-15 12:13:23] [INFO ] Invariant cache hit.
[2023-03-15 12:13:24] [INFO ] Implicit Places using invariants in 590 ms returned []
[2023-03-15 12:13:24] [INFO ] Invariant cache hit.
[2023-03-15 12:13:24] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-15 12:13:25] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
[2023-03-15 12:13:25] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 12:13:25] [INFO ] Invariant cache hit.
[2023-03-15 12:13:25] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2276 ms. Remains : 405/405 places, 908/908 transitions.
Built C files in :
/tmp/ltsmin3686597520859338689
[2023-03-15 12:13:25] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2023-03-15 12:13:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:13:25] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2023-03-15 12:13:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:13:25] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2023-03-15 12:13:25] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:13:25] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3686597520859338689
Running compilation step : cd /tmp/ltsmin3686597520859338689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3686597520859338689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3686597520859338689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 12:13:28] [INFO ] Flatten gal took : 68 ms
[2023-03-15 12:13:29] [INFO ] Flatten gal took : 85 ms
[2023-03-15 12:13:29] [INFO ] Time to serialize gal into /tmp/LTL11905522950306020106.gal : 12 ms
[2023-03-15 12:13:29] [INFO ] Time to serialize properties into /tmp/LTL16663371419773001686.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11905522950306020106.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15522036359486211050.hoa' '-atoms' '/tmp/LTL16663371419773001686.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16663371419773001686.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15522036359486211050.hoa
Detected timeout of ITS tools.
[2023-03-15 12:13:44] [INFO ] Flatten gal took : 43 ms
[2023-03-15 12:13:44] [INFO ] Flatten gal took : 90 ms
[2023-03-15 12:13:44] [INFO ] Time to serialize gal into /tmp/LTL16889367954002533058.gal : 8 ms
[2023-03-15 12:13:44] [INFO ] Time to serialize properties into /tmp/LTL2349458329727937207.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16889367954002533058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2349458329727937207.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))")))||(((F("(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))"))&&(G...220
Formula 0 simplified : G(FG!"(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))" & (G!"(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))" | F!"((p615=...204
Detected timeout of ITS tools.
[2023-03-15 12:13:59] [INFO ] Flatten gal took : 41 ms
[2023-03-15 12:13:59] [INFO ] Applying decomposition
[2023-03-15 12:13:59] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17869288240264299627.txt' '-o' '/tmp/graph17869288240264299627.bin' '-w' '/tmp/graph17869288240264299627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17869288240264299627.bin' '-l' '-1' '-v' '-w' '/tmp/graph17869288240264299627.weights' '-q' '0' '-e' '0.001'
[2023-03-15 12:13:59] [INFO ] Decomposing Gal with order
[2023-03-15 12:13:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 12:13:59] [INFO ] Removed a total of 682 redundant transitions.
[2023-03-15 12:13:59] [INFO ] Flatten gal took : 100 ms
[2023-03-15 12:13:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 614 labels/synchronizations in 64 ms.
[2023-03-15 12:13:59] [INFO ] Time to serialize gal into /tmp/LTL13488855725551138121.gal : 11 ms
[2023-03-15 12:13:59] [INFO ] Time to serialize properties into /tmp/LTL10658431624319185237.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13488855725551138121.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10658431624319185237.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((i8.u34.p1468!=1)||(i8.u35.p1537!=1))||((i7.u33.p1306==1)&&(i7.u32.p1407==1)))")))||(((F("(((i8.u34.p1468!=1)||(i8.u35.p1...310
Formula 0 simplified : G(FG!"(((i8.u34.p1468!=1)||(i8.u35.p1537!=1))||((i7.u33.p1306==1)&&(i7.u32.p1407==1)))" & (G!"(((i8.u34.p1468!=1)||(i8.u35.p1537!=1)...294
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7574710560840596558
[2023-03-15 12:14:14] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7574710560840596558
Running compilation step : cd /tmp/ltsmin7574710560840596558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2331 ms.
Running link step : cd /tmp/ltsmin7574710560840596558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7574710560840596558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[]((LTLAPp1==true))&&X((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-6B-LTLFireability-10 finished in 96335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 920 transition count 1399
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 920 transition count 1399
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 913 transition count 1386
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 913 transition count 1386
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 910 transition count 1378
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 910 transition count 1378
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 908 transition count 1375
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 908 transition count 1375
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 907 transition count 1373
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 907 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 906 transition count 1372
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 906 transition count 1372
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 906 transition count 1369
Applied a total of 55 rules in 133 ms. Remains 906 /932 variables (removed 26) and now considering 1369/1422 (removed 53) transitions.
// Phase 1: matrix 1369 rows 906 cols
[2023-03-15 12:14:30] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-15 12:14:30] [INFO ] Implicit Places using invariants in 779 ms returned []
[2023-03-15 12:14:30] [INFO ] Invariant cache hit.
[2023-03-15 12:14:32] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2540 ms to find 0 implicit places.
[2023-03-15 12:14:32] [INFO ] Invariant cache hit.
[2023-03-15 12:14:34] [INFO ] Dead Transitions using invariants and state equation in 1568 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 906/932 places, 1369/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4243 ms. Remains : 906/932 places, 1369/1422 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s536 1), p0:(AND (EQ s306 1) (EQ s361 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-11 finished in 4442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))||G(p1))))))'
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 919 transition count 1393
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 919 transition count 1393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 911 transition count 1378
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 911 transition count 1378
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 907 transition count 1364
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 907 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 904 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 904 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 903 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 903 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 902 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 902 transition count 1357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 902 transition count 1354
Applied a total of 63 rules in 220 ms. Remains 902 /932 variables (removed 30) and now considering 1354/1422 (removed 68) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2023-03-15 12:14:34] [INFO ] Computed 66 place invariants in 4 ms
[2023-03-15 12:14:35] [INFO ] Implicit Places using invariants in 829 ms returned []
[2023-03-15 12:14:35] [INFO ] Invariant cache hit.
[2023-03-15 12:14:37] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 2410 ms to find 0 implicit places.
[2023-03-15 12:14:37] [INFO ] Invariant cache hit.
[2023-03-15 12:14:38] [INFO ] Dead Transitions using invariants and state equation in 1309 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/932 places, 1354/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3942 ms. Remains : 902/932 places, 1354/1422 transitions.
Stuttering acceptance computed with spot in 290 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s299 1) (EQ s350 1)), p0:(EQ s168 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 229 reset in 327 ms.
Product exploration explored 100000 steps with 226 reset in 369 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 157 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 308 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)]
Incomplete random walk after 10000 steps, including 21 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 12:14:40] [INFO ] Invariant cache hit.
[2023-03-15 12:14:40] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 12:14:40] [INFO ] [Nat]Absence check using 66 positive place invariants in 62 ms returned sat
[2023-03-15 12:14:41] [INFO ] After 1099ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 12:14:42] [INFO ] After 1390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-15 12:14:42] [INFO ] After 1859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Drop transitions 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 902 transition count 1327
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 875 transition count 1327
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 54 place count 875 transition count 1231
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 246 place count 779 transition count 1231
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 270 place count 755 transition count 1081
Iterating global reduction 2 with 24 rules applied. Total rules applied 294 place count 755 transition count 1081
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 2 with 356 rules applied. Total rules applied 650 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 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 852 place count 476 transition count 933
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 932 place count 436 transition count 955
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 956 place count 436 transition count 931
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 979 place count 436 transition count 908
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1016 place count 413 transition count 894
Applied a total of 1016 rules in 199 ms. Remains 413 /902 variables (removed 489) and now considering 894/1354 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 413/902 places, 894/1354 transitions.
Finished random walk after 585 steps, including 3 resets, run visited all 2 properties in 14 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 252 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 246 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 220 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 17 ms. Remains 902 /902 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
[2023-03-15 12:14:43] [INFO ] Invariant cache hit.
[2023-03-15 12:14:43] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-03-15 12:14:43] [INFO ] Invariant cache hit.
[2023-03-15 12:14:45] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
[2023-03-15 12:14:45] [INFO ] Invariant cache hit.
[2023-03-15 12:14:46] [INFO ] Dead Transitions using invariants and state equation in 1463 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3344 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 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 226 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)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 12:14:47] [INFO ] Invariant cache hit.
[2023-03-15 12:14:47] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 12:14:47] [INFO ] [Nat]Absence check using 66 positive place invariants in 44 ms returned sat
[2023-03-15 12:14:48] [INFO ] After 785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 12:14:48] [INFO ] After 1007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-15 12:14:48] [INFO ] After 1373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Drop transitions 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 902 transition count 1327
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 875 transition count 1327
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 54 place count 875 transition count 1231
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 246 place count 779 transition count 1231
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 270 place count 755 transition count 1081
Iterating global reduction 2 with 24 rules applied. Total rules applied 294 place count 755 transition count 1081
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 650 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 2 with 202 rules applied. Total rules applied 852 place count 476 transition count 933
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 932 place count 436 transition count 955
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 956 place count 436 transition count 931
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 979 place count 436 transition count 908
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1016 place count 413 transition count 894
Applied a total of 1016 rules in 150 ms. Remains 413 /902 variables (removed 489) and now considering 894/1354 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 413/902 places, 894/1354 transitions.
Finished random walk after 316 steps, including 1 resets, run visited all 2 properties in 6 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 177 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 225 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 221 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 229 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 224 reset in 304 ms.
Product exploration explored 100000 steps with 227 reset in 345 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 216 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 5 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 1 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 0 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 0 ms
Drop 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 0 ms
Applied a total of 678 rules in 355 ms. Remains 795 /902 variables (removed 107) and now considering 1568/1354 (removed -214) transitions.
[2023-03-15 12:14:51] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 1568 rows 795 cols
[2023-03-15 12:14:51] [INFO ] Computed 66 place invariants in 10 ms
[2023-03-15 12:14:52] [INFO ] Dead Transitions using invariants and state equation in 1439 ms found 0 transitions.
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 1846 ms. Remains : 795/902 places, 1568/1354 transitions.
Built C files in :
/tmp/ltsmin5685455672283940958
[2023-03-15 12:14:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5685455672283940958
Running compilation step : cd /tmp/ltsmin5685455672283940958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5685455672283940958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5685455672283940958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 34 ms. Remains 902 /902 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2023-03-15 12:14:55] [INFO ] Computed 66 place invariants in 4 ms
[2023-03-15 12:14:56] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-15 12:14:56] [INFO ] Invariant cache hit.
[2023-03-15 12:14:58] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
[2023-03-15 12:14:58] [INFO ] Invariant cache hit.
[2023-03-15 12:14:59] [INFO ] Dead Transitions using invariants and state equation in 1363 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3597 ms. Remains : 902/902 places, 1354/1354 transitions.
Built C files in :
/tmp/ltsmin4244399292823789813
[2023-03-15 12:14:59] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4244399292823789813
Running compilation step : cd /tmp/ltsmin4244399292823789813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4244399292823789813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4244399292823789813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 12:15:02] [INFO ] Flatten gal took : 46 ms
[2023-03-15 12:15:02] [INFO ] Flatten gal took : 50 ms
[2023-03-15 12:15:02] [INFO ] Time to serialize gal into /tmp/LTL14095639361227199538.gal : 8 ms
[2023-03-15 12:15:02] [INFO ] Time to serialize properties into /tmp/LTL8915361423712077045.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14095639361227199538.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12213973758950210334.hoa' '-atoms' '/tmp/LTL8915361423712077045.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8915361423712077045.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12213973758950210334.hoa
Detected timeout of ITS tools.
[2023-03-15 12:15:17] [INFO ] Flatten gal took : 34 ms
[2023-03-15 12:15:17] [INFO ] Flatten gal took : 36 ms
[2023-03-15 12:15:17] [INFO ] Time to serialize gal into /tmp/LTL15521512622310489275.gal : 16 ms
[2023-03-15 12:15:17] [INFO ] Time to serialize properties into /tmp/LTL9641492968542449237.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15521512622310489275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9641492968542449237.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(p231==0)")))||(G("((p433==1)&&(p521==1))")))))))
Formula 0 simplified : XXX(FG!"(p231==0)" & F!"((p433==1)&&(p521==1))")
Detected timeout of ITS tools.
[2023-03-15 12:15:32] [INFO ] Flatten gal took : 36 ms
[2023-03-15 12:15:32] [INFO ] Applying decomposition
[2023-03-15 12:15:32] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13842075641488199789.txt' '-o' '/tmp/graph13842075641488199789.bin' '-w' '/tmp/graph13842075641488199789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13842075641488199789.bin' '-l' '-1' '-v' '-w' '/tmp/graph13842075641488199789.weights' '-q' '0' '-e' '0.001'
[2023-03-15 12:15:33] [INFO ] Decomposing Gal with order
[2023-03-15 12:15:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 12:15:33] [INFO ] Removed a total of 1298 redundant transitions.
[2023-03-15 12:15:33] [INFO ] Flatten gal took : 120 ms
[2023-03-15 12:15:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 183 labels/synchronizations in 33 ms.
[2023-03-15 12:15:33] [INFO ] Time to serialize gal into /tmp/LTL7298839762937804884.gal : 15 ms
[2023-03-15 12:15:33] [INFO ] Time to serialize properties into /tmp/LTL4324711429160155301.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7298839762937804884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4324711429160155301.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(i0.u58.p231==0)")))||(G("((i2.i0.i2.u109.p433==1)&&(i5.u129.p521==1))")))))))
Formula 0 simplified : XXX(FG!"(i0.u58.p231==0)" & F!"((i2.i0.i2.u109.p433==1)&&(i5.u129.p521==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2929352723884782254
[2023-03-15 12:15:48] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2929352723884782254
Running compilation step : cd /tmp/ltsmin2929352723884782254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2929352723884782254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2929352723884782254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 77011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 66 place count 898 transition count 1289
Deduced a syphon composed of 99 places in 3 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 264 place count 799 transition count 1289
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 300 place count 763 transition count 1111
Iterating global reduction 2 with 36 rules applied. Total rules applied 336 place count 763 transition count 1111
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 345 place count 754 transition count 1086
Iterating global reduction 2 with 9 rules applied. Total rules applied 354 place count 754 transition count 1086
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 355 place count 754 transition count 1085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 356 place count 753 transition count 1085
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 359 place count 750 transition count 1077
Iterating global reduction 4 with 3 rules applied. Total rules applied 362 place count 750 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 363 place count 749 transition count 1075
Iterating global reduction 4 with 1 rules applied. Total rules applied 364 place count 749 transition count 1075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 365 place count 749 transition count 1074
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 5 with 350 rules applied. Total rules applied 715 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 5 with 202 rules applied. Total rules applied 917 place count 473 transition count 929
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 5 with 78 rules applied. Total rules applied 995 place count 434 transition count 941
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 1019 place count 434 transition count 917
Applied a total of 1019 rules in 234 ms. Remains 434 /932 variables (removed 498) and now considering 917/1422 (removed 505) transitions.
// Phase 1: matrix 917 rows 434 cols
[2023-03-15 12:15:51] [INFO ] Computed 66 place invariants in 3 ms
[2023-03-15 12:15:52] [INFO ] Implicit Places using invariants in 844 ms returned [11, 46, 94, 133, 193, 274, 324, 363, 412]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 854 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/932 places, 917/1422 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 401 transition count 893
Applied a total of 48 rules in 22 ms. Remains 401 /425 variables (removed 24) and now considering 893/917 (removed 24) transitions.
// Phase 1: matrix 893 rows 401 cols
[2023-03-15 12:15:52] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 12:15:53] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-15 12:15:53] [INFO ] Invariant cache hit.
[2023-03-15 12:15:53] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-15 12:15:54] [INFO ] Implicit Places using invariants and state equation in 1271 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 401/932 places, 893/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2940 ms. Remains : 401/932 places, 893/1422 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s217 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-13 finished in 3015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F((G(p1)&&p0))))))))'
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 918 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 918 transition count 1392
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 909 transition count 1375
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 909 transition count 1375
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 905 transition count 1361
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 905 transition count 1361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 902 transition count 1357
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 902 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 901 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 901 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 900 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 900 transition count 1354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 900 transition count 1351
Applied a total of 67 rules in 205 ms. Remains 900 /932 variables (removed 32) and now considering 1351/1422 (removed 71) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2023-03-15 12:15:54] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-15 12:15:55] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2023-03-15 12:15:55] [INFO ] Invariant cache hit.
[2023-03-15 12:15:57] [INFO ] Implicit Places using invariants and state equation in 1826 ms returned []
Implicit Place search using SMT with State Equation took 2996 ms to find 0 implicit places.
[2023-03-15 12:15:57] [INFO ] Invariant cache hit.
[2023-03-15 12:15:59] [INFO ] Dead Transitions using invariants and state equation in 1476 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 900/932 places, 1351/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4678 ms. Remains : 900/932 places, 1351/1422 transitions.
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s429 1) (EQ s458 1)), p1:(NEQ s843 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 534 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-14 finished in 5123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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.202303021504/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 254 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 66 place count 898 transition count 1291
Deduced a syphon composed of 97 places in 6 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 260 place count 801 transition count 1291
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 295 place count 766 transition count 1118
Iterating global reduction 2 with 35 rules applied. Total rules applied 330 place count 766 transition count 1118
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 339 place count 757 transition count 1093
Iterating global reduction 2 with 9 rules applied. Total rules applied 348 place count 757 transition count 1093
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 757 transition count 1092
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 756 transition count 1092
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 352 place count 754 transition count 1087
Iterating global reduction 4 with 2 rules applied. Total rules applied 354 place count 754 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 355 place count 753 transition count 1085
Iterating global reduction 4 with 1 rules applied. Total rules applied 356 place count 753 transition count 1085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 357 place count 753 transition count 1084
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 5 with 350 rules applied. Total rules applied 707 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 5 with 202 rules applied. Total rules applied 909 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 5 with 76 rules applied. Total rules applied 985 place count 439 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 986 place count 438 transition count 958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 987 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 991 place count 435 transition count 956
Applied a total of 991 rules in 363 ms. Remains 435 /932 variables (removed 497) and now considering 956/1422 (removed 466) transitions.
// Phase 1: matrix 956 rows 435 cols
[2023-03-15 12:16:00] [INFO ] Computed 65 place invariants in 16 ms
[2023-03-15 12:16:01] [INFO ] Implicit Places using invariants in 1020 ms returned [10, 45, 93, 132, 192, 272, 322, 363]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1022 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 427/932 places, 956/1422 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 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 31 ms. Remains 405 /427 variables (removed 22) and now considering 934/956 (removed 22) transitions.
// Phase 1: matrix 934 rows 405 cols
[2023-03-15 12:16:01] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 12:16:02] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-15 12:16:02] [INFO ] Invariant cache hit.
[2023-03-15 12:16:02] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-15 12:16:03] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 405/932 places, 934/1422 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3284 ms. Remains : 405/932 places, 934/1422 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s159 1) (EQ s229 1)), p0:(AND (EQ s374 1) (EQ s401 1) (NOT (AND (EQ s335 1) (EQ s359 1)))), p2:(AND (EQ s335 1) (EQ s359 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 701 reset in 648 ms.
Product exploration explored 100000 steps with 686 reset in 600 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 (AND p0 p1 p2))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 566 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 210 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 12:16:05] [INFO ] Invariant cache hit.
[2023-03-15 12:16:06] [INFO ] [Real]Absence check using 57 positive place invariants in 38 ms returned sat
[2023-03-15 12:16:06] [INFO ] After 722ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 12:16:06] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2023-03-15 12:16:07] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 12:16:07] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-15 12:16:07] [INFO ] After 114ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-15 12:16:07] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-15 12:16:07] [INFO ] After 913ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 934/934 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 404 transition count 933
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4 place count 403 transition count 933
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 30 place count 403 transition count 907
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 54 place count 403 transition count 883
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 90 place count 379 transition count 871
Applied a total of 90 rules in 65 ms. Remains 379 /405 variables (removed 26) and now considering 871/934 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 379/405 places, 871/934 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 196066 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196066 steps, saw 60271 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 871 rows 379 cols
[2023-03-15 12:16:10] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-15 12:16:10] [INFO ] [Real]Absence check using 57 positive place invariants in 16 ms returned sat
[2023-03-15 12:16:11] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:16:11] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-15 12:16:11] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:16:11] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-15 12:16:11] [INFO ] After 108ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:16:11] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-15 12:16:12] [INFO ] After 797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 871/871 transitions.
Applied a total of 0 rules in 13 ms. Remains 379 /379 variables (removed 0) and now considering 871/871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 379/379 places, 871/871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 871/871 transitions.
Applied a total of 0 rules in 13 ms. Remains 379 /379 variables (removed 0) and now considering 871/871 (removed 0) transitions.
[2023-03-15 12:16:12] [INFO ] Invariant cache hit.
[2023-03-15 12:16:12] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-15 12:16:12] [INFO ] Invariant cache hit.
[2023-03-15 12:16:12] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-15 12:16:13] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
[2023-03-15 12:16:13] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 12:16:13] [INFO ] Invariant cache hit.
[2023-03-15 12:16:14] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2384 ms. Remains : 379/379 places, 871/871 transitions.
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 379 transition count 856
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 379 transition count 856
Applied a total of 18 rules in 33 ms. Remains 379 /379 variables (removed 0) and now considering 856/871 (removed 15) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 856 rows 379 cols
[2023-03-15 12:16:14] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 12:16:14] [INFO ] [Real]Absence check using 57 positive place invariants in 21 ms returned sat
[2023-03-15 12:16:15] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:16:15] [INFO ] [Nat]Absence check using 57 positive place invariants in 16 ms returned sat
[2023-03-15 12:16:15] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:16:15] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-15 12:16:15] [INFO ] After 519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 12 factoid took 1049 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 161 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 169 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 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 32 ms. Remains 405 /405 variables (removed 0) and now considering 908/934 (removed 26) transitions.
// Phase 1: matrix 908 rows 405 cols
[2023-03-15 12:16:16] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 12:16:17] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-15 12:16:17] [INFO ] Invariant cache hit.
[2023-03-15 12:16:18] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-15 12:16:18] [INFO ] Implicit Places using invariants and state equation in 1359 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
[2023-03-15 12:16:18] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-15 12:16:18] [INFO ] Invariant cache hit.
[2023-03-15 12:16:19] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
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 2845 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 p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 347 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 134 ms :[p0, (AND (NOT p1) p0), p0]
Finished random walk after 460 steps, including 2 resets, run visited all 3 properties in 30 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 7 factoid took 496 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 162 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 157 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 156 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 690 reset in 683 ms.
Product exploration explored 100000 steps with 677 reset in 498 ms.
Built C files in :
/tmp/ltsmin746003377449679601
[2023-03-15 12:16:22] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2023-03-15 12:16:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:16:22] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2023-03-15 12:16:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:16:22] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2023-03-15 12:16:22] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:16:22] [INFO ] Built C files in 182ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin746003377449679601
Running compilation step : cd /tmp/ltsmin746003377449679601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin746003377449679601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin746003377449679601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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 21 ms. Remains 405 /405 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2023-03-15 12:16:25] [INFO ] Invariant cache hit.
[2023-03-15 12:16:26] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-15 12:16:26] [INFO ] Invariant cache hit.
[2023-03-15 12:16:26] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-15 12:16:27] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
[2023-03-15 12:16:27] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-15 12:16:27] [INFO ] Invariant cache hit.
[2023-03-15 12:16:28] [INFO ] Dead Transitions using invariants and state equation in 902 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2859 ms. Remains : 405/405 places, 908/908 transitions.
Built C files in :
/tmp/ltsmin12316639279400672230
[2023-03-15 12:16:28] [INFO ] Computing symmetric may disable matrix : 908 transitions.
[2023-03-15 12:16:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:16:28] [INFO ] Computing symmetric may enable matrix : 908 transitions.
[2023-03-15 12:16:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:16:28] [INFO ] Computing Do-Not-Accords matrix : 908 transitions.
[2023-03-15 12:16:28] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:16:28] [INFO ] Built C files in 240ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12316639279400672230
Running compilation step : cd /tmp/ltsmin12316639279400672230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12316639279400672230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12316639279400672230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 12:16:31] [INFO ] Flatten gal took : 33 ms
[2023-03-15 12:16:31] [INFO ] Flatten gal took : 32 ms
[2023-03-15 12:16:31] [INFO ] Time to serialize gal into /tmp/LTL15446956063439045832.gal : 6 ms
[2023-03-15 12:16:31] [INFO ] Time to serialize properties into /tmp/LTL11964935971003532342.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15446956063439045832.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13742431314057006448.hoa' '-atoms' '/tmp/LTL11964935971003532342.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11964935971003532342.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13742431314057006448.hoa
Detected timeout of ITS tools.
[2023-03-15 12:16:47] [INFO ] Flatten gal took : 30 ms
[2023-03-15 12:16:47] [INFO ] Flatten gal took : 32 ms
[2023-03-15 12:16:47] [INFO ] Time to serialize gal into /tmp/LTL12317863466646447655.gal : 7 ms
[2023-03-15 12:16:47] [INFO ] Time to serialize properties into /tmp/LTL713142620376547908.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12317863466646447655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL713142620376547908.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))")))||(((F("(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))"))&&(G...220
Formula 0 simplified : G(FG!"(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))" & (G!"(((p1468!=1)||(p1537!=1))||((p1306==1)&&(p1407==1)))" | F!"((p615=...204
Detected timeout of ITS tools.
[2023-03-15 12:17:02] [INFO ] Flatten gal took : 44 ms
[2023-03-15 12:17:02] [INFO ] Applying decomposition
[2023-03-15 12:17:02] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14719041300786150495.txt' '-o' '/tmp/graph14719041300786150495.bin' '-w' '/tmp/graph14719041300786150495.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14719041300786150495.bin' '-l' '-1' '-v' '-w' '/tmp/graph14719041300786150495.weights' '-q' '0' '-e' '0.001'
[2023-03-15 12:17:02] [INFO ] Decomposing Gal with order
[2023-03-15 12:17:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 12:17:02] [INFO ] Removed a total of 699 redundant transitions.
[2023-03-15 12:17:02] [INFO ] Flatten gal took : 99 ms
[2023-03-15 12:17:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 659 labels/synchronizations in 107 ms.
[2023-03-15 12:17:02] [INFO ] Time to serialize gal into /tmp/LTL12527786051202222544.gal : 42 ms
[2023-03-15 12:17:02] [INFO ] Time to serialize properties into /tmp/LTL1637910439535960527.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12527786051202222544.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1637910439535960527.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((i8.u35.p1468!=1)||(i8.u39.p1537!=1))||((i7.u31.p1306==1)&&(i7.u33.p1407==1)))")))||(((F("(((i8.u35.p1468!=1)||(i8.u39.p1...310
Formula 0 simplified : G(FG!"(((i8.u35.p1468!=1)||(i8.u39.p1537!=1))||((i7.u31.p1306==1)&&(i7.u33.p1407==1)))" & (G!"(((i8.u35.p1468!=1)||(i8.u39.p1537!=1)...294
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin81572817409616324
[2023-03-15 12:17:17] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin81572817409616324
Running compilation step : cd /tmp/ltsmin81572817409616324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2943 ms.
Running link step : cd /tmp/ltsmin81572817409616324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin81572817409616324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&[]((LTLAPp1==true))&&X((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-6B-LTLFireability-10 finished in 93051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/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 285 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 932 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 66 place count 898 transition count 1290
Deduced a syphon composed of 98 places in 6 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 262 place count 800 transition count 1290
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 297 place count 765 transition count 1113
Iterating global reduction 2 with 35 rules applied. Total rules applied 332 place count 765 transition count 1113
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 340 place count 757 transition count 1090
Iterating global reduction 2 with 8 rules applied. Total rules applied 348 place count 757 transition count 1090
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 757 transition count 1089
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 756 transition count 1089
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 353 place count 753 transition count 1081
Iterating global reduction 4 with 3 rules applied. Total rules applied 356 place count 753 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 357 place count 752 transition count 1079
Iterating global reduction 4 with 1 rules applied. Total rules applied 358 place count 752 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 359 place count 752 transition count 1078
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 5 with 350 rules applied. Total rules applied 709 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 5 with 202 rules applied. Total rules applied 911 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 5 with 78 rules applied. Total rules applied 989 place count 437 transition count 945
Applied a total of 989 rules in 261 ms. Remains 437 /932 variables (removed 495) and now considering 945/1422 (removed 477) transitions.
// Phase 1: matrix 945 rows 437 cols
[2023-03-15 12:17:33] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-15 12:17:34] [INFO ] Implicit Places using invariants in 658 ms returned [11, 46, 96, 136, 197, 277, 327, 366, 415]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 675 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 428/932 places, 945/1422 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 25 ms. Remains 404 /428 variables (removed 24) and now considering 921/945 (removed 24) transitions.
// Phase 1: matrix 921 rows 404 cols
[2023-03-15 12:17:34] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 12:17:34] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-15 12:17:34] [INFO ] Invariant cache hit.
[2023-03-15 12:17:35] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-15 12:17:36] [INFO ] Implicit Places using invariants and state equation in 1289 ms returned []
Implicit Place search using SMT with State Equation took 1854 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 404/932 places, 921/1422 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2815 ms. Remains : 404/932 places, 921/1422 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s109 1) (EQ s135 1)), p0:(EQ s48 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 695 reset in 538 ms.
Product exploration explored 100000 steps with 692 reset in 538 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 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 218 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)]
Finished random walk after 1716 steps, including 12 resets, run visited all 3 properties in 36 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 244 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 388 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 524 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 6 ms. Remains 404 /404 variables (removed 0) and now considering 921/921 (removed 0) transitions.
[2023-03-15 12:17:38] [INFO ] Invariant cache hit.
[2023-03-15 12:17:39] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-15 12:17:39] [INFO ] Invariant cache hit.
[2023-03-15 12:17:39] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-15 12:17:40] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2023-03-15 12:17:40] [INFO ] Invariant cache hit.
[2023-03-15 12:17:41] [INFO ] Dead Transitions using invariants and state equation in 842 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2864 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 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)]
Finished random walk after 1242 steps, including 8 resets, run visited all 3 properties in 18 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 172 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 244 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 269 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 293 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 688 reset in 622 ms.
Product exploration explored 100000 steps with 692 reset in 486 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 320 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 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 29 ms. Remains 404 /404 variables (removed 0) and now considering 897/921 (removed 24) transitions.
[2023-03-15 12:17:44] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 897 rows 404 cols
[2023-03-15 12:17:44] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 12:17:45] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
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 1005 ms. Remains : 404/404 places, 897/921 transitions.
Built C files in :
/tmp/ltsmin3072321234227443401
[2023-03-15 12:17:45] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3072321234227443401
Running compilation step : cd /tmp/ltsmin3072321234227443401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2433 ms.
Running link step : cd /tmp/ltsmin3072321234227443401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3072321234227443401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16654195961050211908.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 4 ms. Remains 404 /404 variables (removed 0) and now considering 921/921 (removed 0) transitions.
// Phase 1: matrix 921 rows 404 cols
[2023-03-15 12:18:00] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 12:18:00] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-15 12:18:00] [INFO ] Invariant cache hit.
[2023-03-15 12:18:01] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-15 12:18:02] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
[2023-03-15 12:18:02] [INFO ] Invariant cache hit.
[2023-03-15 12:18:03] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2526 ms. Remains : 404/404 places, 921/921 transitions.
Built C files in :
/tmp/ltsmin13683941622440855558
[2023-03-15 12:18:03] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13683941622440855558
Running compilation step : cd /tmp/ltsmin13683941622440855558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2444 ms.
Running link step : cd /tmp/ltsmin13683941622440855558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13683941622440855558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6275323981321790832.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 12:18:18] [INFO ] Flatten gal took : 30 ms
[2023-03-15 12:18:18] [INFO ] Flatten gal took : 29 ms
[2023-03-15 12:18:18] [INFO ] Time to serialize gal into /tmp/LTL8172908053155624720.gal : 5 ms
[2023-03-15 12:18:18] [INFO ] Time to serialize properties into /tmp/LTL14915996262195353627.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8172908053155624720.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13874619593109262384.hoa' '-atoms' '/tmp/LTL14915996262195353627.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14915996262195353627.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13874619593109262384.hoa
Detected timeout of ITS tools.
[2023-03-15 12:18:33] [INFO ] Flatten gal took : 51 ms
[2023-03-15 12:18:33] [INFO ] Flatten gal took : 44 ms
[2023-03-15 12:18:33] [INFO ] Time to serialize gal into /tmp/LTL17178074525787645532.gal : 21 ms
[2023-03-15 12:18:33] [INFO ] Time to serialize properties into /tmp/LTL10417005554074004825.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17178074525787645532.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10417005554074004825.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(p231==0)")))||(G("((p433==1)&&(p521==1))")))))))
Formula 0 simplified : XXX(FG!"(p231==0)" & F!"((p433==1)&&(p521==1))")
Detected timeout of ITS tools.
[2023-03-15 12:18:48] [INFO ] Flatten gal took : 39 ms
[2023-03-15 12:18:48] [INFO ] Applying decomposition
[2023-03-15 12:18:48] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2529972418678836187.txt' '-o' '/tmp/graph2529972418678836187.bin' '-w' '/tmp/graph2529972418678836187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2529972418678836187.bin' '-l' '-1' '-v' '-w' '/tmp/graph2529972418678836187.weights' '-q' '0' '-e' '0.001'
[2023-03-15 12:18:48] [INFO ] Decomposing Gal with order
[2023-03-15 12:18:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 12:18:48] [INFO ] Removed a total of 489 redundant transitions.
[2023-03-15 12:18:48] [INFO ] Flatten gal took : 107 ms
[2023-03-15 12:18:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 554 labels/synchronizations in 27 ms.
[2023-03-15 12:18:49] [INFO ] Time to serialize gal into /tmp/LTL715044869833658515.gal : 22 ms
[2023-03-15 12:18:49] [INFO ] Time to serialize properties into /tmp/LTL9711113954568107035.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL715044869833658515.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9711113954568107035.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(i1.u5.p231==0)")))||(G("((i3.u11.p433==1)&&(i3.u11.p521==1))")))))))
Formula 0 simplified : XXX(FG!"(i1.u5.p231==0)" & F!"((i3.u11.p433==1)&&(i3.u11.p521==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7977954368594600808
[2023-03-15 12:19:04] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7977954368594600808
Running compilation step : cd /tmp/ltsmin7977954368594600808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2425 ms.
Running link step : cd /tmp/ltsmin7977954368594600808;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7977954368594600808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(([](<>((LTLAPp0==true)))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 106378 ms.
[2023-03-15 12:19:19] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9091892550292186794
[2023-03-15 12:19:19] [INFO ] Computing symmetric may disable matrix : 1422 transitions.
[2023-03-15 12:19:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:19:19] [INFO ] Computing symmetric may enable matrix : 1422 transitions.
[2023-03-15 12:19:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:19:19] [INFO ] Applying decomposition
[2023-03-15 12:19:19] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12850825228776414909.txt' '-o' '/tmp/graph12850825228776414909.bin' '-w' '/tmp/graph12850825228776414909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12850825228776414909.bin' '-l' '-1' '-v' '-w' '/tmp/graph12850825228776414909.weights' '-q' '0' '-e' '0.001'
[2023-03-15 12:19:19] [INFO ] Decomposing Gal with order
[2023-03-15 12:19:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 12:19:19] [INFO ] Removed a total of 1399 redundant transitions.
[2023-03-15 12:19:19] [INFO ] Flatten gal took : 92 ms
[2023-03-15 12:19:19] [INFO ] Computing Do-Not-Accords matrix : 1422 transitions.
[2023-03-15 12:19:19] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 12:19:19] [INFO ] Built C files in 388ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9091892550292186794
Running compilation step : cd /tmp/ltsmin9091892550292186794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-15 12:19:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 102 ms.
[2023-03-15 12:19:19] [INFO ] Time to serialize gal into /tmp/LTLFireability8160633534414527565.gal : 16 ms
[2023-03-15 12:19:19] [INFO ] Time to serialize properties into /tmp/LTLFireability8114947908280710729.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8160633534414527565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8114947908280710729.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F((G("((i3.i5.u120.p436==0)||(i3.i4.u139.p521==0))"))||(X(("(i6.i1.u193.p808==0)")&&(G(F("(i6.i1.u193.p808==0)"))))))))
Formula 0 simplified : G(F!"((i3.i5.u120.p436==0)||(i3.i4.u139.p521==0))" & X(!"(i6.i1.u193.p808==0)" | FG!"(i6.i1.u193.p808==0)"))
Compilation finished in 7405 ms.
Running link step : cd /tmp/ltsmin9091892550292186794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin9091892550292186794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(((LTLAPp1==true)&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin9091892550292186794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(((LTLAPp1==true)&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9091892550292186794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(!(LTLAPp2==true)))||(<>(!(LTLAPp2==true))&&[]((LTLAPp3==true))&&X(!(LTLAPp4==true)))))' '--buchi-type=spotba'
LTSmin run took 18586 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9091892550292186794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(([](<>((LTLAPp5==true)))||[]((LTLAPp6==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-15 12:42:23] [INFO ] Applying decomposition
[2023-03-15 12:42:23] [INFO ] Flatten gal took : 108 ms
[2023-03-15 12:42:23] [INFO ] Decomposing Gal with order
[2023-03-15 12:42:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 12:42:23] [INFO ] Removed a total of 962 redundant transitions.
[2023-03-15 12:42:23] [INFO ] Flatten gal took : 199 ms
[2023-03-15 12:42:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2109 labels/synchronizations in 313 ms.
[2023-03-15 12:42:24] [INFO ] Time to serialize gal into /tmp/LTLFireability12835692227346494818.gal : 44 ms
[2023-03-15 12:42:24] [INFO ] Time to serialize properties into /tmp/LTLFireability17647972804515900446.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12835692227346494818.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17647972804515900446.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((F((G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....552
Formula 0 simplified : G(F!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...540
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin9091892550292186794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(([](<>((LTLAPp5==true)))||[]((LTLAPp6==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin9091892550292186794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||X(((LTLAPp1==true)&&[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-15 13:05:28] [INFO ] Flatten gal took : 87 ms
[2023-03-15 13:05:28] [INFO ] Input system was already deterministic with 1422 transitions.
[2023-03-15 13:05:28] [INFO ] Transformed 932 places.
[2023-03-15 13:05:28] [INFO ] Transformed 1422 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 13:05:28] [INFO ] Time to serialize gal into /tmp/LTLFireability16024000982195016167.gal : 13 ms
[2023-03-15 13:05:28] [INFO ] Time to serialize properties into /tmp/LTLFireability2058152598479264233.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16024000982195016167.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2058152598479264233.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("((p436==0)||(p521==0))"))||(X(("(p808==0)")&&(G(F("(p808==0)"))))))))
Formula 0 simplified : G(F!"((p436==0)||(p521==0))" & X(!"(p808==0)" | FG!"(p808==0)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 11863948 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16029136 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r261-smll-167863536200316"
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 ;