Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r021-smll-171620128200228.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Anderson-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620128200228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 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 Anderson-PT-10-LTLFireability-00
FORMULA_NAME Anderson-PT-10-LTLFireability-01
FORMULA_NAME Anderson-PT-10-LTLFireability-02
FORMULA_NAME Anderson-PT-10-LTLFireability-03
FORMULA_NAME Anderson-PT-10-LTLFireability-04
FORMULA_NAME Anderson-PT-10-LTLFireability-05
FORMULA_NAME Anderson-PT-10-LTLFireability-06
FORMULA_NAME Anderson-PT-10-LTLFireability-07
FORMULA_NAME Anderson-PT-10-LTLFireability-08
FORMULA_NAME Anderson-PT-10-LTLFireability-09
FORMULA_NAME Anderson-PT-10-LTLFireability-10
FORMULA_NAME Anderson-PT-10-LTLFireability-11
FORMULA_NAME Anderson-PT-10-LTLFireability-12
FORMULA_NAME Anderson-PT-10-LTLFireability-13
FORMULA_NAME Anderson-PT-10-LTLFireability-14
FORMULA_NAME Anderson-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716525728872

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 04:42:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 04:42:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 04:42:11] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2024-05-24 04:42:11] [INFO ] Transformed 621 places.
[2024-05-24 04:42:11] [INFO ] Transformed 2480 transitions.
[2024-05-24 04:42:11] [INFO ] Found NUPN structural information;
[2024-05-24 04:42:11] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Anderson-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Discarding 154 places :
Symmetric choice reduction at 0 with 154 rule applications. Total rules 154 place count 467 transition count 1120
Iterating global reduction 0 with 154 rules applied. Total rules applied 308 place count 467 transition count 1120
Applied a total of 308 rules in 134 ms. Remains 467 /621 variables (removed 154) and now considering 1120/2480 (removed 1360) transitions.
// Phase 1: matrix 1120 rows 467 cols
[2024-05-24 04:42:12] [INFO ] Computed 23 invariants in 71 ms
[2024-05-24 04:42:13] [INFO ] Implicit Places using invariants in 988 ms returned []
[2024-05-24 04:42:13] [INFO ] Invariant cache hit.
[2024-05-24 04:42:13] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:42:15] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 3313 ms to find 0 implicit places.
[2024-05-24 04:42:15] [INFO ] Invariant cache hit.
[2024-05-24 04:42:16] [INFO ] Dead Transitions using invariants and state equation in 1480 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 467/621 places, 1120/2480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4931 ms. Remains : 467/621 places, 1120/2480 transitions.
Support contains 50 out of 467 places after structural reductions.
[2024-05-24 04:42:17] [INFO ] Flatten gal took : 170 ms
[2024-05-24 04:42:17] [INFO ] Flatten gal took : 110 ms
[2024-05-24 04:42:17] [INFO ] Input system was already deterministic with 1120 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 31) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-24 04:42:18] [INFO ] Invariant cache hit.
[2024-05-24 04:42:19] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2024-05-24 04:42:19] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 39 ms returned sat
[2024-05-24 04:42:20] [INFO ] After 1589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-24 04:42:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 29 ms returned sat
[2024-05-24 04:42:20] [INFO ] [Nat]Absence check using 11 positive and 12 generalized place invariants in 57 ms returned sat
[2024-05-24 04:42:23] [INFO ] After 2647ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :17
[2024-05-24 04:42:23] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:42:26] [INFO ] After 2574ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :1 sat :17
[2024-05-24 04:42:27] [INFO ] Deduced a trap composed of 148 places in 534 ms of which 13 ms to minimize.
[2024-05-24 04:42:28] [INFO ] Deduced a trap composed of 157 places in 495 ms of which 1 ms to minimize.
[2024-05-24 04:42:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1203 ms
[2024-05-24 04:42:30] [INFO ] After 6869ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :17
Attempting to minimize the solution found.
Minimization took 2209 ms.
[2024-05-24 04:42:32] [INFO ] After 12457ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :17
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 169 ms.
Support contains 30 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 87 Pre rules applied. Total rules applied 0 place count 467 transition count 1033
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 380 transition count 1033
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 184 place count 370 transition count 843
Iterating global reduction 0 with 10 rules applied. Total rules applied 194 place count 370 transition count 843
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 200 place count 367 transition count 840
Applied a total of 200 rules in 267 ms. Remains 367 /467 variables (removed 100) and now considering 840/1120 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 367/467 places, 840/1120 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 840 rows 367 cols
[2024-05-24 04:42:33] [INFO ] Computed 23 invariants in 44 ms
[2024-05-24 04:42:34] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-05-24 04:42:34] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 19 ms returned sat
[2024-05-24 04:42:35] [INFO ] After 1358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-24 04:42:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2024-05-24 04:42:35] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 20 ms returned sat
[2024-05-24 04:42:37] [INFO ] After 1698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-24 04:42:37] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:42:38] [INFO ] After 1567ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-24 04:42:40] [INFO ] After 3006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1643 ms.
[2024-05-24 04:42:41] [INFO ] After 6704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 2 properties in 109 ms.
Support contains 25 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 840/840 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 364 transition count 783
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 364 transition count 783
Applied a total of 6 rules in 50 ms. Remains 364 /367 variables (removed 3) and now considering 783/840 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 364/367 places, 783/840 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 783 rows 364 cols
[2024-05-24 04:42:43] [INFO ] Computed 23 invariants in 19 ms
[2024-05-24 04:42:43] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2024-05-24 04:42:43] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 17 ms returned sat
[2024-05-24 04:42:43] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-24 04:42:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2024-05-24 04:42:43] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 21 ms returned sat
[2024-05-24 04:42:45] [INFO ] After 1138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-24 04:42:45] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:42:46] [INFO ] After 1052ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-24 04:42:47] [INFO ] After 1870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 715 ms.
[2024-05-24 04:42:47] [INFO ] After 3986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 115 ms.
Support contains 17 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 783/783 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 362 transition count 745
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 362 transition count 745
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 361 transition count 744
Applied a total of 6 rules in 69 ms. Remains 361 /364 variables (removed 3) and now considering 744/783 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 361/364 places, 744/783 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 161575 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{1=1, 7=1}
Probabilistic random walk after 161575 steps, saw 123542 distinct states, run finished after 3003 ms. (steps per millisecond=53 ) properties seen :2
Running SMT prover for 7 properties.
// Phase 1: matrix 744 rows 361 cols
[2024-05-24 04:42:51] [INFO ] Computed 23 invariants in 9 ms
[2024-05-24 04:42:51] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2024-05-24 04:42:51] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 18 ms returned sat
[2024-05-24 04:42:52] [INFO ] After 761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 04:42:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2024-05-24 04:42:52] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 16 ms returned sat
[2024-05-24 04:42:53] [INFO ] After 846ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 04:42:53] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:42:54] [INFO ] After 710ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-24 04:42:54] [INFO ] After 1420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 608 ms.
[2024-05-24 04:42:55] [INFO ] After 3091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 35 ms.
Support contains 15 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 744/744 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 359 transition count 742
Applied a total of 4 rules in 30 ms. Remains 359 /361 variables (removed 2) and now considering 742/744 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 359/361 places, 742/744 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 276684 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 276684 steps, saw 209421 distinct states, run finished after 3002 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 742 rows 359 cols
[2024-05-24 04:42:59] [INFO ] Computed 23 invariants in 13 ms
[2024-05-24 04:42:59] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2024-05-24 04:42:59] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 16 ms returned sat
[2024-05-24 04:43:00] [INFO ] After 1103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 04:43:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-24 04:43:00] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 12 ms returned sat
[2024-05-24 04:43:01] [INFO ] After 989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 04:43:01] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:43:02] [INFO ] After 661ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-24 04:43:03] [INFO ] After 1399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 498 ms.
[2024-05-24 04:43:03] [INFO ] After 3105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 84 ms.
Support contains 15 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 742/742 transitions.
Applied a total of 0 rules in 23 ms. Remains 359 /359 variables (removed 0) and now considering 742/742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 359/359 places, 742/742 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 742/742 transitions.
Applied a total of 0 rules in 20 ms. Remains 359 /359 variables (removed 0) and now considering 742/742 (removed 0) transitions.
[2024-05-24 04:43:03] [INFO ] Invariant cache hit.
[2024-05-24 04:43:04] [INFO ] Implicit Places using invariants in 584 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 589 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 358/359 places, 742/742 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 358 transition count 650
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 184 place count 266 transition count 650
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 192 place count 266 transition count 642
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 200 place count 258 transition count 642
Applied a total of 200 rules in 41 ms. Remains 258 /358 variables (removed 100) and now considering 642/742 (removed 100) transitions.
// Phase 1: matrix 642 rows 258 cols
[2024-05-24 04:43:04] [INFO ] Computed 22 invariants in 4 ms
[2024-05-24 04:43:04] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-24 04:43:04] [INFO ] Invariant cache hit.
[2024-05-24 04:43:04] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:43:06] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 258/359 places, 642/742 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2332 ms. Remains : 258/359 places, 642/742 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 175840 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{4=1}
Probabilistic random walk after 175840 steps, saw 132090 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :1
Running SMT prover for 6 properties.
[2024-05-24 04:43:09] [INFO ] Invariant cache hit.
[2024-05-24 04:43:10] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-24 04:43:10] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 12 ms returned sat
[2024-05-24 04:43:10] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 04:43:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-24 04:43:10] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 12 ms returned sat
[2024-05-24 04:43:10] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 04:43:10] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:43:11] [INFO ] After 385ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 04:43:11] [INFO ] After 789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 336 ms.
[2024-05-24 04:43:11] [INFO ] After 1793ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 51 ms.
Support contains 14 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 642/642 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 257 transition count 623
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 257 transition count 623
Applied a total of 2 rules in 17 ms. Remains 257 /258 variables (removed 1) and now considering 623/642 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 257/258 places, 623/642 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 183729 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183729 steps, saw 139367 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 623 rows 257 cols
[2024-05-24 04:43:15] [INFO ] Computed 22 invariants in 4 ms
[2024-05-24 04:43:15] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-24 04:43:15] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 14 ms returned sat
[2024-05-24 04:43:15] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 04:43:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-24 04:43:15] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 16 ms returned sat
[2024-05-24 04:43:16] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 04:43:16] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:43:16] [INFO ] After 445ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 04:43:17] [INFO ] After 966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 284 ms.
[2024-05-24 04:43:17] [INFO ] After 1916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 37 ms.
Support contains 14 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 623/623 transitions.
Applied a total of 0 rules in 10 ms. Remains 257 /257 variables (removed 0) and now considering 623/623 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 257/257 places, 623/623 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 623/623 transitions.
Applied a total of 0 rules in 12 ms. Remains 257 /257 variables (removed 0) and now considering 623/623 (removed 0) transitions.
[2024-05-24 04:43:17] [INFO ] Invariant cache hit.
[2024-05-24 04:43:18] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-24 04:43:18] [INFO ] Invariant cache hit.
[2024-05-24 04:43:18] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:43:19] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
[2024-05-24 04:43:19] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-24 04:43:19] [INFO ] Invariant cache hit.
[2024-05-24 04:43:19] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2010 ms. Remains : 257/257 places, 623/623 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 257 transition count 523
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 157 transition count 523
Applied a total of 200 rules in 14 ms. Remains 157 /257 variables (removed 100) and now considering 523/623 (removed 100) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 523 rows 157 cols
[2024-05-24 04:43:19] [INFO ] Computed 22 invariants in 4 ms
[2024-05-24 04:43:19] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-24 04:43:19] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 15 ms returned sat
[2024-05-24 04:43:20] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 04:43:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-24 04:43:20] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 16 ms returned sat
[2024-05-24 04:43:20] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 04:43:21] [INFO ] After 702ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 241 ms.
[2024-05-24 04:43:21] [INFO ] After 1060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!X(p0) U p1)))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 17 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-24 04:43:21] [INFO ] Computed 23 invariants in 6 ms
[2024-05-24 04:43:22] [INFO ] Implicit Places using invariants in 666 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 668 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 7 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 692 ms. Remains : 442/467 places, 718/1120 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (OR (NOT p1) p0), true]
Running random walk in product with property : Anderson-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (NOT (AND (EQ s11 1) (EQ s38 1))) (AND (EQ s24 1) (EQ s91 1))), p0:(OR (AND (EQ s24 1) (EQ s91 1)) (NOT (AND (EQ s26 1) (EQ s37 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 19278 steps with 0 reset in 206 ms.
FORMULA Anderson-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-00 finished in 1279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 17 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-24 04:43:22] [INFO ] Computed 23 invariants in 7 ms
[2024-05-24 04:43:23] [INFO ] Implicit Places using invariants in 587 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 589 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 7 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 614 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s12 1) (EQ s32 1)), p0:(AND (EQ s18 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-01 finished in 766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(X(F(p0)))) U G(!p1)))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 442 transition count 681
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 442 transition count 681
Applied a total of 50 rules in 18 ms. Remains 442 /467 variables (removed 25) and now considering 681/1120 (removed 439) transitions.
// Phase 1: matrix 681 rows 442 cols
[2024-05-24 04:43:23] [INFO ] Computed 23 invariants in 6 ms
[2024-05-24 04:43:24] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-05-24 04:43:24] [INFO ] Invariant cache hit.
[2024-05-24 04:43:24] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:43:25] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
[2024-05-24 04:43:25] [INFO ] Invariant cache hit.
[2024-05-24 04:43:26] [INFO ] Dead Transitions using invariants and state equation in 893 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 681/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3092 ms. Remains : 442/467 places, 681/1120 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(AND (EQ s4 1) (EQ s278 1) (EQ s133 1)), p0:(AND (EQ s0 1) (EQ s354 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 351 ms.
Product exploration explored 100000 steps with 0 reset in 463 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 (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 136 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 04:43:28] [INFO ] Invariant cache hit.
[2024-05-24 04:43:28] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2024-05-24 04:43:28] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 24 ms returned sat
[2024-05-24 04:43:28] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-24 04:43:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2024-05-24 04:43:28] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 21 ms returned sat
[2024-05-24 04:43:29] [INFO ] After 779ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-24 04:43:29] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:43:30] [INFO ] After 708ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-24 04:43:30] [INFO ] After 1091ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 236 ms.
[2024-05-24 04:43:30] [INFO ] After 2270ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 681/681 transitions.
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 89 Pre rules applied. Total rules applied 0 place count 442 transition count 592
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 0 with 178 rules applied. Total rules applied 178 place count 353 transition count 592
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 180 place count 352 transition count 591
Applied a total of 180 rules in 33 ms. Remains 352 /442 variables (removed 90) and now considering 591/681 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 352/442 places, 591/681 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 298291 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298291 steps, saw 222663 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 591 rows 352 cols
[2024-05-24 04:43:34] [INFO ] Computed 23 invariants in 7 ms
[2024-05-24 04:43:34] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-24 04:43:34] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 16 ms returned sat
[2024-05-24 04:43:35] [INFO ] After 849ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:43:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-24 04:43:35] [INFO ] [Nat]Absence check using 11 positive and 12 generalized place invariants in 18 ms returned sat
[2024-05-24 04:43:36] [INFO ] After 1198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:43:36] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:43:36] [INFO ] After 462ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:43:37] [INFO ] After 802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2181 ms.
[2024-05-24 04:43:39] [INFO ] After 4312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 591/591 transitions.
Applied a total of 0 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 352/352 places, 591/591 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 591/591 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2024-05-24 04:43:39] [INFO ] Invariant cache hit.
[2024-05-24 04:43:39] [INFO ] Implicit Places using invariants in 548 ms returned []
[2024-05-24 04:43:39] [INFO ] Invariant cache hit.
[2024-05-24 04:43:40] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:43:41] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2192 ms to find 0 implicit places.
[2024-05-24 04:43:41] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-24 04:43:41] [INFO ] Invariant cache hit.
[2024-05-24 04:43:42] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2951 ms. Remains : 352/352 places, 591/591 transitions.
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 99 Pre rules applied. Total rules applied 0 place count 352 transition count 492
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 198 place count 253 transition count 492
Applied a total of 198 rules in 16 ms. Remains 253 /352 variables (removed 99) and now considering 492/591 (removed 99) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 492 rows 253 cols
[2024-05-24 04:43:42] [INFO ] Computed 23 invariants in 5 ms
[2024-05-24 04:43:42] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2024-05-24 04:43:42] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 18 ms returned sat
[2024-05-24 04:43:42] [INFO ] After 456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:43:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-24 04:43:42] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 17 ms returned sat
[2024-05-24 04:43:43] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:43:43] [INFO ] After 928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-24 04:43:43] [INFO ] After 1144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 13 factoid took 287 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 219 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 5 out of 442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 442/442 places, 681/681 transitions.
Applied a total of 0 rules in 8 ms. Remains 442 /442 variables (removed 0) and now considering 681/681 (removed 0) transitions.
// Phase 1: matrix 681 rows 442 cols
[2024-05-24 04:43:44] [INFO ] Computed 23 invariants in 5 ms
[2024-05-24 04:43:45] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-24 04:43:45] [INFO ] Invariant cache hit.
[2024-05-24 04:43:45] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:43:46] [INFO ] Implicit Places using invariants and state equation in 1805 ms returned []
Implicit Place search using SMT with State Equation took 2300 ms to find 0 implicit places.
[2024-05-24 04:43:47] [INFO ] Invariant cache hit.
[2024-05-24 04:43:47] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3059 ms. Remains : 442/442 places, 681/681 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 (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 238 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 04:43:48] [INFO ] Invariant cache hit.
[2024-05-24 04:43:48] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2024-05-24 04:43:48] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 23 ms returned sat
[2024-05-24 04:43:49] [INFO ] After 760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:43:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2024-05-24 04:43:49] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 21 ms returned sat
[2024-05-24 04:43:52] [INFO ] After 3408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:52] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:43:52] [INFO ] After 157ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:43:54] [INFO ] After 1777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-24 04:43:54] [INFO ] After 5424ms 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 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 681/681 transitions.
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 89 Pre rules applied. Total rules applied 0 place count 442 transition count 592
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 0 with 178 rules applied. Total rules applied 178 place count 353 transition count 592
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 180 place count 352 transition count 591
Applied a total of 180 rules in 30 ms. Remains 352 /442 variables (removed 90) and now considering 591/681 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 352/442 places, 591/681 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 6830 steps, including 2 resets, run visited all 1 properties in 9 ms. (steps per millisecond=758 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 338 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter sensitive) to 6 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 323 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Stuttering acceptance computed with spot in 203 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Product exploration explored 100000 steps with 0 reset in 231 ms.
Product exploration explored 100000 steps with 0 reset in 323 ms.
Applying partial POR strategy [true, false, true, false, false, true]
Stuttering acceptance computed with spot in 219 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1]
Support contains 5 out of 442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 442/442 places, 681/681 transitions.
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 89 Pre rules applied. Total rules applied 0 place count 442 transition count 681
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 0 with 89 rules applied. Total rules applied 89 place count 442 transition count 681
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 442 transition count 681
Deduced a syphon composed of 90 places in 1 ms
Applied a total of 90 rules in 91 ms. Remains 442 /442 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-24 04:43:56] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 681 rows 442 cols
[2024-05-24 04:43:56] [INFO ] Computed 23 invariants in 5 ms
[2024-05-24 04:43:58] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 442/442 places, 681/681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1276 ms. Remains : 442/442 places, 681/681 transitions.
Built C files in :
/tmp/ltsmin3773833566170525505
[2024-05-24 04:43:58] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3773833566170525505
Running compilation step : cd /tmp/ltsmin3773833566170525505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1972 ms.
Running link step : cd /tmp/ltsmin3773833566170525505;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin3773833566170525505;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6584154150962151689.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 442/442 places, 681/681 transitions.
Applied a total of 0 rules in 9 ms. Remains 442 /442 variables (removed 0) and now considering 681/681 (removed 0) transitions.
// Phase 1: matrix 681 rows 442 cols
[2024-05-24 04:44:13] [INFO ] Computed 23 invariants in 6 ms
[2024-05-24 04:44:13] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-05-24 04:44:13] [INFO ] Invariant cache hit.
[2024-05-24 04:44:14] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:44:15] [INFO ] Implicit Places using invariants and state equation in 1631 ms returned []
Implicit Place search using SMT with State Equation took 2176 ms to find 0 implicit places.
[2024-05-24 04:44:15] [INFO ] Invariant cache hit.
[2024-05-24 04:44:16] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3071 ms. Remains : 442/442 places, 681/681 transitions.
Built C files in :
/tmp/ltsmin6006003168842843339
[2024-05-24 04:44:16] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6006003168842843339
Running compilation step : cd /tmp/ltsmin6006003168842843339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1738 ms.
Running link step : cd /tmp/ltsmin6006003168842843339;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6006003168842843339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17992991909513727122.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 04:44:31] [INFO ] Flatten gal took : 45 ms
[2024-05-24 04:44:31] [INFO ] Flatten gal took : 40 ms
[2024-05-24 04:44:31] [INFO ] Time to serialize gal into /tmp/LTL12075293684412079415.gal : 20 ms
[2024-05-24 04:44:31] [INFO ] Time to serialize properties into /tmp/LTL9017369135815150313.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12075293684412079415.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10894333099061515158.hoa' '-atoms' '/tmp/LTL9017369135815150313.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9017369135815150313.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10894333099061515158.hoa
Detected timeout of ITS tools.
[2024-05-24 04:44:46] [INFO ] Flatten gal took : 35 ms
[2024-05-24 04:44:46] [INFO ] Flatten gal took : 33 ms
[2024-05-24 04:44:46] [INFO ] Time to serialize gal into /tmp/LTL600999396362787353.gal : 5 ms
[2024-05-24 04:44:46] [INFO ] Time to serialize properties into /tmp/LTL12893690484511870824.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL600999396362787353.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12893690484511870824.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((!("((slot_F.F.F.F.F.F.F.F.F.F==1)&&(cs_1_2==1))"))&&(X(X(F("((slot_F.F.F.F.F.F.F.F.F.F==1)&&(cs_1_2==1))")))))U(G(!("(((slot_F.F....208
Formula 0 simplified : ("((slot_F.F.F.F.F.F.F.F.F.F==1)&&(cs_1_2==1))" | XXG!"((slot_F.F.F.F.F.F.F.F.F.F==1)&&(cs_1_2==1))") R F"(((slot_F.F.F.F.F.F.T.F.F....189
Detected timeout of ITS tools.
[2024-05-24 04:45:01] [INFO ] Flatten gal took : 64 ms
[2024-05-24 04:45:01] [INFO ] Applying decomposition
[2024-05-24 04:45:01] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15821478824989692517.txt' '-o' '/tmp/graph15821478824989692517.bin' '-w' '/tmp/graph15821478824989692517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15821478824989692517.bin' '-l' '-1' '-v' '-w' '/tmp/graph15821478824989692517.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:45:02] [INFO ] Decomposing Gal with order
[2024-05-24 04:45:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:45:02] [INFO ] Removed a total of 981 redundant transitions.
[2024-05-24 04:45:02] [INFO ] Flatten gal took : 155 ms
[2024-05-24 04:45:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 36 ms.
[2024-05-24 04:45:02] [INFO ] Time to serialize gal into /tmp/LTL61724462895384853.gal : 14 ms
[2024-05-24 04:45:02] [INFO ] Time to serialize properties into /tmp/LTL5977039705527529139.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL61724462895384853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5977039705527529139.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...252
Read 1 LTL properties
Checking formula 0 : !((((!("((u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(i7.u75.cs_1_2==1))"))&&(X(X(F("((u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(i7.u75.cs_1_2==1))"))))...245
Formula 0 simplified : ("((u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(i7.u75.cs_1_2==1))" | XXG!"((u0.slot_F.F.F.F.F.F.F.F.F.F==1)&&(i7.u75.cs_1_2==1))") R F"(((u0....226
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17666868804952272508
[2024-05-24 04:45:17] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17666868804952272508
Running compilation step : cd /tmp/ltsmin17666868804952272508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1632 ms.
Running link step : cd /tmp/ltsmin17666868804952272508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17666868804952272508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((!(LTLAPp0==true)&&X(X(<>((LTLAPp0==true))))) U [](!(LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 10933 ms.
FORMULA Anderson-PT-10-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-10-LTLFireability-02 finished in 126583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 19 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-24 04:45:30] [INFO ] Computed 23 invariants in 6 ms
[2024-05-24 04:45:30] [INFO ] Implicit Places using invariants in 670 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 673 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 7 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 701 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s15 0) (EQ s33 0)), p2:(AND (NOT (AND (EQ s13 1) (EQ s41 1))) (NOT (AND (EQ s27 1) (EQ s121 1)))), p1:(AND (EQ s27 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 731 ms.
Product exploration explored 100000 steps with 50000 reset in 647 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 p0 p2 (NOT p1)), (X p0), (X p2), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-03 finished in 2301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1)||G(p2))))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 700
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 700
Applied a total of 48 rules in 18 ms. Remains 443 /467 variables (removed 24) and now considering 700/1120 (removed 420) transitions.
// Phase 1: matrix 700 rows 443 cols
[2024-05-24 04:45:32] [INFO ] Computed 23 invariants in 5 ms
[2024-05-24 04:45:33] [INFO ] Implicit Places using invariants in 636 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 638 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 700/1120 transitions.
Applied a total of 0 rules in 7 ms. Remains 442 /442 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 665 ms. Remains : 442/467 places, 700/1120 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (EQ s1 1) (EQ s270 1)), p0:(EQ s81 0), p2:(AND (EQ s27 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 600 ms.
Product exploration explored 100000 steps with 50000 reset in 625 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 (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-04 finished in 2127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 17 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-24 04:45:34] [INFO ] Computed 23 invariants in 9 ms
[2024-05-24 04:45:35] [INFO ] Implicit Places using invariants in 636 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 639 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 8 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 666 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s13 1) (EQ s31 1)), p0:(AND (EQ s21 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-05 finished in 893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(((p1 U p2)&&p0)) U G(p3))))))'
Support contains 8 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 445 transition count 756
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 445 transition count 756
Applied a total of 44 rules in 17 ms. Remains 445 /467 variables (removed 22) and now considering 756/1120 (removed 364) transitions.
// Phase 1: matrix 756 rows 445 cols
[2024-05-24 04:45:35] [INFO ] Computed 23 invariants in 5 ms
[2024-05-24 04:45:36] [INFO ] Implicit Places using invariants in 570 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 572 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/467 places, 756/1120 transitions.
Applied a total of 0 rules in 8 ms. Remains 444 /444 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 598 ms. Remains : 444/467 places, 756/1120 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p2), (OR (AND (NOT p2) p3) (AND (NOT p0) p3)), (NOT p3)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-06 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=(OR (AND p3 p0 p2) (AND p3 p0 p1)), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 p1)), acceptance={} source=3 dest: 6}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={} source=6 dest: 4}, { cond=(AND p3 p0 (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(OR (AND p3 p0 p2) (AND p3 p0 p1)), acceptance={} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 4}, { cond=p3, acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(AND (EQ s25 1) (EQ s40 1)), p0:(AND (EQ s14 1) (EQ s42 1)), p2:(AND (EQ s23 1) (EQ s36 1)), p1:(AND (EQ s22 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 3 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-06 finished in 956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F(G(!p1)))))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 204 place count 353 transition count 628
Iterating global reduction 0 with 24 rules applied. Total rules applied 228 place count 353 transition count 628
Applied a total of 228 rules in 35 ms. Remains 353 /467 variables (removed 114) and now considering 628/1120 (removed 492) transitions.
// Phase 1: matrix 628 rows 353 cols
[2024-05-24 04:45:36] [INFO ] Computed 23 invariants in 5 ms
[2024-05-24 04:45:37] [INFO ] Implicit Places using invariants in 587 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 591 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/467 places, 628/1120 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 14 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-05-24 04:45:37] [INFO ] Computed 22 invariants in 6 ms
[2024-05-24 04:45:37] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-24 04:45:37] [INFO ] Invariant cache hit.
[2024-05-24 04:45:37] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:45:38] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/467 places, 530/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1912 ms. Remains : 254/467 places, 530/1120 transitions.
Stuttering acceptance computed with spot in 144 ms :[p0, true, (AND p0 p1), p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NOT (AND (EQ s18 1) (EQ s36 1))) (EQ s28 1) (EQ s41 1)), p1:(AND (EQ s26 1) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 199 ms.
Product exploration explored 100000 steps with 0 reset in 296 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 (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-24 04:45:39] [INFO ] Invariant cache hit.
[2024-05-24 04:45:39] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-24 04:45:39] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 12 ms returned sat
[2024-05-24 04:45:39] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:45:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-24 04:45:39] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 12 ms returned sat
[2024-05-24 04:45:40] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:45:40] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:45:40] [INFO ] After 124ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:45:40] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-24 04:45:40] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 15 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 252/254 places, 528/530 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 824530 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :{}
Probabilistic random walk after 824530 steps, saw 594096 distinct states, run finished after 3005 ms. (steps per millisecond=274 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 252 cols
[2024-05-24 04:45:43] [INFO ] Computed 22 invariants in 5 ms
[2024-05-24 04:45:43] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-24 04:45:43] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 04:45:43] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:45:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-24 04:45:43] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 19 ms returned sat
[2024-05-24 04:45:44] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:45:44] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:45:44] [INFO ] After 96ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:45:44] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-24 04:45:44] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 8 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 8 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-24 04:45:44] [INFO ] Invariant cache hit.
[2024-05-24 04:45:44] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-24 04:45:44] [INFO ] Invariant cache hit.
[2024-05-24 04:45:44] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:45:45] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
[2024-05-24 04:45:45] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 04:45:45] [INFO ] Invariant cache hit.
[2024-05-24 04:45:46] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1897 ms. Remains : 252/252 places, 528/528 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 9 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2024-05-24 04:45:46] [INFO ] Computed 22 invariants in 4 ms
[2024-05-24 04:45:46] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-05-24 04:45:46] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-24 04:45:46] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:45:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-24 04:45:46] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-24 04:45:46] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:45:46] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-24 04:45:46] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 73 ms :[(AND p0 p1), p1]
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 9 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-05-24 04:45:47] [INFO ] Computed 22 invariants in 4 ms
[2024-05-24 04:45:47] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-24 04:45:47] [INFO ] Invariant cache hit.
[2024-05-24 04:45:47] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:45:48] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
[2024-05-24 04:45:48] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 04:45:48] [INFO ] Invariant cache hit.
[2024-05-24 04:45:49] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1961 ms. Remains : 254/254 places, 530/530 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 (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-24 04:45:49] [INFO ] Invariant cache hit.
[2024-05-24 04:45:49] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-24 04:45:49] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 12 ms returned sat
[2024-05-24 04:45:49] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:45:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-24 04:45:49] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 12 ms returned sat
[2024-05-24 04:45:50] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:45:50] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:45:50] [INFO ] After 118ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:45:50] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-24 04:45:50] [INFO ] After 719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 15 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 252/254 places, 528/530 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 863320 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :{}
Probabilistic random walk after 863320 steps, saw 621153 distinct states, run finished after 3002 ms. (steps per millisecond=287 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 252 cols
[2024-05-24 04:45:53] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 04:45:53] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-24 04:45:53] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 13 ms returned sat
[2024-05-24 04:45:53] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:45:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-24 04:45:54] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 12 ms returned sat
[2024-05-24 04:45:54] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:45:54] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:45:54] [INFO ] After 98ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:45:54] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-24 04:45:54] [INFO ] After 478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2024-05-24 04:45:54] [INFO ] Invariant cache hit.
[2024-05-24 04:45:54] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-24 04:45:54] [INFO ] Invariant cache hit.
[2024-05-24 04:45:55] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:45:55] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2024-05-24 04:45:55] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 04:45:55] [INFO ] Invariant cache hit.
[2024-05-24 04:45:56] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1814 ms. Remains : 252/252 places, 528/528 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 9 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2024-05-24 04:45:56] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 04:45:56] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-05-24 04:45:56] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-24 04:45:56] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:45:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-05-24 04:45:56] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-24 04:45:56] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:45:56] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-24 04:45:56] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 72 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 71 ms :[(AND p0 p1), p1]
Product exploration explored 100000 steps with 0 reset in 237 ms.
Product exploration explored 100000 steps with 0 reset in 237 ms.
Built C files in :
/tmp/ltsmin9849282036110802270
[2024-05-24 04:45:57] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2024-05-24 04:45:57] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:45:57] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2024-05-24 04:45:57] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:45:57] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2024-05-24 04:45:57] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:45:57] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9849282036110802270
Running compilation step : cd /tmp/ltsmin9849282036110802270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1857 ms.
Running link step : cd /tmp/ltsmin9849282036110802270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9849282036110802270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8293106983646062065.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 8 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-05-24 04:46:12] [INFO ] Computed 22 invariants in 4 ms
[2024-05-24 04:46:13] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-24 04:46:13] [INFO ] Invariant cache hit.
[2024-05-24 04:46:13] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:46:14] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
[2024-05-24 04:46:14] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 04:46:14] [INFO ] Invariant cache hit.
[2024-05-24 04:46:14] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1928 ms. Remains : 254/254 places, 530/530 transitions.
Built C files in :
/tmp/ltsmin9705056391317812751
[2024-05-24 04:46:14] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2024-05-24 04:46:14] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:46:14] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2024-05-24 04:46:14] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:46:14] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2024-05-24 04:46:14] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:46:14] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9705056391317812751
Running compilation step : cd /tmp/ltsmin9705056391317812751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1915 ms.
Running link step : cd /tmp/ltsmin9705056391317812751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9705056391317812751;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10940617421896997480.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 04:46:29] [INFO ] Flatten gal took : 24 ms
[2024-05-24 04:46:29] [INFO ] Flatten gal took : 23 ms
[2024-05-24 04:46:29] [INFO ] Time to serialize gal into /tmp/LTL18138698753745643432.gal : 5 ms
[2024-05-24 04:46:29] [INFO ] Time to serialize properties into /tmp/LTL17751405477577722900.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18138698753745643432.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16852689915734095386.hoa' '-atoms' '/tmp/LTL17751405477577722900.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17751405477577722900.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16852689915734095386.hoa
Detected timeout of ITS tools.
[2024-05-24 04:46:44] [INFO ] Flatten gal took : 21 ms
[2024-05-24 04:46:45] [INFO ] Flatten gal took : 51 ms
[2024-05-24 04:46:45] [INFO ] Time to serialize gal into /tmp/LTL852013178838890239.gal : 7 ms
[2024-05-24 04:46:45] [INFO ] Time to serialize properties into /tmp/LTL4442360768015410437.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL852013178838890239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4442360768015410437.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((G("((((next_8==1)&&(ncs_5_7==1))||(next_18!=1))||(ncs_9_3!=1))"))||(F(G("((next_16!=1)||(p1_3_9!=1))")))))
Formula 0 simplified : F!"((((next_8==1)&&(ncs_5_7==1))||(next_18!=1))||(ncs_9_3!=1))" & GF!"((next_16!=1)||(p1_3_9!=1))"
Detected timeout of ITS tools.
[2024-05-24 04:47:00] [INFO ] Flatten gal took : 18 ms
[2024-05-24 04:47:00] [INFO ] Applying decomposition
[2024-05-24 04:47:00] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7941469660691032269.txt' '-o' '/tmp/graph7941469660691032269.bin' '-w' '/tmp/graph7941469660691032269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7941469660691032269.bin' '-l' '-1' '-v' '-w' '/tmp/graph7941469660691032269.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:47:00] [INFO ] Decomposing Gal with order
[2024-05-24 04:47:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:47:00] [INFO ] Removed a total of 931 redundant transitions.
[2024-05-24 04:47:00] [INFO ] Flatten gal took : 52 ms
[2024-05-24 04:47:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 18 ms.
[2024-05-24 04:47:00] [INFO ] Time to serialize gal into /tmp/LTL12390891379470406813.gal : 6 ms
[2024-05-24 04:47:00] [INFO ] Time to serialize properties into /tmp/LTL3784180247836744079.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12390891379470406813.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3784180247836744079.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("((((i2.i1.u7.next_8==1)&&(i5.u20.ncs_5_7==1))||(i2.i1.u11.next_18!=1))||(i0.u55.ncs_9_3!=1))"))||(F(G("((i2.i0.u10.next_16!=1)|...184
Formula 0 simplified : F!"((((i2.i1.u7.next_8==1)&&(i5.u20.ncs_5_7==1))||(i2.i1.u11.next_18!=1))||(i0.u55.ncs_9_3!=1))" & GF!"((i2.i0.u10.next_16!=1)||(i1....174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12260834688442852245
[2024-05-24 04:47:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12260834688442852245
Running compilation step : cd /tmp/ltsmin12260834688442852245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1201 ms.
Running link step : cd /tmp/ltsmin12260834688442852245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12260834688442852245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||(<>([]((LTLAPp1==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-10-LTLFireability-08 finished in 113938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 205 place count 352 transition count 609
Iterating global reduction 0 with 25 rules applied. Total rules applied 230 place count 352 transition count 609
Applied a total of 230 rules in 26 ms. Remains 352 /467 variables (removed 115) and now considering 609/1120 (removed 511) transitions.
// Phase 1: matrix 609 rows 352 cols
[2024-05-24 04:47:30] [INFO ] Computed 23 invariants in 5 ms
[2024-05-24 04:47:31] [INFO ] Implicit Places using invariants in 837 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 839 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/467 places, 609/1120 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 351 transition count 510
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 252 transition count 510
Applied a total of 198 rules in 19 ms. Remains 252 /351 variables (removed 99) and now considering 510/609 (removed 99) transitions.
// Phase 1: matrix 510 rows 252 cols
[2024-05-24 04:47:31] [INFO ] Computed 22 invariants in 6 ms
[2024-05-24 04:47:31] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-24 04:47:31] [INFO ] Invariant cache hit.
[2024-05-24 04:47:32] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:47:32] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 252/467 places, 510/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2520 ms. Remains : 252/467 places, 510/1120 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 302 ms.
Stack based approach found an accepted trace after 388 steps with 0 reset with depth 389 and stack size 389 in 2 ms.
FORMULA Anderson-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-09 finished in 2971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 205 place count 352 transition count 609
Iterating global reduction 0 with 25 rules applied. Total rules applied 230 place count 352 transition count 609
Applied a total of 230 rules in 41 ms. Remains 352 /467 variables (removed 115) and now considering 609/1120 (removed 511) transitions.
// Phase 1: matrix 609 rows 352 cols
[2024-05-24 04:47:33] [INFO ] Computed 23 invariants in 7 ms
[2024-05-24 04:47:34] [INFO ] Implicit Places using invariants in 856 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 881 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/467 places, 609/1120 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 351 transition count 510
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 252 transition count 510
Applied a total of 198 rules in 16 ms. Remains 252 /351 variables (removed 99) and now considering 510/609 (removed 99) transitions.
// Phase 1: matrix 510 rows 252 cols
[2024-05-24 04:47:34] [INFO ] Computed 22 invariants in 4 ms
[2024-05-24 04:47:34] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-24 04:47:34] [INFO ] Invariant cache hit.
[2024-05-24 04:47:35] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:47:36] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 1935 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 252/467 places, 510/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2876 ms. Remains : 252/467 places, 510/1120 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 309 ms.
Stack based approach found an accepted trace after 99 steps with 2 reset with depth 87 and stack size 87 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-10 finished in 3293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 442 transition count 699
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 442 transition count 699
Applied a total of 50 rules in 27 ms. Remains 442 /467 variables (removed 25) and now considering 699/1120 (removed 421) transitions.
// Phase 1: matrix 699 rows 442 cols
[2024-05-24 04:47:36] [INFO ] Computed 23 invariants in 8 ms
[2024-05-24 04:47:37] [INFO ] Implicit Places using invariants in 749 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 763 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 441/467 places, 699/1120 transitions.
Applied a total of 0 rules in 7 ms. Remains 441 /441 variables (removed 0) and now considering 699/699 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 798 ms. Remains : 441/467 places, 699/1120 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s31 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]]
Product exploration explored 100000 steps with 3 reset in 228 ms.
Stack based approach found an accepted trace after 89 steps with 0 reset with depth 90 and stack size 90 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-11 finished in 1179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p1)&&p0))&&F(G(p2)))))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 444 transition count 719
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 444 transition count 719
Applied a total of 46 rules in 25 ms. Remains 444 /467 variables (removed 23) and now considering 719/1120 (removed 401) transitions.
// Phase 1: matrix 719 rows 444 cols
[2024-05-24 04:47:37] [INFO ] Computed 23 invariants in 8 ms
[2024-05-24 04:47:38] [INFO ] Implicit Places using invariants in 862 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 881 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/467 places, 719/1120 transitions.
Applied a total of 0 rules in 11 ms. Remains 443 /443 variables (removed 0) and now considering 719/719 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 918 ms. Remains : 443/467 places, 719/1120 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s40 1)), p1:(AND (EQ s27 1) (EQ s36 1)), p2:(NEQ s122 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 235 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-12 finished in 1510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(G(p1)))))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 443 transition count 718
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 443 transition count 718
Applied a total of 48 rules in 24 ms. Remains 443 /467 variables (removed 24) and now considering 718/1120 (removed 402) transitions.
// Phase 1: matrix 718 rows 443 cols
[2024-05-24 04:47:39] [INFO ] Computed 23 invariants in 8 ms
[2024-05-24 04:47:40] [INFO ] Implicit Places using invariants in 830 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 852 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/467 places, 718/1120 transitions.
Applied a total of 0 rules in 14 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 892 ms. Remains : 442/467 places, 718/1120 transitions.
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s18 1) (EQ s38 1)), p1:(AND (EQ s25 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 247 ms.
Stack based approach found an accepted trace after 91 steps with 0 reset with depth 92 and stack size 92 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-13 finished in 1506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 1120/1120 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 467 transition count 1030
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 377 transition count 1030
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 204 place count 353 transition count 628
Iterating global reduction 0 with 24 rules applied. Total rules applied 228 place count 353 transition count 628
Applied a total of 228 rules in 36 ms. Remains 353 /467 variables (removed 114) and now considering 628/1120 (removed 492) transitions.
// Phase 1: matrix 628 rows 353 cols
[2024-05-24 04:47:40] [INFO ] Computed 23 invariants in 7 ms
[2024-05-24 04:47:41] [INFO ] Implicit Places using invariants in 804 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 816 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/467 places, 628/1120 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 13 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2024-05-24 04:47:41] [INFO ] Computed 22 invariants in 4 ms
[2024-05-24 04:47:42] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-24 04:47:42] [INFO ] Invariant cache hit.
[2024-05-24 04:47:42] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-24 04:47:43] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1752 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/467 places, 530/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2617 ms. Remains : 254/467 places, 530/1120 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-15 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s39 1)), p1:(AND (EQ s14 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 253 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-15 finished in 3039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F(G(!p1)))))'
[2024-05-24 04:47:44] [INFO ] Flatten gal took : 74 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15707884142810174335
[2024-05-24 04:47:44] [INFO ] Computing symmetric may disable matrix : 1120 transitions.
[2024-05-24 04:47:44] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:47:44] [INFO ] Computing symmetric may enable matrix : 1120 transitions.
[2024-05-24 04:47:44] [INFO ] Applying decomposition
[2024-05-24 04:47:44] [INFO ] Computation of Complete enable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:47:44] [INFO ] Flatten gal took : 110 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4822201802408230580.txt' '-o' '/tmp/graph4822201802408230580.bin' '-w' '/tmp/graph4822201802408230580.weights'
[2024-05-24 04:47:44] [INFO ] Computing Do-Not-Accords matrix : 1120 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4822201802408230580.bin' '-l' '-1' '-v' '-w' '/tmp/graph4822201802408230580.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:47:44] [INFO ] Decomposing Gal with order
[2024-05-24 04:47:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:47:44] [INFO ] Computation of Completed DNA matrix. took 101 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:47:44] [INFO ] Built C files in 594ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15707884142810174335
Running compilation step : cd /tmp/ltsmin15707884142810174335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 04:47:45] [INFO ] Removed a total of 1958 redundant transitions.
[2024-05-24 04:47:45] [INFO ] Flatten gal took : 255 ms
[2024-05-24 04:47:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 164 labels/synchronizations in 29 ms.
[2024-05-24 04:47:45] [INFO ] Time to serialize gal into /tmp/LTLFireability2948910959484501799.gal : 11 ms
[2024-05-24 04:47:45] [INFO ] Time to serialize properties into /tmp/LTLFireability4062259616910373863.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2948910959484501799.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4062259616910373863.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(!("(((!((i2.i0.u4.next_8==1)&&(i11.u71.ncs_5_7==1)))&&(i2.i1.u9.next_18==1))&&(i7.u47.ncs_9_3==1))")))||(F(G(!("((i2.i1.u8.next_...192
Formula 0 simplified : F"(((!((i2.i0.u4.next_8==1)&&(i11.u71.ncs_5_7==1)))&&(i2.i1.u9.next_18==1))&&(i7.u47.ncs_9_3==1))" & GF"((i2.i1.u8.next_16==1)&&(i2....174
Compilation finished in 6087 ms.
Running link step : cd /tmp/ltsmin15707884142810174335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin15707884142810174335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>([](!(LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 05:09:35] [INFO ] Applying decomposition
[2024-05-24 05:09:35] [INFO ] Flatten gal took : 103 ms
[2024-05-24 05:09:36] [INFO ] Decomposing Gal with order
[2024-05-24 05:09:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:09:36] [INFO ] Removed a total of 1343 redundant transitions.
[2024-05-24 05:09:36] [INFO ] Flatten gal took : 319 ms
[2024-05-24 05:09:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 62 ms.
[2024-05-24 05:09:36] [INFO ] Time to serialize gal into /tmp/LTLFireability7267273498934592605.gal : 8 ms
[2024-05-24 05:09:36] [INFO ] Time to serialize properties into /tmp/LTLFireability8145355079374673351.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7267273498934592605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8145355079374673351.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(!("(((!((u11.next_8==1)&&(u2.ncs_5_7==1)))&&(u11.next_18==1))&&(u6.ncs_9_3==1))")))||(F(G(!("((u11.next_16==1)&&(u10.p1_3_9==1))...162
Formula 0 simplified : F"(((!((u11.next_8==1)&&(u2.ncs_5_7==1)))&&(u11.next_18==1))&&(u6.ncs_9_3==1))" & GF"((u11.next_16==1)&&(u10.p1_3_9==1))"
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t40, t41, t52, t62, t63, t64, t85, t94, t97, t104, t105, t106, t113, t117, t119, t1...1568
Detected timeout of ITS tools.
[2024-05-24 05:31:27] [INFO ] Flatten gal took : 111 ms
[2024-05-24 05:31:27] [INFO ] Input system was already deterministic with 1120 transitions.
[2024-05-24 05:31:27] [INFO ] Transformed 467 places.
[2024-05-24 05:31:27] [INFO ] Transformed 1120 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 05:31:58] [INFO ] Time to serialize gal into /tmp/LTLFireability4817780467685367496.gal : 27 ms
[2024-05-24 05:31:58] [INFO ] Time to serialize properties into /tmp/LTLFireability6811151411555168625.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4817780467685367496.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6811151411555168625.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(!("(((!((next_8==1)&&(ncs_5_7==1)))&&(next_18==1))&&(ncs_9_3==1))")))||(F(G(!("((next_16==1)&&(p1_3_9==1))"))))))
Formula 0 simplified : F"(((!((next_8==1)&&(ncs_5_7==1)))&&(next_18==1))&&(ncs_9_3==1))" & GF"((next_16==1)&&(p1_3_9==1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7137584 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039156 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Anderson-PT-10, 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 r021-smll-171620128200228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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