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.r265-smll-167863539800300.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 ltsminxred
Input is NoC3x3-PT-5B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539800300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 10:14 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.4K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 525K 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-5B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-5B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678925511253

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 00:11:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 00:11:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 00:11:54] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2023-03-16 00:11:54] [INFO ] Transformed 1571 places.
[2023-03-16 00:11:54] [INFO ] Transformed 2173 transitions.
[2023-03-16 00:11:54] [INFO ] Found NUPN structural information;
[2023-03-16 00:11:54] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA NoC3x3-PT-5B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 1571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Discarding 437 places :
Symmetric choice reduction at 0 with 437 rule applications. Total rules 437 place count 1134 transition count 1736
Iterating global reduction 0 with 437 rules applied. Total rules applied 874 place count 1134 transition count 1736
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 993 place count 1015 transition count 1609
Iterating global reduction 0 with 119 rules applied. Total rules applied 1112 place count 1015 transition count 1609
Discarding 92 places :
Symmetric choice reduction at 0 with 92 rule applications. Total rules 1204 place count 923 transition count 1452
Iterating global reduction 0 with 92 rules applied. Total rules applied 1296 place count 923 transition count 1452
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 1319 place count 900 transition count 1406
Iterating global reduction 0 with 23 rules applied. Total rules applied 1342 place count 900 transition count 1406
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 1347 place count 895 transition count 1396
Iterating global reduction 0 with 5 rules applied. Total rules applied 1352 place count 895 transition count 1396
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 1357 place count 890 transition count 1391
Iterating global reduction 0 with 5 rules applied. Total rules applied 1362 place count 890 transition count 1391
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1364 place count 888 transition count 1387
Iterating global reduction 0 with 2 rules applied. Total rules applied 1366 place count 888 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1367 place count 887 transition count 1384
Iterating global reduction 0 with 1 rules applied. Total rules applied 1368 place count 887 transition count 1384
Applied a total of 1368 rules in 555 ms. Remains 887 /1571 variables (removed 684) and now considering 1384/2173 (removed 789) transitions.
// Phase 1: matrix 1384 rows 887 cols
[2023-03-16 00:11:55] [INFO ] Computed 66 place invariants in 40 ms
[2023-03-16 00:11:56] [INFO ] Implicit Places using invariants in 865 ms returned []
[2023-03-16 00:11:56] [INFO ] Invariant cache hit.
[2023-03-16 00:11:57] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned []
Implicit Place search using SMT with State Equation took 2303 ms to find 0 implicit places.
[2023-03-16 00:11:57] [INFO ] Invariant cache hit.
[2023-03-16 00:11:59] [INFO ] Dead Transitions using invariants and state equation in 1445 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 887/1571 places, 1384/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4305 ms. Remains : 887/1571 places, 1384/2173 transitions.
Support contains 43 out of 887 places after structural reductions.
[2023-03-16 00:11:59] [INFO ] Flatten gal took : 206 ms
[2023-03-16 00:11:59] [INFO ] Flatten gal took : 104 ms
[2023-03-16 00:12:00] [INFO ] Input system was already deterministic with 1384 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 739 ms. (steps per millisecond=13 ) properties (out of 27) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-16 00:12:01] [INFO ] Invariant cache hit.
[2023-03-16 00:12:01] [INFO ] [Real]Absence check using 66 positive place invariants in 62 ms returned sat
[2023-03-16 00:12:01] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 00:12:01] [INFO ] [Nat]Absence check using 66 positive place invariants in 48 ms returned sat
[2023-03-16 00:12:03] [INFO ] After 1175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-16 00:12:03] [INFO ] After 1845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 340 ms.
[2023-03-16 00:12:04] [INFO ] After 2650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 1 properties in 118 ms.
Support contains 9 out of 887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 887 transition count 1318
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 821 transition count 1318
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 132 place count 821 transition count 1283
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 202 place count 786 transition count 1283
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 232 place count 756 transition count 1178
Iterating global reduction 2 with 30 rules applied. Total rules applied 262 place count 756 transition count 1178
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 264 place count 754 transition count 1173
Iterating global reduction 2 with 2 rules applied. Total rules applied 266 place count 754 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 267 place count 753 transition count 1170
Iterating global reduction 2 with 1 rules applied. Total rules applied 268 place count 753 transition count 1170
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 1 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 2 with 388 rules applied. Total rules applied 656 place count 559 transition count 976
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 659 place count 559 transition count 973
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 3 with 202 rules applied. Total rules applied 861 place count 458 transition count 1005
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 875 place count 458 transition count 991
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 945 place count 423 transition count 999
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 1006 place count 423 transition count 938
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1015 place count 414 transition count 938
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1015 place count 414 transition count 933
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1025 place count 409 transition count 933
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 1061 place count 391 transition count 915
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1063 place count 390 transition count 917
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1065 place count 390 transition count 915
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1067 place count 388 transition count 915
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1069 place count 388 transition count 913
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1074 place count 388 transition count 913
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1075 place count 387 transition count 912
Applied a total of 1075 rules in 503 ms. Remains 387 /887 variables (removed 500) and now considering 912/1384 (removed 472) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 503 ms. Remains : 387/887 places, 912/1384 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 00:12:05] [INFO ] Flow matrix only has 910 transitions (discarded 2 similar events)
// Phase 1: matrix 910 rows 387 cols
[2023-03-16 00:12:05] [INFO ] Computed 57 place invariants in 10 ms
[2023-03-16 00:12:05] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 00:12:05] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 00:12:05] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 00:12:06] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 00:12:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-16 00:12:06] [INFO ] After 109ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-16 00:12:06] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-16 00:12:06] [INFO ] After 922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 ms.
Support contains 5 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 912/912 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 387 transition count 910
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 385 transition count 910
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 2 with 2 rules applied. Total rules applied 6 place count 384 transition count 909
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 383 transition count 909
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 383 transition count 907
Applied a total of 10 rules in 47 ms. Remains 383 /387 variables (removed 4) and now considering 907/912 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 383/387 places, 907/912 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) 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.
[2023-03-16 00:12:07] [INFO ] Flow matrix only has 905 transitions (discarded 2 similar events)
// Phase 1: matrix 905 rows 383 cols
[2023-03-16 00:12:07] [INFO ] Computed 57 place invariants in 12 ms
[2023-03-16 00:12:07] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-16 00:12:07] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 00:12:07] [INFO ] [Nat]Absence check using 57 positive place invariants in 16 ms returned sat
[2023-03-16 00:12:08] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 00:12:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-16 00:12:08] [INFO ] After 64ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 00:12:08] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-16 00:12:08] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 907/907 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 383 transition count 906
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 382 transition count 906
Applied a total of 2 rules in 29 ms. Remains 382 /383 variables (removed 1) and now considering 906/907 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 382/383 places, 906/907 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 00:12:08] [INFO ] Flow matrix only has 904 transitions (discarded 2 similar events)
// Phase 1: matrix 904 rows 382 cols
[2023-03-16 00:12:08] [INFO ] Computed 57 place invariants in 9 ms
[2023-03-16 00:12:08] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-16 00:12:08] [INFO ] After 331ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 00:12:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-16 00:12:09] [INFO ] After 40ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:12:09] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:12:09] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 00:12:09] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:12:09] [INFO ] After 43ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 00:12:09] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-16 00:12:09] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 906/906 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 381 transition count 901
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 381 transition count 901
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 381 transition count 900
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 381 transition count 899
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 7 place count 380 transition count 897
Applied a total of 7 rules in 45 ms. Remains 380 /382 variables (removed 2) and now considering 897/906 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 380/382 places, 897/906 transitions.
Incomplete random walk after 10000 steps, including 47 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 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 287507 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 287507 steps, saw 66560 distinct states, run finished after 3005 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 00:12:12] [INFO ] Flow matrix only has 895 transitions (discarded 2 similar events)
// Phase 1: matrix 895 rows 380 cols
[2023-03-16 00:12:12] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-16 00:12:12] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 00:12:13] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:12:13] [INFO ] [Nat]Absence check using 57 positive place invariants in 22 ms returned sat
[2023-03-16 00:12:13] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:12:13] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-16 00:12:13] [INFO ] After 54ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 00:12:13] [INFO ] After 113ms 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-16 00:12:13] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 897/897 transitions.
Applied a total of 0 rules in 11 ms. Remains 380 /380 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 380/380 places, 897/897 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 897/897 transitions.
Applied a total of 0 rules in 11 ms. Remains 380 /380 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2023-03-16 00:12:13] [INFO ] Flow matrix only has 895 transitions (discarded 2 similar events)
[2023-03-16 00:12:13] [INFO ] Invariant cache hit.
[2023-03-16 00:12:14] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-16 00:12:14] [INFO ] Flow matrix only has 895 transitions (discarded 2 similar events)
[2023-03-16 00:12:14] [INFO ] Invariant cache hit.
[2023-03-16 00:12:14] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-16 00:12:14] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2023-03-16 00:12:15] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-16 00:12:15] [INFO ] Flow matrix only has 895 transitions (discarded 2 similar events)
[2023-03-16 00:12:15] [INFO ] Invariant cache hit.
[2023-03-16 00:12:15] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1860 ms. Remains : 380/380 places, 897/897 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 380 transition count 895
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 1 with 23 rules applied. Total rules applied 25 place count 380 transition count 872
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 378 transition count 866
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 378 transition count 866
Applied a total of 29 rules in 29 ms. Remains 378 /380 variables (removed 2) and now considering 866/897 (removed 31) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 866 rows 378 cols
[2023-03-16 00:12:15] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-16 00:12:15] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 00:12:16] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:12:16] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 00:12:16] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:12:16] [INFO ] After 386ms 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-16 00:12:16] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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)||X(X(F(p1)))))))'
Support contains 3 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 874 transition count 1363
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 874 transition count 1363
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 869 transition count 1355
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 869 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 868 transition count 1353
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 868 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 867 transition count 1350
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 867 transition count 1350
Applied a total of 40 rules in 96 ms. Remains 867 /887 variables (removed 20) and now considering 1350/1384 (removed 34) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2023-03-16 00:12:17] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-16 00:12:17] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-16 00:12:17] [INFO ] Invariant cache hit.
[2023-03-16 00:12:19] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1830 ms to find 0 implicit places.
[2023-03-16 00:12:19] [INFO ] Invariant cache hit.
[2023-03-16 00:12:20] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 867/887 places, 1350/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2968 ms. Remains : 867/887 places, 1350/1384 transitions.
Stuttering acceptance computed with spot in 432 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p1:(AND (EQ s238 1) (EQ s284 1)), p0:(EQ s255 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][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 535 steps with 0 reset in 11 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-01 finished in 3510 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' '!(((p0 U G(p1)) U p2))'
Support contains 6 out of 887 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 886 transition count 1316
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 819 transition count 1316
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 134 place count 819 transition count 1281
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 204 place count 784 transition count 1281
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 235 place count 753 transition count 1175
Iterating global reduction 2 with 31 rules applied. Total rules applied 266 place count 753 transition count 1175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 266 place count 753 transition count 1174
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 268 place count 752 transition count 1174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 271 place count 749 transition count 1164
Iterating global reduction 2 with 3 rules applied. Total rules applied 274 place count 749 transition count 1164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 275 place count 748 transition count 1161
Iterating global reduction 2 with 1 rules applied. Total rules applied 276 place count 748 transition count 1161
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 1 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 2 with 386 rules applied. Total rules applied 662 place count 555 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 665 place count 555 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 867 place count 454 transition count 995
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 881 place count 454 transition count 981
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 951 place count 419 transition count 989
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 1013 place count 419 transition count 927
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1022 place count 410 transition count 927
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1022 place count 410 transition count 922
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1032 place count 405 transition count 922
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1070 place count 386 transition count 903
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1071 place count 386 transition count 903
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1072 place count 385 transition count 902
Applied a total of 1072 rules in 263 ms. Remains 385 /887 variables (removed 502) and now considering 902/1384 (removed 482) transitions.
// Phase 1: matrix 902 rows 385 cols
[2023-03-16 00:12:20] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-16 00:12:21] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-16 00:12:21] [INFO ] Invariant cache hit.
[2023-03-16 00:12:21] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-16 00:12:21] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
[2023-03-16 00:12:21] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-16 00:12:21] [INFO ] Invariant cache hit.
[2023-03-16 00:12:22] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 385/887 places, 902/1384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1954 ms. Remains : 385/887 places, 902/1384 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s208 1) (EQ s241 1) (EQ s270 1)), p1:(NEQ s255 1), p0:(AND (EQ s235 1) (EQ s263 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 61 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-02 finished in 2146 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' '!((G((F(p0)&&F(G(p1))))&&(!p2 U (p3||G(!p2)))))'
Support contains 7 out of 887 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 886 transition count 1316
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 819 transition count 1315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 818 transition count 1315
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 136 place count 818 transition count 1280
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 206 place count 783 transition count 1280
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 236 place count 753 transition count 1175
Iterating global reduction 3 with 30 rules applied. Total rules applied 266 place count 753 transition count 1175
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 266 place count 753 transition count 1174
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 268 place count 752 transition count 1174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 271 place count 749 transition count 1164
Iterating global reduction 3 with 3 rules applied. Total rules applied 274 place count 749 transition count 1164
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 275 place count 748 transition count 1161
Iterating global reduction 3 with 1 rules applied. Total rules applied 276 place count 748 transition count 1161
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Deduced a syphon composed of 192 places in 0 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 3 with 384 rules applied. Total rules applied 660 place count 556 transition count 969
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 664 place count 556 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 866 place count 455 transition count 991
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 880 place count 455 transition count 977
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 950 place count 420 transition count 985
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 5 with 60 rules applied. Total rules applied 1010 place count 420 transition count 925
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1018 place count 412 transition count 925
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 1018 place count 412 transition count 922
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1024 place count 409 transition count 922
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 1062 place count 390 transition count 903
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1063 place count 389 transition count 902
Applied a total of 1063 rules in 242 ms. Remains 389 /887 variables (removed 498) and now considering 902/1384 (removed 482) transitions.
// Phase 1: matrix 902 rows 389 cols
[2023-03-16 00:12:22] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-16 00:12:23] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-16 00:12:23] [INFO ] Invariant cache hit.
[2023-03-16 00:12:23] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-16 00:12:24] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
[2023-03-16 00:12:24] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-16 00:12:24] [INFO ] Invariant cache hit.
[2023-03-16 00:12:24] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 389/887 places, 902/1384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2207 ms. Remains : 389/887 places, 902/1384 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), true, (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p3) p2)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(OR p3 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (NOT (AND (EQ s112 1) (EQ s138 1))) (NOT (AND (EQ s106 1) (EQ s131 1)))), p2:(AND (EQ s106 1) (EQ s131 1)), p0:(EQ s218 0), p1:(AND (OR (EQ s10 0)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 478 reset in 692 ms.
Stack based approach found an accepted trace after 29226 steps with 143 reset with depth 203 and stack size 203 in 206 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-03 finished in 3405 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)&&G(F(p1)))))'
Support contains 3 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 876 transition count 1366
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 876 transition count 1366
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 872 transition count 1359
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 872 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 871 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 871 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 870 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 870 transition count 1354
Applied a total of 34 rules in 92 ms. Remains 870 /887 variables (removed 17) and now considering 1354/1384 (removed 30) transitions.
// Phase 1: matrix 1354 rows 870 cols
[2023-03-16 00:12:26] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-16 00:12:26] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-16 00:12:26] [INFO ] Invariant cache hit.
[2023-03-16 00:12:27] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1669 ms to find 0 implicit places.
[2023-03-16 00:12:27] [INFO ] Invariant cache hit.
[2023-03-16 00:12:29] [INFO ] Dead Transitions using invariants and state equation in 1230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 870/887 places, 1354/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3004 ms. Remains : 870/887 places, 1354/1384 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s418 0) (EQ s442 0)), p1:(EQ s126 1)], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 578 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-04 finished in 3266 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' '!(G((X(G(p0))&&F(p1))))'
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 876 transition count 1365
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 876 transition count 1365
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 873 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 873 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 872 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 872 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 871 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 871 transition count 1355
Applied a total of 32 rules in 94 ms. Remains 871 /887 variables (removed 16) and now considering 1355/1384 (removed 29) transitions.
// Phase 1: matrix 1355 rows 871 cols
[2023-03-16 00:12:29] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-16 00:12:29] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-16 00:12:29] [INFO ] Invariant cache hit.
[2023-03-16 00:12:31] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
[2023-03-16 00:12:31] [INFO ] Invariant cache hit.
[2023-03-16 00:12:32] [INFO ] Dead Transitions using invariants and state equation in 1356 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 871/887 places, 1355/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3218 ms. Remains : 871/887 places, 1355/1384 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s325 1), p0:(EQ s266 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 563 steps with 1 reset in 2 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-05 finished in 3394 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&&(G((p1||X(p1)))||X(G(p2))))))'
Support contains 4 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 874 transition count 1363
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 874 transition count 1363
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 869 transition count 1355
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 869 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 868 transition count 1353
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 868 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 867 transition count 1350
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 867 transition count 1350
Applied a total of 40 rules in 90 ms. Remains 867 /887 variables (removed 20) and now considering 1350/1384 (removed 34) transitions.
// Phase 1: matrix 1350 rows 867 cols
[2023-03-16 00:12:32] [INFO ] Computed 66 place invariants in 9 ms
[2023-03-16 00:12:33] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-03-16 00:12:33] [INFO ] Invariant cache hit.
[2023-03-16 00:12:34] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1826 ms to find 0 implicit places.
[2023-03-16 00:12:34] [INFO ] Invariant cache hit.
[2023-03-16 00:12:35] [INFO ] Dead Transitions using invariants and state equation in 906 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 867/887 places, 1350/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2824 ms. Remains : 867/887 places, 1350/1384 transitions.
Stuttering acceptance computed with spot in 301 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=4, aps=[p0:(EQ s375 1), p1:(EQ s517 1), p2:(AND (EQ s653 1) (EQ s685 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][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-08 finished in 3155 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 1 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 875 transition count 1364
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 875 transition count 1364
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 870 transition count 1356
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 870 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 869 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 869 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 868 transition count 1351
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 868 transition count 1351
Applied a total of 38 rules in 90 ms. Remains 868 /887 variables (removed 19) and now considering 1351/1384 (removed 33) transitions.
// Phase 1: matrix 1351 rows 868 cols
[2023-03-16 00:12:36] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-16 00:12:36] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-16 00:12:36] [INFO ] Invariant cache hit.
[2023-03-16 00:12:37] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
[2023-03-16 00:12:37] [INFO ] Invariant cache hit.
[2023-03-16 00:12:38] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 868/887 places, 1351/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2933 ms. Remains : 868/887 places, 1351/1384 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s700 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 575 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-10 finished in 3032 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(F((X(p0)&&F(p1))))))'
Support contains 5 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 875 transition count 1365
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 875 transition count 1365
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 871 transition count 1358
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 871 transition count 1358
Applied a total of 32 rules in 54 ms. Remains 871 /887 variables (removed 16) and now considering 1358/1384 (removed 26) transitions.
// Phase 1: matrix 1358 rows 871 cols
[2023-03-16 00:12:39] [INFO ] Computed 66 place invariants in 4 ms
[2023-03-16 00:12:39] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-16 00:12:39] [INFO ] Invariant cache hit.
[2023-03-16 00:12:40] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2023-03-16 00:12:40] [INFO ] Invariant cache hit.
[2023-03-16 00:12:41] [INFO ] Dead Transitions using invariants and state equation in 931 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 871/887 places, 1358/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2772 ms. Remains : 871/887 places, 1358/1384 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-11 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=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s713 1) (EQ s784 1)) (EQ s189 1)), p0:(AND (EQ s82 1) (EQ s96 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 514 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-11 finished in 3032 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||F(p2))))))'
Support contains 5 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 875 transition count 1365
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 875 transition count 1365
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 870 transition count 1357
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 870 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 869 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 869 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 868 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 868 transition count 1352
Applied a total of 38 rules in 86 ms. Remains 868 /887 variables (removed 19) and now considering 1352/1384 (removed 32) transitions.
// Phase 1: matrix 1352 rows 868 cols
[2023-03-16 00:12:42] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-16 00:12:42] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-03-16 00:12:42] [INFO ] Invariant cache hit.
[2023-03-16 00:12:43] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1808 ms to find 0 implicit places.
[2023-03-16 00:12:43] [INFO ] Invariant cache hit.
[2023-03-16 00:12:45] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 868/887 places, 1352/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3217 ms. Remains : 868/887 places, 1352/1384 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s75 1) (EQ s119 1)), p1:(AND (EQ s382 1) (EQ s494 1) (EQ s339 0)), p2:(AND (EQ s382 1) (EQ s494 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 635 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-13 finished in 3324 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' '!(G((F(p0)&&F((G(p1)||X(F(p2)))))))'
Support contains 4 out of 887 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 886 transition count 1315
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 818 transition count 1315
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 136 place count 818 transition count 1280
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 206 place count 783 transition count 1280
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 238 place count 751 transition count 1171
Iterating global reduction 2 with 32 rules applied. Total rules applied 270 place count 751 transition count 1171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 270 place count 751 transition count 1170
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 272 place count 750 transition count 1170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 275 place count 747 transition count 1160
Iterating global reduction 2 with 3 rules applied. Total rules applied 278 place count 747 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 279 place count 746 transition count 1157
Iterating global reduction 2 with 1 rules applied. Total rules applied 280 place count 746 transition count 1157
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 191
Deduced a syphon composed of 191 places in 0 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 2 with 382 rules applied. Total rules applied 662 place count 555 transition count 966
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 665 place count 555 transition count 963
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
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 867 place count 454 transition count 991
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 881 place count 454 transition count 977
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 953 place count 418 transition count 985
Drop transitions removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 4 with 63 rules applied. Total rules applied 1016 place count 418 transition count 922
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1025 place count 409 transition count 922
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1025 place count 409 transition count 917
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1035 place count 404 transition count 917
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1073 place count 385 transition count 898
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1075 place count 385 transition count 898
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1076 place count 384 transition count 897
Applied a total of 1076 rules in 228 ms. Remains 384 /887 variables (removed 503) and now considering 897/1384 (removed 487) transitions.
// Phase 1: matrix 897 rows 384 cols
[2023-03-16 00:12:45] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 00:12:46] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-16 00:12:46] [INFO ] Invariant cache hit.
[2023-03-16 00:12:46] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-16 00:12:46] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2023-03-16 00:12:46] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-16 00:12:46] [INFO ] Invariant cache hit.
[2023-03-16 00:12:47] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 384/887 places, 897/1384 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2059 ms. Remains : 384/887 places, 897/1384 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s318 1) (EQ s323 1)), p1:(EQ s343 1), p2:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 355 steps with 1 reset in 2 ms.
FORMULA NoC3x3-PT-5B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLFireability-14 finished in 2233 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' '!((!p0&&X((!p0&&G((!p0||G(p1)))))))'
Support contains 3 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 875 transition count 1365
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 875 transition count 1365
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 871 transition count 1360
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 871 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 870 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 870 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 869 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 869 transition count 1355
Applied a total of 36 rules in 84 ms. Remains 869 /887 variables (removed 18) and now considering 1355/1384 (removed 29) transitions.
// Phase 1: matrix 1355 rows 869 cols
[2023-03-16 00:12:47] [INFO ] Computed 66 place invariants in 9 ms
[2023-03-16 00:12:48] [INFO ] Implicit Places using invariants in 535 ms returned []
[2023-03-16 00:12:48] [INFO ] Invariant cache hit.
[2023-03-16 00:12:49] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1744 ms to find 0 implicit places.
[2023-03-16 00:12:49] [INFO ] Invariant cache hit.
[2023-03-16 00:12:50] [INFO ] Dead Transitions using invariants and state equation in 1353 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 869/887 places, 1355/1384 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3184 ms. Remains : 869/887 places, 1355/1384 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(NEQ s458 1), p0:(AND (EQ s145 1) (EQ s179 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 152 reset in 353 ms.
Product exploration explored 100000 steps with 160 reset in 403 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 p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 00:12:52] [INFO ] Invariant cache hit.
[2023-03-16 00:12:52] [INFO ] [Real]Absence check using 66 positive place invariants in 52 ms returned sat
[2023-03-16 00:12:53] [INFO ] After 946ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 00:12:53] [INFO ] [Nat]Absence check using 66 positive place invariants in 44 ms returned sat
[2023-03-16 00:12:54] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 00:12:54] [INFO ] After 1028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-16 00:12:54] [INFO ] After 1473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 869 transition count 1296
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 810 transition count 1296
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 118 place count 810 transition count 1259
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 192 place count 773 transition count 1259
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 216 place count 749 transition count 1163
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 749 transition count 1163
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 0 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 630 place count 554 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 633 place count 554 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 835 place count 453 transition count 993
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 849 place count 453 transition count 979
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 921 place count 417 transition count 987
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 983 place count 417 transition count 925
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 992 place count 408 transition count 925
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 992 place count 408 transition count 920
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1002 place count 403 transition count 920
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1040 place count 384 transition count 901
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1041 place count 384 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1042 place count 383 transition count 900
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1043 place count 383 transition count 899
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1048 place count 383 transition count 899
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1049 place count 382 transition count 898
Applied a total of 1049 rules in 177 ms. Remains 382 /869 variables (removed 487) and now considering 898/1355 (removed 457) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 382/869 places, 898/1355 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 898 rows 382 cols
[2023-03-16 00:12:55] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 00:12:55] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-16 00:12:55] [INFO ] After 432ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:12:55] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 00:12:56] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:12:56] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-16 00:12:56] [INFO ] After 41ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 00:12:56] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 00:12:56] [INFO ] After 551ms 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 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 9 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 382/382 places, 898/898 transitions.
Incomplete random walk after 10000 steps, including 47 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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 245237 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245237 steps, saw 66107 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 00:12:59] [INFO ] Invariant cache hit.
[2023-03-16 00:12:59] [INFO ] [Real]Absence check using 57 positive place invariants in 16 ms returned sat
[2023-03-16 00:12:59] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:12:59] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 00:13:00] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:00] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-16 00:13:00] [INFO ] After 46ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:00] [INFO ] After 96ms 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-16 00:13:00] [INFO ] After 611ms 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 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 8 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 382/382 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 9 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2023-03-16 00:13:00] [INFO ] Invariant cache hit.
[2023-03-16 00:13:00] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-16 00:13:00] [INFO ] Invariant cache hit.
[2023-03-16 00:13:01] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-16 00:13:01] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
[2023-03-16 00:13:01] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-16 00:13:01] [INFO ] Invariant cache hit.
[2023-03-16 00:13:02] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1923 ms. Remains : 382/382 places, 898/898 transitions.
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 382 transition count 876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 380 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 380 transition count 870
Applied a total of 26 rules in 22 ms. Remains 380 /382 variables (removed 2) and now considering 870/898 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 870 rows 380 cols
[2023-03-16 00:13:02] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 00:13:02] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-16 00:13:02] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:13:02] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 00:13:03] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:03] [INFO ] After 420ms 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-16 00:13:03] [INFO ] After 568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p1 p0))]
Knowledge based reduction with 6 factoid took 344 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Applied a total of 0 rules in 16 ms. Remains 869 /869 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
// Phase 1: matrix 1355 rows 869 cols
[2023-03-16 00:13:03] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-16 00:13:04] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-16 00:13:04] [INFO ] Invariant cache hit.
[2023-03-16 00:13:05] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 1785 ms to find 0 implicit places.
[2023-03-16 00:13:05] [INFO ] Invariant cache hit.
[2023-03-16 00:13:07] [INFO ] Dead Transitions using invariants and state equation in 1465 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3278 ms. Remains : 869/869 places, 1355/1355 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 p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 578 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 16 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-16 00:13:08] [INFO ] Invariant cache hit.
[2023-03-16 00:13:08] [INFO ] [Real]Absence check using 66 positive place invariants in 46 ms returned sat
[2023-03-16 00:13:09] [INFO ] After 898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 00:13:09] [INFO ] [Nat]Absence check using 66 positive place invariants in 44 ms returned sat
[2023-03-16 00:13:10] [INFO ] After 810ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 00:13:10] [INFO ] After 1125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-16 00:13:10] [INFO ] After 1605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 38 ms.
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 869 transition count 1296
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 810 transition count 1296
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 118 place count 810 transition count 1259
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 192 place count 773 transition count 1259
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 216 place count 749 transition count 1163
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 749 transition count 1163
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 195
Deduced a syphon composed of 195 places in 1 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 630 place count 554 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 633 place count 554 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
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 835 place count 453 transition count 993
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 849 place count 453 transition count 979
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 921 place count 417 transition count 987
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 983 place count 417 transition count 925
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 992 place count 408 transition count 925
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 992 place count 408 transition count 920
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1002 place count 403 transition count 920
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1040 place count 384 transition count 901
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1041 place count 384 transition count 900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1042 place count 383 transition count 900
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1043 place count 383 transition count 899
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1048 place count 383 transition count 899
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1049 place count 382 transition count 898
Applied a total of 1049 rules in 166 ms. Remains 382 /869 variables (removed 487) and now considering 898/1355 (removed 457) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 382/869 places, 898/1355 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 898 rows 382 cols
[2023-03-16 00:13:11] [INFO ] Computed 57 place invariants in 20 ms
[2023-03-16 00:13:11] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 00:13:11] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:13:11] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 00:13:11] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:11] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-16 00:13:11] [INFO ] After 48ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:12] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-16 00:13:12] [INFO ] After 585ms 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 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 9 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 382/382 places, 898/898 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 248072 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 248072 steps, saw 66784 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 00:13:15] [INFO ] Invariant cache hit.
[2023-03-16 00:13:15] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 00:13:15] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:13:15] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 00:13:16] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:16] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-16 00:13:16] [INFO ] After 57ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:16] [INFO ] After 115ms 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-16 00:13:16] [INFO ] After 608ms 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 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 8 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 382/382 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 898/898 transitions.
Applied a total of 0 rules in 9 ms. Remains 382 /382 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2023-03-16 00:13:16] [INFO ] Invariant cache hit.
[2023-03-16 00:13:16] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-16 00:13:16] [INFO ] Invariant cache hit.
[2023-03-16 00:13:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-16 00:13:17] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
[2023-03-16 00:13:17] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-16 00:13:17] [INFO ] Invariant cache hit.
[2023-03-16 00:13:18] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1996 ms. Remains : 382/382 places, 898/898 transitions.
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 382 transition count 876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 380 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 380 transition count 870
Applied a total of 26 rules in 31 ms. Remains 380 /382 variables (removed 2) and now considering 870/898 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 870 rows 380 cols
[2023-03-16 00:13:18] [INFO ] Computed 57 place invariants in 21 ms
[2023-03-16 00:13:18] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-16 00:13:18] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:13:18] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 00:13:19] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:19] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-16 00:13:19] [INFO ] After 556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 418 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 158 reset in 361 ms.
Product exploration explored 100000 steps with 157 reset in 390 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 869 transition count 1355
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 59 place count 869 transition count 1390
Deduced a syphon composed of 78 places in 6 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 78 place count 869 transition count 1390
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 89 place count 858 transition count 1357
Deduced a syphon composed of 78 places in 3 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 100 place count 858 transition count 1357
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 111 place count 847 transition count 1324
Deduced a syphon composed of 67 places in 3 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 122 place count 847 transition count 1324
Performed 213 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 1 with 213 rules applied. Total rules applied 335 place count 847 transition count 1344
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 338 place count 847 transition count 1341
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 408 place count 777 transition count 1221
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 478 place count 777 transition count 1221
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 491 place count 764 transition count 1208
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 504 place count 764 transition count 1208
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -241
Deduced a syphon composed of 311 places in 0 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 605 place count 764 transition count 1449
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 619 place count 764 transition count 1435
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 347 places in 0 ms
Iterating global reduction 3 with 36 rules applied. Total rules applied 655 place count 764 transition count 1515
Deduced a syphon composed of 347 places in 1 ms
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 3 with 66 rules applied. Total rules applied 721 place count 764 transition count 1449
Reduce places removed 9 places and 0 transitions.
Graph (complete) has 4108 edges and 755 vertex of which 746 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 731 place count 746 transition count 1440
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 740 place count 737 transition count 1431
Deduced a syphon composed of 329 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 749 place count 737 transition count 1431
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 348 places in 0 ms
Iterating global reduction 4 with 19 rules applied. Total rules applied 768 place count 737 transition count 1461
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 775 place count 730 transition count 1452
Deduced a syphon composed of 341 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 782 place count 730 transition count 1452
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 346 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 787 place count 730 transition count 1464
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 788 place count 729 transition count 1462
Deduced a syphon composed of 345 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 789 place count 729 transition count 1462
Deduced a syphon composed of 345 places in 0 ms
Applied a total of 789 rules in 478 ms. Remains 729 /869 variables (removed 140) and now considering 1462/1355 (removed -107) transitions.
[2023-03-16 00:13:21] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 1462 rows 729 cols
[2023-03-16 00:13:21] [INFO ] Computed 57 place invariants in 10 ms
[2023-03-16 00:13:22] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 729/869 places, 1462/1355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1460 ms. Remains : 729/869 places, 1462/1355 transitions.
Support contains 3 out of 869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 869/869 places, 1355/1355 transitions.
Applied a total of 0 rules in 36 ms. Remains 869 /869 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
// Phase 1: matrix 1355 rows 869 cols
[2023-03-16 00:13:22] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-16 00:13:23] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-16 00:13:23] [INFO ] Invariant cache hit.
[2023-03-16 00:13:24] [INFO ] Implicit Places using invariants and state equation in 1214 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2023-03-16 00:13:24] [INFO ] Invariant cache hit.
[2023-03-16 00:13:25] [INFO ] Dead Transitions using invariants and state equation in 1467 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3297 ms. Remains : 869/869 places, 1355/1355 transitions.
Treatment of property NoC3x3-PT-5B-LTLFireability-15 finished in 38582 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' '!((!p0&&X((!p0&&G((!p0||G(p1)))))))'
Found a Shortening insensitive property : NoC3x3-PT-5B-LTLFireability-15
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, p0]
Support contains 3 out of 887 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 887/887 places, 1384/1384 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 886 transition count 1314
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 817 transition count 1314
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 138 place count 817 transition count 1279
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 208 place count 782 transition count 1279
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 239 place count 751 transition count 1172
Iterating global reduction 2 with 31 rules applied. Total rules applied 270 place count 751 transition count 1172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 270 place count 751 transition count 1171
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 272 place count 750 transition count 1171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 274 place count 748 transition count 1164
Iterating global reduction 2 with 2 rules applied. Total rules applied 276 place count 748 transition count 1164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 277 place count 747 transition count 1161
Iterating global reduction 2 with 1 rules applied. Total rules applied 278 place count 747 transition count 1161
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 0 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 2 with 386 rules applied. Total rules applied 664 place count 554 transition count 968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 667 place count 554 transition count 965
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 869 place count 453 transition count 993
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 883 place count 453 transition count 979
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 955 place count 417 transition count 987
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 973 place count 417 transition count 969
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 975 place count 415 transition count 969
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 995 place count 405 transition count 959
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 996 place count 405 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 997 place count 404 transition count 958
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1004 place count 397 transition count 958
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 1032 place count 383 transition count 944
Applied a total of 1032 rules in 237 ms. Remains 383 /887 variables (removed 504) and now considering 944/1384 (removed 440) transitions.
// Phase 1: matrix 944 rows 383 cols
[2023-03-16 00:13:26] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 00:13:27] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-16 00:13:27] [INFO ] Invariant cache hit.
[2023-03-16 00:13:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-16 00:13:28] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
[2023-03-16 00:13:28] [INFO ] Invariant cache hit.
[2023-03-16 00:13:28] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 383/887 places, 944/1384 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2168 ms. Remains : 383/887 places, 944/1384 transitions.
Running random walk in product with property : NoC3x3-PT-5B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(NEQ s184 1), p0:(AND (EQ s37 1) (EQ s49 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, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 509 reset in 509 ms.
Product exploration explored 100000 steps with 514 reset in 552 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 263 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 54 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 00:13:30] [INFO ] Invariant cache hit.
[2023-03-16 00:13:30] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 00:13:30] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:13:30] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 00:13:31] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:31] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-16 00:13:31] [INFO ] After 42ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:31] [INFO ] After 96ms 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-16 00:13:31] [INFO ] After 567ms 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 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 944/944 transitions.
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 383 transition count 900
Applied a total of 44 rules in 17 ms. Remains 383 /383 variables (removed 0) and now considering 900/944 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 383/383 places, 900/944 transitions.
Incomplete random walk after 10000 steps, including 46 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 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 258297 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 258297 steps, saw 66852 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 900 rows 383 cols
[2023-03-16 00:13:34] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 00:13:34] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 00:13:34] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:13:34] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 00:13:35] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:35] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-16 00:13:35] [INFO ] After 37ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:35] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-16 00:13:35] [INFO ] After 543ms 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 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 11 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 383/383 places, 900/900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 11 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
[2023-03-16 00:13:35] [INFO ] Invariant cache hit.
[2023-03-16 00:13:35] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-16 00:13:35] [INFO ] Invariant cache hit.
[2023-03-16 00:13:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-16 00:13:36] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
[2023-03-16 00:13:36] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-16 00:13:36] [INFO ] Invariant cache hit.
[2023-03-16 00:13:37] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1925 ms. Remains : 383/383 places, 900/900 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 383 transition count 876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 381 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 381 transition count 870
Applied a total of 28 rules in 22 ms. Remains 381 /383 variables (removed 2) and now considering 870/900 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 870 rows 381 cols
[2023-03-16 00:13:37] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-16 00:13:37] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-16 00:13:37] [INFO ] After 433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:13:37] [INFO ] [Nat]Absence check using 57 positive place invariants in 14 ms returned sat
[2023-03-16 00:13:38] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:38] [INFO ] After 353ms 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-16 00:13:38] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p1 p0))]
Knowledge based reduction with 6 factoid took 299 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 944/944 transitions.
Applied a total of 0 rules in 4 ms. Remains 383 /383 variables (removed 0) and now considering 944/944 (removed 0) transitions.
// Phase 1: matrix 944 rows 383 cols
[2023-03-16 00:13:38] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-16 00:13:39] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-16 00:13:39] [INFO ] Invariant cache hit.
[2023-03-16 00:13:39] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-16 00:13:40] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
[2023-03-16 00:13:40] [INFO ] Invariant cache hit.
[2023-03-16 00:13:40] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1775 ms. Remains : 383/383 places, 944/944 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 354 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 53 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 00:13:41] [INFO ] Invariant cache hit.
[2023-03-16 00:13:41] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 00:13:41] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:13:41] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 00:13:42] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-16 00:13:42] [INFO ] After 41ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:42] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-16 00:13:42] [INFO ] After 587ms 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 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 944/944 transitions.
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 383 transition count 900
Applied a total of 44 rules in 20 ms. Remains 383 /383 variables (removed 0) and now considering 900/944 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 383/383 places, 900/944 transitions.
Incomplete random walk after 10000 steps, including 48 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 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 258221 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 258221 steps, saw 66845 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 900 rows 383 cols
[2023-03-16 00:13:45] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-16 00:13:45] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 00:13:45] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:13:45] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-16 00:13:46] [INFO ] After 319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:46] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-16 00:13:46] [INFO ] After 41ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:46] [INFO ] After 89ms 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-16 00:13:46] [INFO ] After 562ms 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 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 9 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 383/383 places, 900/900 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 900/900 transitions.
Applied a total of 0 rules in 8 ms. Remains 383 /383 variables (removed 0) and now considering 900/900 (removed 0) transitions.
[2023-03-16 00:13:46] [INFO ] Invariant cache hit.
[2023-03-16 00:13:46] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-16 00:13:46] [INFO ] Invariant cache hit.
[2023-03-16 00:13:47] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-16 00:13:47] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2023-03-16 00:13:47] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-16 00:13:47] [INFO ] Invariant cache hit.
[2023-03-16 00:13:48] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1854 ms. Remains : 383/383 places, 900/900 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 383 transition count 876
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 381 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 381 transition count 870
Applied a total of 28 rules in 21 ms. Remains 381 /383 variables (removed 2) and now considering 870/900 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 870 rows 381 cols
[2023-03-16 00:13:48] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 00:13:48] [INFO ] [Real]Absence check using 57 positive place invariants in 21 ms returned sat
[2023-03-16 00:13:48] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 00:13:48] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-16 00:13:49] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 00:13:49] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-16 00:13:49] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 420 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 518 reset in 526 ms.
Product exploration explored 100000 steps with 516 reset in 575 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 944/944 transitions.
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 383 transition count 900
Applied a total of 44 rules in 15 ms. Remains 383 /383 variables (removed 0) and now considering 900/944 (removed 44) transitions.
[2023-03-16 00:13:51] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 900 rows 383 cols
[2023-03-16 00:13:51] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 00:13:52] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/383 places, 900/944 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 649 ms. Remains : 383/383 places, 900/944 transitions.
Support contains 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 944/944 transitions.
Applied a total of 0 rules in 3 ms. Remains 383 /383 variables (removed 0) and now considering 944/944 (removed 0) transitions.
// Phase 1: matrix 944 rows 383 cols
[2023-03-16 00:13:52] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-16 00:13:52] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-16 00:13:52] [INFO ] Invariant cache hit.
[2023-03-16 00:13:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-16 00:13:53] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2023-03-16 00:13:53] [INFO ] Invariant cache hit.
[2023-03-16 00:13:53] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1751 ms. Remains : 383/383 places, 944/944 transitions.
Treatment of property NoC3x3-PT-5B-LTLFireability-15 finished in 27777 ms.
[2023-03-16 00:13:54] [INFO ] Flatten gal took : 76 ms
[2023-03-16 00:13:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-16 00:13:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 887 places, 1384 transitions and 4159 arcs took 12 ms.
Total runtime 119914 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1577/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : NoC3x3-PT-5B-LTLFireability-15

BK_STOP 1678925635818

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name NoC3x3-PT-5B-LTLFireability-15
ltl formula formula --ltl=/tmp/1577/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 887 places, 1384 transitions and 4159 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.050 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1577/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1577/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1577/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1577/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-5B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is NoC3x3-PT-5B, 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 r265-smll-167863539800300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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