fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r325-tall-167889197600763
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ResAllocation-PT-R050C002

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3925.035 645968.00 1873508.00 3354.30 FFTTFTFTFFFTFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r325-tall-167889197600763.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ResAllocation-PT-R050C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197600763
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 25 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 212K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-00
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-01
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-02
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-03
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-04
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-05
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-06
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-07
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-08
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-09
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-10
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-11
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-12
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-13
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-14
FORMULA_NAME ResAllocation-PT-R050C002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679034059111

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R050C002
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-17 06:21:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 06:21:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 06:21:00] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-17 06:21:00] [INFO ] Transformed 200 places.
[2023-03-17 06:21:00] [INFO ] Transformed 102 transitions.
[2023-03-17 06:21:00] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 102/102 transitions.
Applied a total of 0 rules in 16 ms. Remains 200 /200 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 200 cols
[2023-03-17 06:21:01] [INFO ] Computed 100 place invariants in 13 ms
[2023-03-17 06:21:01] [INFO ] Implicit Places using invariants in 265 ms returned [101, 103, 105, 107, 109, 115, 117, 121, 123, 125, 127, 129, 135, 137, 139, 143, 145, 147, 151, 159, 161, 163, 165, 169, 171, 173, 175, 177, 179, 183, 187, 189, 191, 193, 197, 199]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 289 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/200 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 313 ms. Remains : 164/200 places, 102/102 transitions.
Support contains 51 out of 164 places after structural reductions.
[2023-03-17 06:21:01] [INFO ] Flatten gal took : 39 ms
[2023-03-17 06:21:01] [INFO ] Flatten gal took : 13 ms
[2023-03-17 06:21:01] [INFO ] Input system was already deterministic with 102 transitions.
Support contains 49 out of 164 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 36) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 102 rows 164 cols
[2023-03-17 06:21:02] [INFO ] Computed 64 place invariants in 2 ms
[2023-03-17 06:21:02] [INFO ] [Real]Absence check using 64 positive place invariants in 9 ms returned sat
[2023-03-17 06:21:02] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2023-03-17 06:21:02] [INFO ] [Nat]Absence check using 64 positive place invariants in 10 ms returned sat
[2023-03-17 06:21:02] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :12
[2023-03-17 06:21:03] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 5 ms to minimize.
[2023-03-17 06:21:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-17 06:21:03] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :12
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-17 06:21:03] [INFO ] After 632ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :12
Fused 21 Parikh solutions to 11 different solutions.
Parikh walk visited 9 properties in 95 ms.
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 162 transition count 100
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 162 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 158 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 156 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 156 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 152 transition count 94
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 2 with 4 rules applied. Total rules applied 24 place count 150 transition count 92
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 150 transition count 91
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 148 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 147 transition count 90
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 147 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 145 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 144 transition count 88
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 144 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 37 place count 142 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 40 place count 140 transition count 86
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 140 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 43 place count 138 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 46 place count 136 transition count 84
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 47 place count 136 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 49 place count 134 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 51 place count 133 transition count 82
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 52 place count 133 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 54 place count 131 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 56 place count 130 transition count 80
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 57 place count 130 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 59 place count 128 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 62 place count 126 transition count 78
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 63 place count 126 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 65 place count 124 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 67 place count 123 transition count 76
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 68 place count 123 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 70 place count 121 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 72 place count 120 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 73 place count 120 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 75 place count 118 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 77 place count 117 transition count 72
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 78 place count 117 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 80 place count 115 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 82 place count 114 transition count 70
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 83 place count 114 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 85 place count 112 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 87 place count 111 transition count 68
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 88 place count 111 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 90 place count 109 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 3 rules applied. Total rules applied 93 place count 107 transition count 66
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 94 place count 107 transition count 65
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 97 place count 104 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 99 place count 103 transition count 64
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 100 place count 103 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 102 place count 101 transition count 63
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 103 place count 101 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 104 place count 100 transition count 62
Applied a total of 104 rules in 165 ms. Remains 100 /164 variables (removed 64) and now considering 62/102 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 100/164 places, 62/102 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 62 rows 100 cols
[2023-03-17 06:21:03] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-17 06:21:03] [INFO ] [Real]Absence check using 40 positive place invariants in 6 ms returned sat
[2023-03-17 06:21:03] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 06:21:03] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2023-03-17 06:21:03] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 06:21:03] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 06:21:03] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 100/100 places, 62/62 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) 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 :0
Interrupted probabilistic random walk after 1014301 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :{}
Probabilistic random walk after 1014301 steps, saw 196286 distinct states, run finished after 3003 ms. (steps per millisecond=337 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 06:21:07] [INFO ] Invariant cache hit.
[2023-03-17 06:21:07] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2023-03-17 06:21:07] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 06:21:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2023-03-17 06:21:07] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 06:21:07] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 06:21:07] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 100/100 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-17 06:21:07] [INFO ] Invariant cache hit.
[2023-03-17 06:21:07] [INFO ] Implicit Places using invariants in 75 ms returned [63, 68, 73, 76, 78, 80, 86, 94, 97]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 76 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 91/100 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 80 ms. Remains : 91/100 places, 62/62 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1457478 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :{}
Probabilistic random walk after 1457478 steps, saw 279697 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 62 rows 91 cols
[2023-03-17 06:21:10] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-17 06:21:10] [INFO ] [Real]Absence check using 31 positive place invariants in 3 ms returned sat
[2023-03-17 06:21:10] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 06:21:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 4 ms returned sat
[2023-03-17 06:21:10] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 06:21:10] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 06:21:10] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 91/91 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-17 06:21:10] [INFO ] Invariant cache hit.
[2023-03-17 06:21:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-17 06:21:10] [INFO ] Invariant cache hit.
[2023-03-17 06:21:10] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-17 06:21:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 06:21:10] [INFO ] Invariant cache hit.
[2023-03-17 06:21:10] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 91/91 places, 62/62 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 61
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 90 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 60
Applied a total of 4 rules in 5 ms. Remains 89 /91 variables (removed 2) and now considering 60/62 (removed 2) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 60 rows 89 cols
[2023-03-17 06:21:10] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-17 06:21:10] [INFO ] [Real]Absence check using 31 positive place invariants in 4 ms returned sat
[2023-03-17 06:21:10] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 06:21:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-17 06:21:11] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 06:21:11] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-17 06:21:11] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA ResAllocation-PT-R050C002-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA ResAllocation-PT-R050C002-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(G(p1)))||p0)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 164 cols
[2023-03-17 06:21:11] [INFO ] Computed 64 place invariants in 2 ms
[2023-03-17 06:21:11] [INFO ] Implicit Places using invariants in 93 ms returned [106, 108, 112, 119, 126, 131, 134, 138, 144, 155, 161]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 95 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 153/164 places, 102/102 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LEQ s129 s143) (AND (LEQ s88 s129) (LEQ 1 s117))), p1:(LEQ s129 s143)], 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 77327 steps with 116 reset in 355 ms.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-01 finished in 760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-17 06:21:12] [INFO ] Invariant cache hit.
[2023-03-17 06:21:12] [INFO ] Implicit Places using invariants in 95 ms returned [106, 108, 112, 119, 121, 126, 131, 134, 136, 138, 144, 152, 155, 161]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 98 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 150/164 places, 102/102 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s118 s108) (GT 1 s17))], 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 50000 reset in 312 ms.
Product exploration explored 100000 steps with 50000 reset in 334 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R050C002-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-02 finished in 901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(G(p1))&&(p2 U X(p3)))))'
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-17 06:21:12] [INFO ] Invariant cache hit.
[2023-03-17 06:21:13] [INFO ] Implicit Places using invariants in 89 ms returned [106, 108, 112, 119, 121, 131, 138, 144, 152, 161]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 90 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/164 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 154 /154 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 154/164 places, 102/102 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 0}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 4}, { cond=(AND p1 p3), acceptance={0} source=3 dest: 6}], [{ cond=(OR (NOT p1) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p3), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=1, aps=[p2:(GT 1 s130), p0:(GT s128 s146), p1:(LEQ s121 s61), p3:(LEQ s51 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-06 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-17 06:21:13] [INFO ] Invariant cache hit.
[2023-03-17 06:21:13] [INFO ] Implicit Places using invariants in 97 ms returned [106, 108, 112, 119, 121, 126, 131, 134, 136, 138, 144, 152, 155, 161]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 97 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 150/164 places, 102/102 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s108 s77)], 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][false, false, false]]
Product exploration explored 100000 steps with 150 reset in 320 ms.
Product exploration explored 100000 steps with 150 reset in 291 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 : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3244 steps, run visited all 1 properties in 13 ms. (steps per millisecond=249 )
Probabilistic random walk after 3244 steps, saw 2425 distinct states, run finished after 13 ms. (steps per millisecond=249 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 150 cols
[2023-03-17 06:21:14] [INFO ] Computed 50 place invariants in 0 ms
[2023-03-17 06:21:14] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-17 06:21:14] [INFO ] Invariant cache hit.
[2023-03-17 06:21:15] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-17 06:21:15] [INFO ] Invariant cache hit.
[2023-03-17 06:21:15] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 150/150 places, 102/102 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 : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3244 steps, run visited all 1 properties in 12 ms. (steps per millisecond=270 )
Probabilistic random walk after 3244 steps, saw 2425 distinct states, run finished after 13 ms. (steps per millisecond=249 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 150 reset in 226 ms.
Product exploration explored 100000 steps with 151 reset in 272 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 150 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 28 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-17 06:21:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 102 rows 150 cols
[2023-03-17 06:21:16] [INFO ] Computed 50 place invariants in 0 ms
[2023-03-17 06:21:16] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/150 places, 102/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 150/150 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin16000111864046040446
[2023-03-17 06:21:16] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16000111864046040446
Running compilation step : cd /tmp/ltsmin16000111864046040446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 311 ms.
Running link step : cd /tmp/ltsmin16000111864046040446;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16000111864046040446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8715176707340792126.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 150 cols
[2023-03-17 06:21:31] [INFO ] Computed 50 place invariants in 3 ms
[2023-03-17 06:21:32] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-17 06:21:32] [INFO ] Invariant cache hit.
[2023-03-17 06:21:32] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-17 06:21:32] [INFO ] Invariant cache hit.
[2023-03-17 06:21:32] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 150/150 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin4686872091827777961
[2023-03-17 06:21:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4686872091827777961
Running compilation step : cd /tmp/ltsmin4686872091827777961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 197 ms.
Running link step : cd /tmp/ltsmin4686872091827777961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4686872091827777961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18268868587114395355.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 06:21:47] [INFO ] Flatten gal took : 10 ms
[2023-03-17 06:21:47] [INFO ] Flatten gal took : 8 ms
[2023-03-17 06:21:47] [INFO ] Time to serialize gal into /tmp/LTL18285334491449345021.gal : 2 ms
[2023-03-17 06:21:47] [INFO ] Time to serialize properties into /tmp/LTL8838145494662024213.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18285334491449345021.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13705997807403123764.hoa' '-atoms' '/tmp/LTL8838145494662024213.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8838145494662024213.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13705997807403123764.hoa
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Computing Next relation with stutter on 49 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1490 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.9197,425688,1,0,2792,2.21102e+06,233,3284,4840,3.37328e+06,6606
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Detected timeout of ITS tools.
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-08 finished in 49147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0 U (p1||G(p0))))))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 164 cols
[2023-03-17 06:22:02] [INFO ] Computed 64 place invariants in 2 ms
[2023-03-17 06:22:02] [INFO ] Implicit Places using invariants in 109 ms returned [106, 108, 119, 121, 126, 131, 134, 136, 138, 144, 152, 155, 161]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 109 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/164 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 151/164 places, 102/102 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-09 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=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GT 1 s110) (GT 1 s72)), p0:(GT 1 s72)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 150 reset in 240 ms.
Product exploration explored 100000 steps with 150 reset in 263 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 510 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1576224 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :{0=1}
Probabilistic random walk after 1576224 steps, saw 361913 distinct states, run finished after 3001 ms. (steps per millisecond=525 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 151 cols
[2023-03-17 06:22:07] [INFO ] Computed 51 place invariants in 4 ms
[2023-03-17 06:22:07] [INFO ] [Real]Absence check using 51 positive place invariants in 6 ms returned sat
[2023-03-17 06:22:07] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:22:07] [INFO ] After 55ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-17 06:22:07] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 149 transition count 100
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 149 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 145 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 143 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 143 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 139 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 137 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 137 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 133 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 131 transition count 88
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 131 transition count 86
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 127 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 44 place count 125 transition count 84
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 125 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 50 place count 121 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 54 place count 119 transition count 80
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 56 place count 119 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 60 place count 115 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 64 place count 113 transition count 76
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 66 place count 113 transition count 74
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 70 place count 109 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 74 place count 107 transition count 72
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 76 place count 107 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 80 place count 103 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 84 place count 101 transition count 68
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 86 place count 101 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 90 place count 97 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 95 place count 94 transition count 64
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 97 place count 94 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 101 place count 90 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 105 place count 88 transition count 60
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 107 place count 88 transition count 58
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 111 place count 84 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 115 place count 82 transition count 56
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 117 place count 82 transition count 54
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 121 place count 78 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 125 place count 76 transition count 52
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 127 place count 76 transition count 50
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 131 place count 72 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 133 place count 71 transition count 49
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 135 place count 71 transition count 47
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 138 place count 68 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 140 place count 67 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 141 place count 67 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 143 place count 65 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 145 place count 64 transition count 44
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 146 place count 64 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 148 place count 62 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 150 place count 61 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 151 place count 61 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 153 place count 59 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 155 place count 58 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 156 place count 58 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 158 place count 56 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 160 place count 55 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 161 place count 55 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 163 place count 53 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 165 place count 52 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 166 place count 52 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 168 place count 50 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 170 place count 49 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 171 place count 49 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 173 place count 47 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 175 place count 46 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 176 place count 46 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 178 place count 44 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 180 place count 43 transition count 30
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 181 place count 43 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 183 place count 41 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 185 place count 40 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 186 place count 40 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 188 place count 38 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 190 place count 37 transition count 26
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 191 place count 37 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 193 place count 35 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 195 place count 34 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 196 place count 34 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 198 place count 32 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 200 place count 31 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 201 place count 31 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 203 place count 29 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 205 place count 28 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 206 place count 28 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 208 place count 26 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 210 place count 25 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 211 place count 25 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 213 place count 23 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 215 place count 22 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 216 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 218 place count 20 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 220 place count 19 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 221 place count 19 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 223 place count 17 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 225 place count 16 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 226 place count 16 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 228 place count 14 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 230 place count 13 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 231 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 233 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 235 place count 10 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 236 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 238 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 240 place count 7 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 241 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 243 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 245 place count 4 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 246 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 246 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 36 with 3 rules applied. Total rules applied 249 place count 2 transition count 2
Applied a total of 249 rules in 87 ms. Remains 2 /151 variables (removed 149) and now considering 2/102 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 2/151 places, 2/102 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-17 06:22:07] [INFO ] Invariant cache hit.
[2023-03-17 06:22:07] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-17 06:22:07] [INFO ] Invariant cache hit.
[2023-03-17 06:22:08] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-17 06:22:08] [INFO ] Invariant cache hit.
[2023-03-17 06:22:08] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 151/151 places, 102/102 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 p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1552002 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :{0=1}
Probabilistic random walk after 1552002 steps, saw 357499 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-17 06:22:11] [INFO ] Invariant cache hit.
[2023-03-17 06:22:11] [INFO ] [Real]Absence check using 51 positive place invariants in 6 ms returned sat
[2023-03-17 06:22:11] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:22:11] [INFO ] After 59ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-17 06:22:11] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 149 transition count 100
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 149 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 145 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 143 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 143 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 139 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 137 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 137 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 133 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 131 transition count 88
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 131 transition count 86
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 127 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 44 place count 125 transition count 84
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 125 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 50 place count 121 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 54 place count 119 transition count 80
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 56 place count 119 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 60 place count 115 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 64 place count 113 transition count 76
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 66 place count 113 transition count 74
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 70 place count 109 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 74 place count 107 transition count 72
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 76 place count 107 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 80 place count 103 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 84 place count 101 transition count 68
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 86 place count 101 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 90 place count 97 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 95 place count 94 transition count 64
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 97 place count 94 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 101 place count 90 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 105 place count 88 transition count 60
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 107 place count 88 transition count 58
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 111 place count 84 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 115 place count 82 transition count 56
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 117 place count 82 transition count 54
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 121 place count 78 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 125 place count 76 transition count 52
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 127 place count 76 transition count 50
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 131 place count 72 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 133 place count 71 transition count 49
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 135 place count 71 transition count 47
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 138 place count 68 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 140 place count 67 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 141 place count 67 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 143 place count 65 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 145 place count 64 transition count 44
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 146 place count 64 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 148 place count 62 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 150 place count 61 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 151 place count 61 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 153 place count 59 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 155 place count 58 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 156 place count 58 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 158 place count 56 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 160 place count 55 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 161 place count 55 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 163 place count 53 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 165 place count 52 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 166 place count 52 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 168 place count 50 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 170 place count 49 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 171 place count 49 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 173 place count 47 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 175 place count 46 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 176 place count 46 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 178 place count 44 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 180 place count 43 transition count 30
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 181 place count 43 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 183 place count 41 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 185 place count 40 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 186 place count 40 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 188 place count 38 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 190 place count 37 transition count 26
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 191 place count 37 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 193 place count 35 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 195 place count 34 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 196 place count 34 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 198 place count 32 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 200 place count 31 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 201 place count 31 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 203 place count 29 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 205 place count 28 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 206 place count 28 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 208 place count 26 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 210 place count 25 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 211 place count 25 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 213 place count 23 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 215 place count 22 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 216 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 218 place count 20 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 220 place count 19 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 221 place count 19 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 223 place count 17 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 225 place count 16 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 226 place count 16 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 228 place count 14 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 230 place count 13 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 231 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 233 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 235 place count 10 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 236 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 238 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 240 place count 7 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 241 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 243 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 245 place count 4 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 246 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 246 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 36 with 3 rules applied. Total rules applied 249 place count 2 transition count 2
Applied a total of 249 rules in 78 ms. Remains 2 /151 variables (removed 149) and now considering 2/102 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 2/151 places, 2/102 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 150 reset in 216 ms.
Product exploration explored 100000 steps with 150 reset in 249 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-17 06:22:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 102 rows 151 cols
[2023-03-17 06:22:13] [INFO ] Computed 51 place invariants in 1 ms
[2023-03-17 06:22:13] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/151 places, 102/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 151/151 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin9155319437824031729
[2023-03-17 06:22:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9155319437824031729
Running compilation step : cd /tmp/ltsmin9155319437824031729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 195 ms.
Running link step : cd /tmp/ltsmin9155319437824031729;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9155319437824031729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11686892144739626217.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 151 cols
[2023-03-17 06:22:28] [INFO ] Computed 51 place invariants in 7 ms
[2023-03-17 06:22:28] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-17 06:22:28] [INFO ] Invariant cache hit.
[2023-03-17 06:22:28] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-17 06:22:28] [INFO ] Invariant cache hit.
[2023-03-17 06:22:28] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 151/151 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin10216278369900110509
[2023-03-17 06:22:28] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10216278369900110509
Running compilation step : cd /tmp/ltsmin10216278369900110509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 209 ms.
Running link step : cd /tmp/ltsmin10216278369900110509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10216278369900110509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9184973610506677529.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 06:22:43] [INFO ] Flatten gal took : 8 ms
[2023-03-17 06:22:43] [INFO ] Flatten gal took : 7 ms
[2023-03-17 06:22:43] [INFO ] Time to serialize gal into /tmp/LTL9004193159669380431.gal : 2 ms
[2023-03-17 06:22:43] [INFO ] Time to serialize properties into /tmp/LTL11306738789539630354.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9004193159669380431.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5282405853204103766.hoa' '-atoms' '/tmp/LTL11306738789539630354.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11306738789539630354.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5282405853204103766.hoa
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2023-03-17 06:22:58] [INFO ] Flatten gal took : 7 ms
[2023-03-17 06:22:58] [INFO ] Flatten gal took : 7 ms
[2023-03-17 06:22:58] [INFO ] Time to serialize gal into /tmp/LTL7328605428052137705.gal : 1 ms
[2023-03-17 06:22:58] [INFO ] Time to serialize properties into /tmp/LTL2780163935197348507.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7328605428052137705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2780163935197348507.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(p_0_36<1)")U((G("(p_0_36<1)"))||("((r_1_9<1)&&(p_0_36<1))"))))))))
Formula 0 simplified : XXXG(!"(p_0_36<1)" M !"((r_1_9<1)&&(p_0_36<1))")
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2023-03-17 06:23:13] [INFO ] Flatten gal took : 6 ms
[2023-03-17 06:23:13] [INFO ] Applying decomposition
[2023-03-17 06:23:13] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1895975922350174969.txt' '-o' '/tmp/graph1895975922350174969.bin' '-w' '/tmp/graph1895975922350174969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1895975922350174969.bin' '-l' '-1' '-v' '-w' '/tmp/graph1895975922350174969.weights' '-q' '0' '-e' '0.001'
[2023-03-17 06:23:13] [INFO ] Decomposing Gal with order
[2023-03-17 06:23:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 06:23:13] [INFO ] Flatten gal took : 44 ms
[2023-03-17 06:23:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-17 06:23:13] [INFO ] Time to serialize gal into /tmp/LTL14730390618733668110.gal : 3 ms
[2023-03-17 06:23:13] [INFO ] Time to serialize properties into /tmp/LTL13076812039909502596.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14730390618733668110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13076812039909502596.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(i7.i1.u36.p_0_36<1)")U((G("(i7.i1.u36.p_0_36<1)"))||("((i1.i1.u50.r_1_9<1)&&(i7.i1.u36.p_0_36<1))"))))))))
Formula 0 simplified : XXXG(!"(i7.i1.u36.p_0_36<1)" M !"((i1.i1.u50.r_1_9<1)&&(i7.i1.u36.p_0_36<1))")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u0.t51, i9.i2.u49.t50, Intersection with reachable at each step enabled. (destroyed/re...190
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2880079337222633032
[2023-03-17 06:23:29] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2880079337222633032
Running compilation step : cd /tmp/ltsmin2880079337222633032;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 210 ms.
Running link step : cd /tmp/ltsmin2880079337222633032;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2880079337222633032;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-09 finished in 101556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 164 cols
[2023-03-17 06:23:44] [INFO ] Computed 64 place invariants in 1 ms
[2023-03-17 06:23:44] [INFO ] Implicit Places using invariants in 135 ms returned [108, 112, 119, 121, 126, 131, 134, 136, 138, 144, 152, 155, 161]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 136 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 151 /151 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 151/164 places, 102/102 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s117 s109), p1:(LEQ s106 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 53107 steps with 79 reset in 124 ms.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-10 finished in 407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1||X((X(p2) U (p1&&X(p2))))))))'
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-17 06:23:44] [INFO ] Invariant cache hit.
[2023-03-17 06:23:44] [INFO ] Implicit Places using invariants in 102 ms returned [106, 112, 119, 126, 131, 134, 136, 138, 144, 152, 155, 161]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 103 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/164 places, 102/102 transitions.
Applied a total of 0 rules in 0 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 152/164 places, 102/102 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s90 s30), p0:(LEQ s118 s107), p2:(LEQ s104 s80)], 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 150 reset in 268 ms.
Product exploration explored 100000 steps with 150 reset in 300 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 265 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 688683 steps, run timeout after 3002 ms. (steps per millisecond=229 ) properties seen :{3=1, 4=1}
Probabilistic random walk after 688683 steps, saw 181798 distinct states, run finished after 3002 ms. (steps per millisecond=229 ) properties seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 102 rows 152 cols
[2023-03-17 06:23:49] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-17 06:23:49] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 06:23:49] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2023-03-17 06:23:49] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 06:23:49] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-17 06:23:49] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 54 ms.
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 150 transition count 100
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 150 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 146 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 144 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 144 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 140 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 138 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 138 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 134 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 132 transition count 88
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 132 transition count 86
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 128 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 127 transition count 85
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 127 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 47 place count 124 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 49 place count 123 transition count 82
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 50 place count 123 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 52 place count 121 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 53 place count 121 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 54 place count 120 transition count 80
Applied a total of 54 rules in 37 ms. Remains 120 /152 variables (removed 32) and now considering 80/102 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 120/152 places, 80/102 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1053462 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :{}
Probabilistic random walk after 1053462 steps, saw 222742 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 80 rows 120 cols
[2023-03-17 06:23:52] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-17 06:23:52] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 06:23:52] [INFO ] [Nat]Absence check using 42 positive place invariants in 5 ms returned sat
[2023-03-17 06:23:52] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 06:23:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-17 06:23:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-17 06:23:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-17 06:23:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-17 06:23:52] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-17 06:23:52] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 10 ms.
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 120/120 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-17 06:23:52] [INFO ] Invariant cache hit.
[2023-03-17 06:23:53] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-17 06:23:53] [INFO ] Invariant cache hit.
[2023-03-17 06:23:53] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-17 06:23:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 06:23:53] [INFO ] Invariant cache hit.
[2023-03-17 06:23:53] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 120/120 places, 80/80 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 119 transition count 80
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 119 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 117 transition count 78
Applied a total of 5 rules in 3 ms. Remains 117 /120 variables (removed 3) and now considering 78/80 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 78 rows 117 cols
[2023-03-17 06:23:53] [INFO ] Computed 41 place invariants in 0 ms
[2023-03-17 06:23:53] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 06:23:53] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2023-03-17 06:23:53] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 06:23:53] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-17 06:23:53] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 355 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 152 cols
[2023-03-17 06:23:54] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-17 06:23:54] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-17 06:23:54] [INFO ] Invariant cache hit.
[2023-03-17 06:23:54] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-17 06:23:54] [INFO ] Invariant cache hit.
[2023-03-17 06:23:54] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 152/152 places, 102/102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 378 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 830234 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :{3=1, 4=1}
Probabilistic random walk after 830234 steps, saw 216350 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :2
Running SMT prover for 3 properties.
[2023-03-17 06:23:58] [INFO ] Invariant cache hit.
[2023-03-17 06:23:58] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 06:23:58] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2023-03-17 06:23:58] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 06:23:58] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-17 06:23:58] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 150 transition count 100
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 150 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 146 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 144 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 144 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 140 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 138 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 138 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 134 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 132 transition count 88
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 132 transition count 86
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 128 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 127 transition count 85
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 127 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 47 place count 124 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 49 place count 123 transition count 82
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 50 place count 123 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 52 place count 121 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 53 place count 121 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 54 place count 120 transition count 80
Applied a total of 54 rules in 17 ms. Remains 120 /152 variables (removed 32) and now considering 80/102 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 120/152 places, 80/102 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1007613 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :{}
Probabilistic random walk after 1007613 steps, saw 214648 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 80 rows 120 cols
[2023-03-17 06:24:01] [INFO ] Computed 42 place invariants in 2 ms
[2023-03-17 06:24:01] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 06:24:01] [INFO ] [Nat]Absence check using 42 positive place invariants in 4 ms returned sat
[2023-03-17 06:24:01] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 06:24:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-17 06:24:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-17 06:24:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-17 06:24:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-17 06:24:01] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-17 06:24:01] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 19 ms.
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 120/120 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-17 06:24:01] [INFO ] Invariant cache hit.
[2023-03-17 06:24:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-17 06:24:01] [INFO ] Invariant cache hit.
[2023-03-17 06:24:01] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-17 06:24:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 06:24:01] [INFO ] Invariant cache hit.
[2023-03-17 06:24:02] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 120/120 places, 80/80 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 119 transition count 80
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 119 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 117 transition count 78
Applied a total of 5 rules in 10 ms. Remains 117 /120 variables (removed 3) and now considering 78/80 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 78 rows 117 cols
[2023-03-17 06:24:02] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-17 06:24:02] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 06:24:02] [INFO ] [Nat]Absence check using 41 positive place invariants in 4 ms returned sat
[2023-03-17 06:24:02] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 06:24:02] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-17 06:24:02] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 352 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 150 reset in 220 ms.
Product exploration explored 100000 steps with 150 reset in 244 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-17 06:24:03] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 102 rows 152 cols
[2023-03-17 06:24:03] [INFO ] Computed 52 place invariants in 1 ms
[2023-03-17 06:24:03] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/152 places, 102/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 152/152 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin11726740543550179959
[2023-03-17 06:24:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11726740543550179959
Running compilation step : cd /tmp/ltsmin11726740543550179959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 206 ms.
Running link step : cd /tmp/ltsmin11726740543550179959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11726740543550179959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2473134536999241432.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 152 cols
[2023-03-17 06:24:18] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-17 06:24:19] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-17 06:24:19] [INFO ] Invariant cache hit.
[2023-03-17 06:24:19] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-17 06:24:19] [INFO ] Invariant cache hit.
[2023-03-17 06:24:19] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 152/152 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin13980038800984544925
[2023-03-17 06:24:19] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13980038800984544925
Running compilation step : cd /tmp/ltsmin13980038800984544925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 203 ms.
Running link step : cd /tmp/ltsmin13980038800984544925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13980038800984544925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9545610704176423371.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 06:24:34] [INFO ] Flatten gal took : 7 ms
[2023-03-17 06:24:34] [INFO ] Flatten gal took : 10 ms
[2023-03-17 06:24:34] [INFO ] Time to serialize gal into /tmp/LTL6813057168206435572.gal : 2 ms
[2023-03-17 06:24:34] [INFO ] Time to serialize properties into /tmp/LTL2157800424511805827.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6813057168206435572.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4563236060760086654.hoa' '-atoms' '/tmp/LTL2157800424511805827.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2157800424511805827.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4563236060760086654.hoa
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2023-03-17 06:24:49] [INFO ] Flatten gal took : 8 ms
[2023-03-17 06:24:49] [INFO ] Flatten gal took : 5 ms
[2023-03-17 06:24:49] [INFO ] Time to serialize gal into /tmp/LTL6577947779613874326.gal : 1 ms
[2023-03-17 06:24:49] [INFO ] Time to serialize properties into /tmp/LTL2638449182155545210.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6577947779613874326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2638449182155545210.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F(G("(r_1_16<=r_1_6)")))||(G(("(p_0_45<=p_0_15)")||(X((X("(p_1_4<=p_0_40)"))U(("(p_0_45<=p_0_15)")&&(X("(p_1_4<=p_0_40)")))))))))
Formula 0 simplified : GF!"(r_1_16<=r_1_6)" & F(!"(p_0_45<=p_0_15)" & X(!"(p_0_45<=p_0_15)" W X!"(p_1_4<=p_0_40)"))
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2023-03-17 06:25:04] [INFO ] Flatten gal took : 9 ms
[2023-03-17 06:25:04] [INFO ] Applying decomposition
[2023-03-17 06:25:04] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6165199241889790998.txt' '-o' '/tmp/graph6165199241889790998.bin' '-w' '/tmp/graph6165199241889790998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6165199241889790998.bin' '-l' '-1' '-v' '-w' '/tmp/graph6165199241889790998.weights' '-q' '0' '-e' '0.001'
[2023-03-17 06:25:04] [INFO ] Decomposing Gal with order
[2023-03-17 06:25:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 06:25:04] [INFO ] Flatten gal took : 10 ms
[2023-03-17 06:25:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-17 06:25:04] [INFO ] Time to serialize gal into /tmp/LTL12566893577690848824.gal : 2 ms
[2023-03-17 06:25:04] [INFO ] Time to serialize properties into /tmp/LTL9124655635052157807.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12566893577690848824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9124655635052157807.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(G("(gu49.r_1_16<=gu49.r_1_6)")))||(G(("(gu15.p_0_45<=gu15.p_0_15)")||(X((X("(gu48.p_1_4<=gu48.p_0_40)"))U(("(gu15.p_0_45<=gu15.p...204
Formula 0 simplified : GF!"(gu49.r_1_16<=gu49.r_1_6)" & F(!"(gu15.p_0_45<=gu15.p_0_15)" & X(!"(gu15.p_0_45<=gu15.p_0_15)" W X!"(gu48.p_1_4<=gu48.p_0_40)"))
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gi0.gu0.t51, gi0.gi1.gi1.gi1.gi1.gu47.t50, Intersection with reachable at each step ...212
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6672810966774617613
[2023-03-17 06:25:19] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6672810966774617613
Running compilation step : cd /tmp/ltsmin6672810966774617613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 200 ms.
Running link step : cd /tmp/ltsmin6672810966774617613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6672810966774617613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([]((LTLAPp0==true)))||[](((LTLAPp1==true)||X((X((LTLAPp2==true)) U ((LTLAPp1==true)&&X((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-11 finished in 110253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((G(p1) U (p0&&G(p1))))))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 162 transition count 100
Applied a total of 4 rules in 5 ms. Remains 162 /164 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 162 cols
[2023-03-17 06:25:34] [INFO ] Computed 64 place invariants in 1 ms
[2023-03-17 06:25:34] [INFO ] Implicit Places using invariants in 88 ms returned [104, 106, 110, 117, 119, 124, 129, 132, 134, 136, 142, 150, 153]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 89 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/164 places, 100/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96 ms. Remains : 149/164 places, 100/102 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s146 s12), p1:(LEQ 1 s89)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 150 reset in 230 ms.
Product exploration explored 100000 steps with 151 reset in 303 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) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (NOT p0))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 361 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (NOT p0))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 432 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 100 rows 149 cols
[2023-03-17 06:25:36] [INFO ] Computed 51 place invariants in 2 ms
[2023-03-17 06:25:36] [INFO ] [Real]Absence check using 51 positive place invariants in 8 ms returned sat
[2023-03-17 06:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:25:36] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-17 06:25:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:25:36] [INFO ] [Nat]Absence check using 51 positive place invariants in 13 ms returned sat
[2023-03-17 06:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:25:37] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-17 06:25:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-17 06:25:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-17 06:25:37] [INFO ] Computed and/alt/rep : 98/98/98 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 06:25:37] [INFO ] Added : 55 causal constraints over 11 iterations in 135 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-17 06:25:37] [INFO ] Invariant cache hit.
[2023-03-17 06:25:37] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-17 06:25:37] [INFO ] Invariant cache hit.
[2023-03-17 06:25:37] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-17 06:25:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 06:25:37] [INFO ] Invariant cache hit.
[2023-03-17 06:25:37] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 149/149 places, 100/100 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) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (NOT p0))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 330 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 30 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (X (NOT p0))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 410 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2023-03-17 06:25:38] [INFO ] Invariant cache hit.
[2023-03-17 06:25:38] [INFO ] [Real]Absence check using 51 positive place invariants in 8 ms returned sat
[2023-03-17 06:25:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 06:25:38] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-17 06:25:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 06:25:38] [INFO ] [Nat]Absence check using 51 positive place invariants in 9 ms returned sat
[2023-03-17 06:25:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 06:25:38] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-17 06:25:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-17 06:25:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-17 06:25:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-17 06:25:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 109 ms
[2023-03-17 06:25:39] [INFO ] Computed and/alt/rep : 98/98/98 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-17 06:25:39] [INFO ] Added : 55 causal constraints over 11 iterations in 113 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 150 reset in 257 ms.
Product exploration explored 100000 steps with 150 reset in 254 ms.
Built C files in :
/tmp/ltsmin11001128157489504417
[2023-03-17 06:25:39] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2023-03-17 06:25:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:25:39] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2023-03-17 06:25:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:25:39] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2023-03-17 06:25:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:25:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11001128157489504417
Running compilation step : cd /tmp/ltsmin11001128157489504417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 210 ms.
Running link step : cd /tmp/ltsmin11001128157489504417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11001128157489504417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8160312598176390115.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-17 06:25:54] [INFO ] Invariant cache hit.
[2023-03-17 06:25:55] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-17 06:25:55] [INFO ] Invariant cache hit.
[2023-03-17 06:25:55] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-17 06:25:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 06:25:55] [INFO ] Invariant cache hit.
[2023-03-17 06:25:55] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 275 ms. Remains : 149/149 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin17624661114299238573
[2023-03-17 06:25:55] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2023-03-17 06:25:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:25:55] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2023-03-17 06:25:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:25:55] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2023-03-17 06:25:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:25:55] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17624661114299238573
Running compilation step : cd /tmp/ltsmin17624661114299238573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 222 ms.
Running link step : cd /tmp/ltsmin17624661114299238573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17624661114299238573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10203393635625650823.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 06:26:10] [INFO ] Flatten gal took : 7 ms
[2023-03-17 06:26:10] [INFO ] Flatten gal took : 6 ms
[2023-03-17 06:26:10] [INFO ] Time to serialize gal into /tmp/LTL3405772040405530343.gal : 1 ms
[2023-03-17 06:26:10] [INFO ] Time to serialize properties into /tmp/LTL2183397752750869282.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3405772040405530343.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4575664637729789988.hoa' '-atoms' '/tmp/LTL2183397752750869282.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2183397752750869282.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4575664637729789988.hoa
Reverse transition relation is NOT exact ! Due to transitions t49.t50, t52.t51, Intersection with reachable at each step enabled. (destroyed/reverse/inter...178
Computing Next relation with stutter on 49 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
51 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.53148,33868,1,0,292,111914,229,162,4794,121506,367
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-12 finished in 36205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0)&&F(p1))||X(G(p0)))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 164 cols
[2023-03-17 06:26:10] [INFO ] Computed 64 place invariants in 1 ms
[2023-03-17 06:26:11] [INFO ] Implicit Places using invariants in 89 ms returned [106, 108, 112, 119, 121, 126, 131, 134, 136, 138, 144, 152, 155, 161]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 89 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/164 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 150/164 places, 102/102 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT s140 s122), p0:(LEQ s119 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4131 reset in 208 ms.
Product exploration explored 100000 steps with 4194 reset in 214 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), (X (NOT p1)), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 211 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=105 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 231 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 150 cols
[2023-03-17 06:26:12] [INFO ] Computed 50 place invariants in 0 ms
[2023-03-17 06:26:12] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-17 06:26:12] [INFO ] Invariant cache hit.
[2023-03-17 06:26:12] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-17 06:26:12] [INFO ] Invariant cache hit.
[2023-03-17 06:26:12] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 150/150 places, 102/102 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) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 452 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2804 steps, including 4 resets, run visited all 3 properties in 12 ms. (steps per millisecond=233 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2186 reset in 197 ms.
Product exploration explored 100000 steps with 2224 reset in 212 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 150 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-17 06:26:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 102 rows 150 cols
[2023-03-17 06:26:14] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-17 06:26:15] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/150 places, 102/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 150/150 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin9980796301615543588
[2023-03-17 06:26:15] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9980796301615543588
Running compilation step : cd /tmp/ltsmin9980796301615543588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 206 ms.
Running link step : cd /tmp/ltsmin9980796301615543588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9980796301615543588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2090896605717822761.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 150 cols
[2023-03-17 06:26:30] [INFO ] Computed 50 place invariants in 41 ms
[2023-03-17 06:26:30] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-17 06:26:30] [INFO ] Invariant cache hit.
[2023-03-17 06:26:30] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-17 06:26:30] [INFO ] Invariant cache hit.
[2023-03-17 06:26:30] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 150/150 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin6209912165720886104
[2023-03-17 06:26:30] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6209912165720886104
Running compilation step : cd /tmp/ltsmin6209912165720886104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 194 ms.
Running link step : cd /tmp/ltsmin6209912165720886104;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6209912165720886104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8325956692567556822.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 06:26:45] [INFO ] Flatten gal took : 6 ms
[2023-03-17 06:26:45] [INFO ] Flatten gal took : 5 ms
[2023-03-17 06:26:45] [INFO ] Time to serialize gal into /tmp/LTL2656537518411541439.gal : 2 ms
[2023-03-17 06:26:45] [INFO ] Time to serialize properties into /tmp/LTL3252281342802792785.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2656537518411541439.gal' '-t' 'CGAL' '-hoa' '/tmp/aut168595947689677370.hoa' '-atoms' '/tmp/LTL3252281342802792785.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL3252281342802792785.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut168595947689677370.hoa
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Computing Next relation with stutter on 49 deadlock states
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
426 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.2701,159652,1,0,2818,792553,233,3023,4649,1.18666e+06,6588
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-13 finished in 40078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0 U (p1||G(p0))))))))'
Found a Shortening insensitive property : ResAllocation-PT-R050C002-LTLCardinality-09
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 164/164 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 162 transition count 100
Applied a total of 4 rules in 4 ms. Remains 162 /164 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 162 cols
[2023-03-17 06:26:51] [INFO ] Computed 64 place invariants in 2 ms
[2023-03-17 06:26:51] [INFO ] Implicit Places using invariants in 94 ms returned [104, 106, 117, 119, 124, 129, 132, 134, 136, 142, 150, 153, 159]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 95 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 149/164 places, 100/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 102 ms. Remains : 149/164 places, 100/102 transitions.
Running random walk in product with property : ResAllocation-PT-R050C002-LTLCardinality-09 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=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GT 1 s108) (GT 1 s72)), p0:(GT 1 s72)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 151 reset in 205 ms.
Product exploration explored 100000 steps with 150 reset in 246 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 108 ms. (steps per millisecond=92 ) 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1770703 steps, run timeout after 3001 ms. (steps per millisecond=590 ) properties seen :{0=1}
Probabilistic random walk after 1770703 steps, saw 396317 distinct states, run finished after 3001 ms. (steps per millisecond=590 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 100 rows 149 cols
[2023-03-17 06:26:55] [INFO ] Computed 51 place invariants in 1 ms
[2023-03-17 06:26:55] [INFO ] [Real]Absence check using 51 positive place invariants in 5 ms returned sat
[2023-03-17 06:26:55] [INFO ] After 35ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:26:55] [INFO ] After 59ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 06:26:55] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 100/100 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 149 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 145 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 143 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 143 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 139 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 137 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 137 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 133 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 131 transition count 88
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 131 transition count 86
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 36 place count 127 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 40 place count 125 transition count 84
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 125 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 46 place count 121 transition count 82
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 5 with 4 rules applied. Total rules applied 50 place count 119 transition count 80
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 52 place count 119 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 56 place count 115 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 60 place count 113 transition count 76
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 62 place count 113 transition count 74
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 66 place count 109 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 70 place count 107 transition count 72
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 72 place count 107 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 76 place count 103 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 80 place count 101 transition count 68
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 82 place count 101 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 86 place count 97 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 91 place count 94 transition count 64
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 93 place count 94 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 97 place count 90 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 101 place count 88 transition count 60
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 103 place count 88 transition count 58
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 107 place count 84 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 111 place count 82 transition count 56
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 113 place count 82 transition count 54
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 117 place count 78 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 121 place count 76 transition count 52
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 123 place count 76 transition count 50
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 127 place count 72 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 129 place count 71 transition count 49
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 131 place count 71 transition count 47
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 134 place count 68 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 136 place count 67 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 137 place count 67 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 139 place count 65 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 141 place count 64 transition count 44
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 142 place count 64 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 144 place count 62 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 146 place count 61 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 147 place count 61 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 149 place count 59 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 151 place count 58 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 152 place count 58 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 154 place count 56 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 156 place count 55 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 157 place count 55 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 159 place count 53 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 161 place count 52 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 162 place count 52 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 164 place count 50 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 166 place count 49 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 167 place count 49 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 169 place count 47 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 171 place count 46 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 172 place count 46 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 174 place count 44 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 176 place count 43 transition count 30
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 177 place count 43 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 179 place count 41 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 181 place count 40 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 182 place count 40 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 184 place count 38 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 186 place count 37 transition count 26
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 187 place count 37 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 189 place count 35 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 191 place count 34 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 192 place count 34 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 194 place count 32 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 196 place count 31 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 197 place count 31 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 199 place count 29 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 201 place count 28 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 202 place count 28 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 204 place count 26 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 206 place count 25 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 207 place count 25 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 209 place count 23 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 211 place count 22 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 212 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 214 place count 20 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 216 place count 19 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 217 place count 19 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 219 place count 17 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 221 place count 16 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 222 place count 16 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 224 place count 14 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 226 place count 13 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 227 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 229 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 231 place count 10 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 232 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 234 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 236 place count 7 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 237 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 239 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 241 place count 4 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 242 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 242 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 36 with 3 rules applied. Total rules applied 245 place count 2 transition count 2
Applied a total of 245 rules in 51 ms. Remains 2 /149 variables (removed 147) and now considering 2/100 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 2/149 places, 2/100 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-17 06:26:55] [INFO ] Invariant cache hit.
[2023-03-17 06:26:55] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-17 06:26:55] [INFO ] Invariant cache hit.
[2023-03-17 06:26:56] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-17 06:26:56] [INFO ] Invariant cache hit.
[2023-03-17 06:26:56] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 149/149 places, 100/100 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 p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1734291 steps, run timeout after 3001 ms. (steps per millisecond=577 ) properties seen :{0=1}
Probabilistic random walk after 1734291 steps, saw 389490 distinct states, run finished after 3002 ms. (steps per millisecond=577 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-17 06:26:59] [INFO ] Invariant cache hit.
[2023-03-17 06:26:59] [INFO ] [Real]Absence check using 51 positive place invariants in 5 ms returned sat
[2023-03-17 06:26:59] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 06:26:59] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 06:26:59] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 100/100 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 149 transition count 98
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 145 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 143 transition count 96
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 143 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 139 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 137 transition count 92
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 137 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 133 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 131 transition count 88
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 131 transition count 86
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 36 place count 127 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 40 place count 125 transition count 84
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 125 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 46 place count 121 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 50 place count 119 transition count 80
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 52 place count 119 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 56 place count 115 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 60 place count 113 transition count 76
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 62 place count 113 transition count 74
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 66 place count 109 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 70 place count 107 transition count 72
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 72 place count 107 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 76 place count 103 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 80 place count 101 transition count 68
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 82 place count 101 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 86 place count 97 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 91 place count 94 transition count 64
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 93 place count 94 transition count 62
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 97 place count 90 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 101 place count 88 transition count 60
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 103 place count 88 transition count 58
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 107 place count 84 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 111 place count 82 transition count 56
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 113 place count 82 transition count 54
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 117 place count 78 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 121 place count 76 transition count 52
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 123 place count 76 transition count 50
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 127 place count 72 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 129 place count 71 transition count 49
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 131 place count 71 transition count 47
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 134 place count 68 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 136 place count 67 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 137 place count 67 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 139 place count 65 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 141 place count 64 transition count 44
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 142 place count 64 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 144 place count 62 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 146 place count 61 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 147 place count 61 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 149 place count 59 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 151 place count 58 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 152 place count 58 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 154 place count 56 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 156 place count 55 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 157 place count 55 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 159 place count 53 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 161 place count 52 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 162 place count 52 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 164 place count 50 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 166 place count 49 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 167 place count 49 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 169 place count 47 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 171 place count 46 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 172 place count 46 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 174 place count 44 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 176 place count 43 transition count 30
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 177 place count 43 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 179 place count 41 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 181 place count 40 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 23 with 1 rules applied. Total rules applied 182 place count 40 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 184 place count 38 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 186 place count 37 transition count 26
Free-agglomeration rule applied 1 times.
Iterating global reduction 24 with 1 rules applied. Total rules applied 187 place count 37 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 189 place count 35 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 191 place count 34 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 25 with 1 rules applied. Total rules applied 192 place count 34 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 194 place count 32 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 196 place count 31 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 197 place count 31 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 199 place count 29 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 201 place count 28 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 27 with 1 rules applied. Total rules applied 202 place count 28 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 204 place count 26 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 206 place count 25 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 28 with 1 rules applied. Total rules applied 207 place count 25 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 209 place count 23 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 211 place count 22 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 212 place count 22 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 214 place count 20 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 216 place count 19 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 30 with 1 rules applied. Total rules applied 217 place count 19 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 219 place count 17 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 221 place count 16 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 31 with 1 rules applied. Total rules applied 222 place count 16 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 224 place count 14 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 226 place count 13 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 32 with 1 rules applied. Total rules applied 227 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 229 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 231 place count 10 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 33 with 1 rules applied. Total rules applied 232 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 234 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 236 place count 7 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 237 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 239 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 241 place count 4 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 242 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 242 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 36 with 3 rules applied. Total rules applied 245 place count 2 transition count 2
Applied a total of 245 rules in 35 ms. Remains 2 /149 variables (removed 147) and now considering 2/100 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 2/149 places, 2/100 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 150 reset in 210 ms.
Product exploration explored 100000 steps with 150 reset in 230 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-17 06:27:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 06:27:00] [INFO ] Invariant cache hit.
[2023-03-17 06:27:00] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 149/149 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin7972065607970796487
[2023-03-17 06:27:00] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7972065607970796487
Running compilation step : cd /tmp/ltsmin7972065607970796487;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 210 ms.
Running link step : cd /tmp/ltsmin7972065607970796487;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7972065607970796487;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17021698867580104606.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 149 /149 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-17 06:27:16] [INFO ] Invariant cache hit.
[2023-03-17 06:27:16] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-17 06:27:16] [INFO ] Invariant cache hit.
[2023-03-17 06:27:16] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-17 06:27:16] [INFO ] Invariant cache hit.
[2023-03-17 06:27:16] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 149/149 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin7679099428147470759
[2023-03-17 06:27:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7679099428147470759
Running compilation step : cd /tmp/ltsmin7679099428147470759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 206 ms.
Running link step : cd /tmp/ltsmin7679099428147470759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7679099428147470759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16990897114910412093.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 06:27:31] [INFO ] Flatten gal took : 4 ms
[2023-03-17 06:27:31] [INFO ] Flatten gal took : 11 ms
[2023-03-17 06:27:31] [INFO ] Time to serialize gal into /tmp/LTL27675798957872151.gal : 3 ms
[2023-03-17 06:27:31] [INFO ] Time to serialize properties into /tmp/LTL4853262247609387276.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL27675798957872151.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2822153922616109995.hoa' '-atoms' '/tmp/LTL4853262247609387276.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL4853262247609387276.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2822153922616109995.hoa
Reverse transition relation is NOT exact ! Due to transitions t49.t50, t52.t51, Intersection with reachable at each step enabled. (destroyed/reverse/inter...178
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2023-03-17 06:27:46] [INFO ] Flatten gal took : 5 ms
[2023-03-17 06:27:46] [INFO ] Flatten gal took : 5 ms
[2023-03-17 06:27:46] [INFO ] Time to serialize gal into /tmp/LTL16255212220070014894.gal : 1 ms
[2023-03-17 06:27:46] [INFO ] Time to serialize properties into /tmp/LTL1511951158866192840.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16255212220070014894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1511951158866192840.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(p_0_36<1)")U((G("(p_0_36<1)"))||("((r_1_9<1)&&(p_0_36<1))"))))))))
Formula 0 simplified : XXXG(!"(p_0_36<1)" M !"((r_1_9<1)&&(p_0_36<1))")
Reverse transition relation is NOT exact ! Due to transitions t49.t50, t52.t51, Intersection with reachable at each step enabled. (destroyed/reverse/inter...178
Computing Next relation with stutter on 49 deadlock states
Detected timeout of ITS tools.
[2023-03-17 06:28:01] [INFO ] Flatten gal took : 7 ms
[2023-03-17 06:28:01] [INFO ] Applying decomposition
[2023-03-17 06:28:01] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14032601564481755637.txt' '-o' '/tmp/graph14032601564481755637.bin' '-w' '/tmp/graph14032601564481755637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14032601564481755637.bin' '-l' '-1' '-v' '-w' '/tmp/graph14032601564481755637.weights' '-q' '0' '-e' '0.001'
[2023-03-17 06:28:01] [INFO ] Decomposing Gal with order
[2023-03-17 06:28:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 06:28:01] [INFO ] Flatten gal took : 8 ms
[2023-03-17 06:28:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-17 06:28:01] [INFO ] Time to serialize gal into /tmp/LTL10744769535344419524.gal : 2 ms
[2023-03-17 06:28:01] [INFO ] Time to serialize properties into /tmp/LTL18110893284603279808.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10744769535344419524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18110893284603279808.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("(i7.i1.u36.p_0_36<1)")U((G("(i7.i1.u36.p_0_36<1)"))||("((i2.i0.u50.r_1_9<1)&&(i7.i1.u36.p_0_36<1))"))))))))
Formula 0 simplified : XXXG(!"(i7.i1.u36.p_0_36<1)" M !"((i2.i0.u50.r_1_9<1)&&(i7.i1.u36.p_0_36<1))")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t52_t51, i10.i1.t49_t50, Intersection with reachable at each step enabled. (destroyed/...191
Computing Next relation with stutter on 49 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1167 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.6865,354672,1,0,759002,53,932,511473,68,71,396112
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ResAllocation-PT-R050C002-LTLCardinality-09 finished in 84241 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1||X((X(p2) U (p1&&X(p2))))))))'
[2023-03-17 06:28:15] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9390529349455884594
[2023-03-17 06:28:15] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2023-03-17 06:28:15] [INFO ] Applying decomposition
[2023-03-17 06:28:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:28:15] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2023-03-17 06:28:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:28:15] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2023-03-17 06:28:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 06:28:15] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9390529349455884594
Running compilation step : cd /tmp/ltsmin9390529349455884594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-17 06:28:15] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3481239301239570534.txt' '-o' '/tmp/graph3481239301239570534.bin' '-w' '/tmp/graph3481239301239570534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3481239301239570534.bin' '-l' '-1' '-v' '-w' '/tmp/graph3481239301239570534.weights' '-q' '0' '-e' '0.001'
[2023-03-17 06:28:15] [INFO ] Decomposing Gal with order
[2023-03-17 06:28:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 06:28:15] [INFO ] Flatten gal took : 18 ms
[2023-03-17 06:28:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2023-03-17 06:28:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality7077575574045355112.gal : 6 ms
[2023-03-17 06:28:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality15659870926089106485.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7077575574045355112.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15659870926089106485.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((X(X(X(F(("(gi1.gi1.gi2.gi1.gi1.gu36.p_0_36<1)")U(("((gi1.gi0.gu52.r_1_9<1)&&(gi1.gi1.gi2.gi1.gi1.gu36.p_0_36<1))")||(G("(gi1.gi1.gi...189
Formula 0 simplified : XXXG(!"(gi1.gi1.gi2.gi1.gi1.gu36.p_0_36<1)" M !"((gi1.gi0.gu52.r_1_9<1)&&(gi1.gi1.gi2.gi1.gi1.gu36.p_0_36<1))")
Compilation finished in 253 ms.
Running link step : cd /tmp/ltsmin9390529349455884594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9390529349455884594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.gu0.t51, gi1.gi1.gi3.gu49.t50, Intersection with reachable at each step enabled. (de...200
Computing Next relation with stutter on 49 deadlock states
LTSmin run took 212 ms.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9390529349455884594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([]((LTLAPp2==true)))||[](((LTLAPp3==true)||X((X((LTLAPp4==true)) U ((LTLAPp3==true)&&X((LTLAPp4==true))))))))' '--buchi-type=spotba'
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
4030 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,40.3276,1065328,1,0,8815,5.7255e+06,240,8761,4976,9.44109e+06,16271
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Checking formula 1 : !(((F(G("(gu51.r_1_16<=gu51.r_1_6)")))||(G(("(gu15.p_0_45<=gu15.p_0_15)")||(X((X("(gu40.p_1_4<=gu40.p_0_40)"))U(("(gu15.p_0_45<=gu15.p...204
Formula 1 simplified : GF!"(gu51.r_1_16<=gu51.r_1_6)" & F(!"(gu15.p_0_45<=gu15.p_0_15)" & X(!"(gu15.p_0_45<=gu15.p_0_15)" W X!"(gu40.p_1_4<=gu40.p_0_40)"))
Computing Next relation with stutter on 49 deadlock states
701 unique states visited
0 strongly connected components in search stack
703 transitions explored
353 items max in DFS search stack
4314 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,83.4694,1924312,1,0,9866,9.85356e+06,260,9815,5189,1.54106e+07,20841
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R050C002-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: LTL layer: formula: (<>([]((LTLAPp2==true)))||[](((LTLAPp3==true)||X((X((LTLAPp4==true)) U ((LTLAPp3==true)&&X((LTLAPp4==true))))))))
pins2lts-mc-linux64( 2/ 8), 0.002: "(<>([]((LTLAPp2==true)))||[](((LTLAPp3==true)||X((X((LTLAPp4==true)) U ((LTLAPp3==true)&&X((LTLAPp4==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.033: There are 108 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.033: State length is 165, there are 115 groups
pins2lts-mc-linux64( 0/ 8), 0.033: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.033: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.033: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.033: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.079: [Blue] ~120 levels ~960 states ~4584 transitions
pins2lts-mc-linux64( 3/ 8), 0.132: [Blue] ~240 levels ~1920 states ~11880 transitions
pins2lts-mc-linux64( 3/ 8), 0.203: [Blue] ~480 levels ~3840 states ~21072 transitions
pins2lts-mc-linux64( 3/ 8), 0.246: [Blue] ~661 levels ~7680 states ~31512 transitions
pins2lts-mc-linux64( 1/ 8), 0.300: [Blue] ~667 levels ~15360 states ~55504 transitions
pins2lts-mc-linux64( 3/ 8), 0.419: [Blue] ~661 levels ~30720 states ~108624 transitions
pins2lts-mc-linux64( 3/ 8), 0.619: [Blue] ~661 levels ~61440 states ~231384 transitions
pins2lts-mc-linux64( 3/ 8), 1.019: [Blue] ~661 levels ~122880 states ~483272 transitions
pins2lts-mc-linux64( 1/ 8), 1.698: [Blue] ~667 levels ~245760 states ~1046464 transitions
pins2lts-mc-linux64( 1/ 8), 2.794: [Blue] ~667 levels ~491520 states ~2225568 transitions
pins2lts-mc-linux64( 3/ 8), 4.434: [Blue] ~661 levels ~983040 states ~4731336 transitions
pins2lts-mc-linux64( 7/ 8), 6.743: [Blue] ~660 levels ~1966080 states ~7276016 transitions
pins2lts-mc-linux64( 7/ 8), 11.488: [Blue] ~660 levels ~3932160 states ~16343000 transitions
pins2lts-mc-linux64( 7/ 8), 21.640: [Blue] ~660 levels ~7864320 states ~34850192 transitions
pins2lts-mc-linux64( 7/ 8), 40.583: [Blue] ~660 levels ~15728640 states ~71183832 transitions
pins2lts-mc-linux64( 7/ 8), 81.802: [Blue] ~660 levels ~31457280 states ~155489800 transitions
pins2lts-mc-linux64( 7/ 8), 167.896: [Blue] ~660 levels ~62914560 states ~328742312 transitions
pins2lts-mc-linux64( 5/ 8), 189.224: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 189.265:
pins2lts-mc-linux64( 0/ 8), 189.265: Explored 58827481 states 371613378 transitions, fanout: 6.317
pins2lts-mc-linux64( 0/ 8), 189.265: Total exploration time 189.200 sec (189.160 sec minimum, 189.182 sec on average)
pins2lts-mc-linux64( 0/ 8), 189.265: States per second: 310928, Transitions per second: 1964130
pins2lts-mc-linux64( 0/ 8), 189.265:
pins2lts-mc-linux64( 0/ 8), 189.265: State space has 52389841 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 189.265: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 189.265: blue states: 58827481 (112.29%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 189.265: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 189.265: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 189.265:
pins2lts-mc-linux64( 0/ 8), 189.265: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 189.265:
pins2lts-mc-linux64( 0/ 8), 189.265: Queue width: 8B, total height: 5222, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 189.265: Tree memory: 655.7MB, 13.1 B/state, compr.: 2.0%
pins2lts-mc-linux64( 0/ 8), 189.265: Tree fill ratio (roots/leafs): 39.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 189.265: Stored 103 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 189.265: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 189.265: Est. total memory use: 655.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9390529349455884594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([]((LTLAPp2==true)))||[](((LTLAPp3==true)||X((X((LTLAPp4==true)) U ((LTLAPp3==true)&&X((LTLAPp4==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9390529349455884594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([]((LTLAPp2==true)))||[](((LTLAPp3==true)||X((X((LTLAPp4==true)) U ((LTLAPp3==true)&&X((LTLAPp4==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Total runtime 641414 ms.

BK_STOP 1679034705079

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="ResAllocation-PT-R050C002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R050C002, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r325-tall-167889197600763"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R050C002.tgz
mv ResAllocation-PT-R050C002 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;