Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975000299.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVt-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975000299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 364K 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 ShieldRVt-PT-030B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679172799857

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=ShieldRVt-PT-030B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 20:53:22] [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-18 20:53:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:53:22] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-18 20:53:22] [INFO ] Transformed 1503 places.
[2023-03-18 20:53:22] [INFO ] Transformed 1503 transitions.
[2023-03-18 20:53:22] [INFO ] Found NUPN structural information;
[2023-03-18 20:53:22] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-030B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 321 places :
Symmetric choice reduction at 0 with 321 rule applications. Total rules 321 place count 1182 transition count 1182
Iterating global reduction 0 with 321 rules applied. Total rules applied 642 place count 1182 transition count 1182
Applied a total of 642 rules in 272 ms. Remains 1182 /1503 variables (removed 321) and now considering 1182/1503 (removed 321) transitions.
// Phase 1: matrix 1182 rows 1182 cols
[2023-03-18 20:53:23] [INFO ] Computed 121 place invariants in 29 ms
[2023-03-18 20:53:23] [INFO ] Implicit Places using invariants in 683 ms returned []
[2023-03-18 20:53:23] [INFO ] Invariant cache hit.
[2023-03-18 20:53:24] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1654 ms to find 0 implicit places.
[2023-03-18 20:53:24] [INFO ] Invariant cache hit.
[2023-03-18 20:53:25] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1503 places, 1182/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2436 ms. Remains : 1182/1503 places, 1182/1503 transitions.
Support contains 23 out of 1182 places after structural reductions.
[2023-03-18 20:53:25] [INFO ] Flatten gal took : 126 ms
[2023-03-18 20:53:25] [INFO ] Flatten gal took : 44 ms
[2023-03-18 20:53:25] [INFO ] Input system was already deterministic with 1182 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 17 ms. (steps per millisecond=588 ) 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
Running SMT prover for 5 properties.
[2023-03-18 20:53:26] [INFO ] Invariant cache hit.
[2023-03-18 20:53:26] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:53:27] [INFO ] [Nat]Absence check using 121 positive place invariants in 56 ms returned sat
[2023-03-18 20:53:27] [INFO ] After 502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:53:28] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 4 ms to minimize.
[2023-03-18 20:53:28] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 1 ms to minimize.
[2023-03-18 20:53:28] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 1 ms to minimize.
[2023-03-18 20:53:28] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 1 ms to minimize.
[2023-03-18 20:53:29] [INFO ] Deduced a trap composed of 21 places in 330 ms of which 1 ms to minimize.
[2023-03-18 20:53:29] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 0 ms to minimize.
[2023-03-18 20:53:29] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 1 ms to minimize.
[2023-03-18 20:53:29] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 1 ms to minimize.
[2023-03-18 20:53:30] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 0 ms to minimize.
[2023-03-18 20:53:30] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 1 ms to minimize.
[2023-03-18 20:53:30] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 0 ms to minimize.
[2023-03-18 20:53:31] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 1 ms to minimize.
[2023-03-18 20:53:31] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2023-03-18 20:53:31] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 1 ms to minimize.
[2023-03-18 20:53:31] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 0 ms to minimize.
[2023-03-18 20:53:31] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 1 ms to minimize.
[2023-03-18 20:53:31] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 0 ms to minimize.
[2023-03-18 20:53:31] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 0 ms to minimize.
[2023-03-18 20:53:32] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 1 ms to minimize.
[2023-03-18 20:53:32] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 13 ms to minimize.
[2023-03-18 20:53:32] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4390 ms
[2023-03-18 20:53:32] [INFO ] After 5123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-18 20:53:32] [INFO ] After 5822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 117 ms.
Support contains 9 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1182 transition count 855
Reduce places removed 327 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 329 rules applied. Total rules applied 656 place count 855 transition count 853
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 658 place count 854 transition count 852
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 659 place count 853 transition count 852
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 232 Pre rules applied. Total rules applied 659 place count 853 transition count 620
Deduced a syphon composed of 232 places in 3 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 4 with 464 rules applied. Total rules applied 1123 place count 621 transition count 620
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1128 place count 616 transition count 615
Iterating global reduction 4 with 5 rules applied. Total rules applied 1133 place count 616 transition count 615
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1133 place count 616 transition count 611
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1141 place count 612 transition count 611
Performed 271 Post agglomeration using F-continuation condition.Transition count delta: 271
Deduced a syphon composed of 271 places in 1 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 4 with 542 rules applied. Total rules applied 1683 place count 341 transition count 340
Renaming transitions due to excessive name length > 1024 char.
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -82
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 1857 place count 254 transition count 422
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1858 place count 254 transition count 421
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1859 place count 254 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1860 place count 253 transition count 420
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1861 place count 253 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1862 place count 252 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1863 place count 251 transition count 418
Applied a total of 1863 rules in 345 ms. Remains 251 /1182 variables (removed 931) and now considering 418/1182 (removed 764) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 251/1182 places, 418/1182 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 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 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 138091 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{4=1}
Probabilistic random walk after 138091 steps, saw 95662 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 418 rows 251 cols
[2023-03-18 20:53:36] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-18 20:53:36] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 20:53:36] [INFO ] [Nat]Absence check using 120 positive place invariants in 12 ms returned sat
[2023-03-18 20:53:36] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 20:53:36] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-18 20:53:36] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 29 ms.
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 418/418 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 251 transition count 416
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 249 transition count 416
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 249 transition count 415
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 248 transition count 415
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 245 transition count 412
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 16 place count 243 transition count 414
Applied a total of 16 rules in 34 ms. Remains 243 /251 variables (removed 8) and now considering 414/418 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 243/251 places, 414/418 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 640672 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 640672 steps, saw 455088 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 414 rows 243 cols
[2023-03-18 20:53:40] [INFO ] Computed 120 place invariants in 3 ms
[2023-03-18 20:53:40] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:53:40] [INFO ] [Nat]Absence check using 120 positive place invariants in 17 ms returned sat
[2023-03-18 20:53:40] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:53:40] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 20:53:40] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 414/414 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 243/243 places, 414/414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 414/414 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2023-03-18 20:53:40] [INFO ] Invariant cache hit.
[2023-03-18 20:53:40] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-18 20:53:40] [INFO ] Invariant cache hit.
[2023-03-18 20:53:41] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2023-03-18 20:53:41] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-18 20:53:41] [INFO ] Invariant cache hit.
[2023-03-18 20:53:41] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 922 ms. Remains : 243/243 places, 414/414 transitions.
Graph (trivial) has 117 edges and 243 vertex of which 4 / 243 are part of one of the 2 SCC in 15 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 825 edges and 241 vertex of which 239 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 114 edges and 237 vertex of which 4 / 237 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 235 transition count 405
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 113 edges and 233 vertex of which 6 / 233 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 230 transition count 396
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 111 edges and 227 vertex of which 8 / 227 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 223 transition count 385
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 107 edges and 219 vertex of which 8 / 219 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 215 transition count 371
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 103 edges and 211 vertex of which 8 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 207 transition count 357
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 203 vertex of which 8 / 203 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 199 transition count 343
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 195 vertex of which 8 / 195 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 191 transition count 329
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 187 vertex of which 8 / 187 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 183 transition count 315
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 179 vertex of which 8 / 179 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 175 transition count 301
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 171 vertex of which 8 / 171 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 167 transition count 287
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 79 edges and 163 vertex of which 8 / 163 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 159 transition count 273
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 75 edges and 155 vertex of which 8 / 155 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 151 transition count 259
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 71 edges and 147 vertex of which 8 / 147 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 143 transition count 245
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 67 edges and 139 vertex of which 8 / 139 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 135 transition count 231
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 63 edges and 131 vertex of which 6 / 131 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 128 transition count 217
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 60 edges and 125 vertex of which 6 / 125 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 14 rules applied. Total rules applied 277 place count 122 transition count 207
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 57 edges and 119 vertex of which 6 / 119 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 16 rules applied. Total rules applied 293 place count 116 transition count 195
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 55 edges and 113 vertex of which 8 / 113 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 15 rules applied. Total rules applied 308 place count 109 transition count 184
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 52 edges and 105 vertex of which 8 / 105 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 18 rules applied. Total rules applied 326 place count 101 transition count 171
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (trivial) has 47 edges and 97 vertex of which 6 / 97 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 22 rules applied. Total rules applied 348 place count 94 transition count 154
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 44 edges and 90 vertex of which 6 / 90 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 20 with 17 rules applied. Total rules applied 365 place count 87 transition count 142
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 42 edges and 84 vertex of which 8 / 84 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 15 rules applied. Total rules applied 380 place count 80 transition count 131
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 228 edges and 76 vertex of which 70 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 35 edges and 70 vertex of which 8 / 70 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 21 rules applied. Total rules applied 401 place count 66 transition count 111
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 31 edges and 62 vertex of which 8 / 62 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 18 rules applied. Total rules applied 419 place count 58 transition count 98
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 27 edges and 54 vertex of which 8 / 54 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 438 place count 50 transition count 84
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 23 edges and 47 vertex of which 6 / 47 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 25 with 18 rules applied. Total rules applied 456 place count 44 transition count 70
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 21 edges and 41 vertex of which 8 / 41 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 15 rules applied. Total rules applied 471 place count 37 transition count 59
Discarding 24 places :
Also discarding 42 output transitions
Drop transitions removed 42 transitions
Remove reverse transitions (loop back) rule discarded transition t31.t28.t29 and 24 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 27 with 11 rules applied. Total rules applied 482 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 28 with 2 Pre rules applied. Total rules applied 482 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 6 rules applied. Total rules applied 488 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 28 with 1 Pre rules applied. Total rules applied 488 place count 5 transition count 4
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 490 place count 4 transition count 4
Applied a total of 490 rules in 68 ms. Remains 4 /243 variables (removed 239) and now considering 4/414 (removed 410) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-18 20:53:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-18 20:53:41] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:53:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 20:53:41] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:53:41] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-18 20:53:41] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 362 stabilizing places and 362 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U p1))))'
Support contains 3 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1174 transition count 1174
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1173 transition count 1173
Applied a total of 18 rules in 88 ms. Remains 1173 /1182 variables (removed 9) and now considering 1173/1182 (removed 9) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-18 20:53:42] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-18 20:53:42] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-18 20:53:42] [INFO ] Invariant cache hit.
[2023-03-18 20:53:42] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2023-03-18 20:53:43] [INFO ] Invariant cache hit.
[2023-03-18 20:53:43] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1182 places, 1173/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1547 ms. Remains : 1173/1182 places, 1173/1182 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s723 1), p0:(OR (EQ s272 0) (EQ s583 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 523 ms.
Product exploration explored 100000 steps with 1 reset in 641 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), true, (X (X (OR p1 p0))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 365 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 154149 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154149 steps, saw 72954 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 20:53:48] [INFO ] Invariant cache hit.
[2023-03-18 20:53:48] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 20:53:49] [INFO ] [Nat]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-18 20:53:49] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 20:53:49] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 0 ms to minimize.
[2023-03-18 20:53:49] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 1 ms to minimize.
[2023-03-18 20:53:50] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 1 ms to minimize.
[2023-03-18 20:53:50] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 0 ms to minimize.
[2023-03-18 20:53:50] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 1 ms to minimize.
[2023-03-18 20:53:50] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 0 ms to minimize.
[2023-03-18 20:53:51] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 1 ms to minimize.
[2023-03-18 20:53:51] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 0 ms to minimize.
[2023-03-18 20:53:51] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 0 ms to minimize.
[2023-03-18 20:53:51] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 1 ms to minimize.
[2023-03-18 20:53:51] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 3 ms to minimize.
[2023-03-18 20:53:52] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 0 ms to minimize.
[2023-03-18 20:53:52] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 0 ms to minimize.
[2023-03-18 20:53:52] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 0 ms to minimize.
[2023-03-18 20:53:52] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 1 ms to minimize.
[2023-03-18 20:53:52] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 1 ms to minimize.
[2023-03-18 20:53:52] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2023-03-18 20:53:53] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 0 ms to minimize.
[2023-03-18 20:53:53] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2023-03-18 20:53:53] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 1 ms to minimize.
[2023-03-18 20:53:53] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 1 ms to minimize.
[2023-03-18 20:53:53] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 0 ms to minimize.
[2023-03-18 20:53:53] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4366 ms
[2023-03-18 20:53:54] [INFO ] Deduced a trap composed of 48 places in 234 ms of which 8 ms to minimize.
[2023-03-18 20:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-18 20:53:54] [INFO ] After 5377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-18 20:53:54] [INFO ] After 5746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 94 ms.
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1173 transition count 847
Reduce places removed 326 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 327 rules applied. Total rules applied 653 place count 847 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 654 place count 846 transition count 846
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 654 place count 846 transition count 607
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1132 place count 607 transition count 607
Performed 271 Post agglomeration using F-continuation condition.Transition count delta: 271
Deduced a syphon composed of 271 places in 0 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 3 with 542 rules applied. Total rules applied 1674 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1675 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
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 1677 place count 335 transition count 334
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1855 place count 246 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1856 place count 246 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1857 place count 245 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1858 place count 244 transition count 418
Applied a total of 1858 rules in 94 ms. Remains 244 /1173 variables (removed 929) and now considering 418/1173 (removed 755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 244/1173 places, 418/1173 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :1
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 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 418 rows 244 cols
[2023-03-18 20:53:55] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-18 20:53:55] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:53:55] [INFO ] [Nat]Absence check using 120 positive place invariants in 10 ms returned sat
[2023-03-18 20:53:55] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 20:53:55] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-18 20:53:55] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 87 ms.
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 418/418 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 244/244 places, 418/418 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 258068 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 258068 steps, saw 169695 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 20:53:58] [INFO ] Invariant cache hit.
[2023-03-18 20:53:58] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:53:59] [INFO ] [Nat]Absence check using 120 positive place invariants in 13 ms returned sat
[2023-03-18 20:53:59] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 20:53:59] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-18 20:53:59] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 129 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=64 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), true, (X (X (OR p1 p0))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 396 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-18 20:54:00] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-18 20:54:00] [INFO ] [Real]Absence check using 121 positive place invariants in 67 ms returned sat
[2023-03-18 20:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:54:02] [INFO ] [Real]Absence check using state equation in 1722 ms returned sat
[2023-03-18 20:54:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:54:02] [INFO ] [Nat]Absence check using 121 positive place invariants in 76 ms returned sat
[2023-03-18 20:54:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:54:04] [INFO ] [Nat]Absence check using state equation in 1988 ms returned sat
[2023-03-18 20:54:04] [INFO ] Computed and/alt/rep : 1172/1713/1172 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-18 20:54:17] [INFO ] Added : 730 causal constraints over 146 iterations in 12493 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Applied a total of 0 rules in 36 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
[2023-03-18 20:54:17] [INFO ] Invariant cache hit.
[2023-03-18 20:54:17] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-18 20:54:17] [INFO ] Invariant cache hit.
[2023-03-18 20:54:18] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2023-03-18 20:54:18] [INFO ] Invariant cache hit.
[2023-03-18 20:54:18] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1733 ms. Remains : 1173/1173 places, 1173/1173 transitions.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (AND p0 (NOT p1))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 346 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 259145 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259145 steps, saw 113829 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 20:54:22] [INFO ] Invariant cache hit.
[2023-03-18 20:54:22] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 20:54:22] [INFO ] [Nat]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-18 20:54:23] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 20:54:23] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 1 ms to minimize.
[2023-03-18 20:54:23] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 1 ms to minimize.
[2023-03-18 20:54:24] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 0 ms to minimize.
[2023-03-18 20:54:24] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 1 ms to minimize.
[2023-03-18 20:54:24] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 0 ms to minimize.
[2023-03-18 20:54:24] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 15 ms to minimize.
[2023-03-18 20:54:25] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 1 ms to minimize.
[2023-03-18 20:54:25] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 0 ms to minimize.
[2023-03-18 20:54:25] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 1 ms to minimize.
[2023-03-18 20:54:25] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 1 ms to minimize.
[2023-03-18 20:54:25] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 1 ms to minimize.
[2023-03-18 20:54:26] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 0 ms to minimize.
[2023-03-18 20:54:26] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 2 ms to minimize.
[2023-03-18 20:54:26] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 1 ms to minimize.
[2023-03-18 20:54:26] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 0 ms to minimize.
[2023-03-18 20:54:26] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2023-03-18 20:54:26] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
[2023-03-18 20:54:27] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 8 ms to minimize.
[2023-03-18 20:54:27] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 1 ms to minimize.
[2023-03-18 20:54:27] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 1 ms to minimize.
[2023-03-18 20:54:27] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 0 ms to minimize.
[2023-03-18 20:54:27] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2023-03-18 20:54:27] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4296 ms
[2023-03-18 20:54:28] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 1 ms to minimize.
[2023-03-18 20:54:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-18 20:54:28] [INFO ] After 5205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-18 20:54:28] [INFO ] After 5525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 83 ms.
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1173 transition count 847
Reduce places removed 326 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 327 rules applied. Total rules applied 653 place count 847 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 654 place count 846 transition count 846
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 654 place count 846 transition count 607
Deduced a syphon composed of 239 places in 0 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1132 place count 607 transition count 607
Performed 271 Post agglomeration using F-continuation condition.Transition count delta: 271
Deduced a syphon composed of 271 places in 0 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 3 with 542 rules applied. Total rules applied 1674 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1675 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
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 1677 place count 335 transition count 334
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1855 place count 246 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1856 place count 246 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1857 place count 245 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1858 place count 244 transition count 418
Applied a total of 1858 rules in 90 ms. Remains 244 /1173 variables (removed 929) and now considering 418/1173 (removed 755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 244/1173 places, 418/1173 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 418 rows 244 cols
[2023-03-18 20:54:28] [INFO ] Computed 120 place invariants in 0 ms
[2023-03-18 20:54:28] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:54:28] [INFO ] [Nat]Absence check using 120 positive place invariants in 10 ms returned sat
[2023-03-18 20:54:29] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 20:54:29] [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 23 ms.
[2023-03-18 20:54:29] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 122 steps, including 1 resets, run visited all 3 properties in 2 ms. (steps per millisecond=61 )
Parikh walk visited 3 properties in 29 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (AND p0 (NOT p1))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 438 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-18 20:54:29] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-18 20:54:30] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2023-03-18 20:54:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:54:31] [INFO ] [Real]Absence check using state equation in 1695 ms returned sat
[2023-03-18 20:54:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:54:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 76 ms returned sat
[2023-03-18 20:54:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:54:34] [INFO ] [Nat]Absence check using state equation in 2249 ms returned sat
[2023-03-18 20:54:34] [INFO ] Computed and/alt/rep : 1172/1713/1172 causal constraints (skipped 0 transitions) in 84 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:54:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 376 ms.
Product exploration explored 100000 steps with 0 reset in 510 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1173 transition count 1173
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 121 Pre rules applied. Total rules applied 327 place count 1173 transition count 1294
Deduced a syphon composed of 448 places in 1 ms
Iterating global reduction 1 with 121 rules applied. Total rules applied 448 place count 1173 transition count 1294
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 808 places in 1 ms
Iterating global reduction 1 with 360 rules applied. Total rules applied 808 place count 1173 transition count 1294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 809 place count 1173 transition count 1293
Renaming transitions due to excessive name length > 1024 char.
Discarding 238 places :
Symmetric choice reduction at 2 with 238 rule applications. Total rules 1047 place count 935 transition count 1055
Deduced a syphon composed of 570 places in 1 ms
Iterating global reduction 2 with 238 rules applied. Total rules applied 1285 place count 935 transition count 1055
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 571 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1286 place count 935 transition count 1055
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1288 place count 933 transition count 1053
Deduced a syphon composed of 569 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1290 place count 933 transition count 1053
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -722
Deduced a syphon composed of 670 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1391 place count 933 transition count 1775
Discarding 103 places :
Symmetric choice reduction at 2 with 103 rule applications. Total rules 1494 place count 830 transition count 1569
Deduced a syphon composed of 567 places in 1 ms
Iterating global reduction 2 with 103 rules applied. Total rules applied 1597 place count 830 transition count 1569
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 584 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1614 place count 830 transition count 1692
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1631 place count 813 transition count 1658
Deduced a syphon composed of 567 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1648 place count 813 transition count 1658
Deduced a syphon composed of 567 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 1651 place count 813 transition count 1655
Deduced a syphon composed of 567 places in 0 ms
Applied a total of 1651 rules in 805 ms. Remains 813 /1173 variables (removed 360) and now considering 1655/1173 (removed -482) transitions.
[2023-03-18 20:54:49] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1655 rows 813 cols
[2023-03-18 20:54:49] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-18 20:54:50] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 813/1173 places, 1655/1173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1756 ms. Remains : 813/1173 places, 1655/1173 transitions.
Built C files in :
/tmp/ltsmin4774713833626309850
[2023-03-18 20:54:50] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4774713833626309850
Running compilation step : cd /tmp/ltsmin4774713833626309850;'/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 1642 ms.
Running link step : cd /tmp/ltsmin4774713833626309850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4774713833626309850;'/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/stateBased18100632063344860424.hoa' '--buchi-type=spotba'
LTSmin run took 4190 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-030B-LTLCardinality-01 finished in 74167 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))&&p1) U !(X(G(p0))||p2)))'
Support contains 6 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1174 transition count 1174
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1173 transition count 1173
Applied a total of 18 rules in 84 ms. Remains 1173 /1182 variables (removed 9) and now considering 1173/1182 (removed 9) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-18 20:54:56] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-18 20:54:56] [INFO ] Implicit Places using invariants in 570 ms returned []
[2023-03-18 20:54:56] [INFO ] Invariant cache hit.
[2023-03-18 20:54:57] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2023-03-18 20:54:57] [INFO ] Invariant cache hit.
[2023-03-18 20:54:57] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1182 places, 1173/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1753 ms. Remains : 1173/1182 places, 1173/1182 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p0) (NOT p2)), false, false, (NOT p0), p0]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(OR (EQ s573 0) (EQ s677 1)), p2:(OR (EQ s1020 0) (EQ s922 1)), p0:(OR (EQ s95 0) (EQ s318 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 363 ms.
Product exploration explored 100000 steps with 1 reset in 370 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 395 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:54:59] [INFO ] Invariant cache hit.
[2023-03-18 20:54:59] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:54:59] [INFO ] [Nat]Absence check using 121 positive place invariants in 24 ms returned sat
[2023-03-18 20:55:00] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:55:00] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 0 ms to minimize.
[2023-03-18 20:55:00] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 1 ms to minimize.
[2023-03-18 20:55:00] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 1 ms to minimize.
[2023-03-18 20:55:00] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 0 ms to minimize.
[2023-03-18 20:55:01] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 0 ms to minimize.
[2023-03-18 20:55:01] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 1 ms to minimize.
[2023-03-18 20:55:01] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 0 ms to minimize.
[2023-03-18 20:55:01] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 1 ms to minimize.
[2023-03-18 20:55:01] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 0 ms to minimize.
[2023-03-18 20:55:02] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 1 ms to minimize.
[2023-03-18 20:55:02] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 0 ms to minimize.
[2023-03-18 20:55:02] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 0 ms to minimize.
[2023-03-18 20:55:02] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2023-03-18 20:55:02] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 1 ms to minimize.
[2023-03-18 20:55:03] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 0 ms to minimize.
[2023-03-18 20:55:03] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 1 ms to minimize.
[2023-03-18 20:55:03] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 1 ms to minimize.
[2023-03-18 20:55:03] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 0 ms to minimize.
[2023-03-18 20:55:03] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 1 ms to minimize.
[2023-03-18 20:55:03] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2023-03-18 20:55:04] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2023-03-18 20:55:04] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 1 ms to minimize.
[2023-03-18 20:55:04] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4238 ms
[2023-03-18 20:55:04] [INFO ] After 4726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-18 20:55:04] [INFO ] After 4953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1173 transition count 847
Reduce places removed 326 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 328 rules applied. Total rules applied 654 place count 847 transition count 845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 656 place count 845 transition count 845
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 656 place count 845 transition count 608
Deduced a syphon composed of 237 places in 4 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1130 place count 608 transition count 608
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1131 place count 607 transition count 607
Iterating global reduction 3 with 1 rules applied. Total rules applied 1132 place count 607 transition count 607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1132 place count 607 transition count 606
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 1134 place count 606 transition count 606
Performed 269 Post agglomeration using F-continuation condition.Transition count delta: 269
Deduced a syphon composed of 269 places in 1 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 3 with 538 rules applied. Total rules applied 1672 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1673 place count 337 transition count 336
Renaming transitions due to excessive name length > 1024 char.
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 1675 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1851 place count 248 transition count 421
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1852 place count 248 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1853 place count 247 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1854 place count 246 transition count 419
Applied a total of 1854 rules in 99 ms. Remains 246 /1173 variables (removed 927) and now considering 419/1173 (removed 754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 246/1173 places, 419/1173 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Finished probabilistic random walk after 24181 steps, run visited all 2 properties in 355 ms. (steps per millisecond=68 )
Probabilistic random walk after 24181 steps, saw 15475 distinct states, run finished after 356 ms. (steps per millisecond=67 ) properties seen :2
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 10 factoid took 399 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 129 ms :[true, false, (NOT p0), p0, false, false]
Support contains 6 out of 1173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Applied a total of 0 rules in 25 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
[2023-03-18 20:55:05] [INFO ] Invariant cache hit.
[2023-03-18 20:55:06] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-18 20:55:06] [INFO ] Invariant cache hit.
[2023-03-18 20:55:06] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2023-03-18 20:55:06] [INFO ] Invariant cache hit.
[2023-03-18 20:55:07] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1410 ms. Remains : 1173/1173 places, 1173/1173 transitions.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 238 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:55:07] [INFO ] Invariant cache hit.
[2023-03-18 20:55:07] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:55:08] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-18 20:55:08] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:55:08] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 1 ms to minimize.
[2023-03-18 20:55:08] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 0 ms to minimize.
[2023-03-18 20:55:09] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2023-03-18 20:55:09] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 1 ms to minimize.
[2023-03-18 20:55:09] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 1 ms to minimize.
[2023-03-18 20:55:09] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 0 ms to minimize.
[2023-03-18 20:55:10] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 0 ms to minimize.
[2023-03-18 20:55:10] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 1 ms to minimize.
[2023-03-18 20:55:10] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 1 ms to minimize.
[2023-03-18 20:55:10] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 1 ms to minimize.
[2023-03-18 20:55:10] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 0 ms to minimize.
[2023-03-18 20:55:11] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 0 ms to minimize.
[2023-03-18 20:55:11] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 0 ms to minimize.
[2023-03-18 20:55:11] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 0 ms to minimize.
[2023-03-18 20:55:11] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 0 ms to minimize.
[2023-03-18 20:55:11] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 0 ms to minimize.
[2023-03-18 20:55:11] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 0 ms to minimize.
[2023-03-18 20:55:12] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2023-03-18 20:55:12] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 1 ms to minimize.
[2023-03-18 20:55:12] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 1 ms to minimize.
[2023-03-18 20:55:12] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 1 ms to minimize.
[2023-03-18 20:55:12] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 0 ms to minimize.
[2023-03-18 20:55:12] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4197 ms
[2023-03-18 20:55:12] [INFO ] After 4670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-18 20:55:12] [INFO ] After 4973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1173 transition count 847
Reduce places removed 326 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 328 rules applied. Total rules applied 654 place count 847 transition count 845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 656 place count 845 transition count 845
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 656 place count 845 transition count 608
Deduced a syphon composed of 237 places in 0 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1130 place count 608 transition count 608
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1131 place count 607 transition count 607
Iterating global reduction 3 with 1 rules applied. Total rules applied 1132 place count 607 transition count 607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1132 place count 607 transition count 606
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 1134 place count 606 transition count 606
Performed 269 Post agglomeration using F-continuation condition.Transition count delta: 269
Deduced a syphon composed of 269 places in 0 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 3 with 538 rules applied. Total rules applied 1672 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1673 place count 337 transition count 336
Renaming transitions due to excessive name length > 1024 char.
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 1675 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1851 place count 248 transition count 421
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1852 place count 248 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1853 place count 247 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1854 place count 246 transition count 419
Applied a total of 1854 rules in 111 ms. Remains 246 /1173 variables (removed 927) and now considering 419/1173 (removed 754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 246/1173 places, 419/1173 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Finished probabilistic random walk after 24181 steps, run visited all 2 properties in 333 ms. (steps per millisecond=72 )
Probabilistic random walk after 24181 steps, saw 15475 distinct states, run finished after 341 ms. (steps per millisecond=70 ) properties seen :2
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 8 factoid took 264 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 133 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 126 ms :[true, false, (NOT p0), p0, false, false]
Product exploration explored 100000 steps with 1 reset in 283 ms.
Product exploration explored 100000 steps with 3 reset in 509 ms.
Applying partial POR strategy [true, false, true, true, false, true]
Stuttering acceptance computed with spot in 202 ms :[true, false, (NOT p0), p0, false, false]
Support contains 6 out of 1173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1173 transition count 1173
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 120 Pre rules applied. Total rules applied 327 place count 1173 transition count 1292
Deduced a syphon composed of 447 places in 1 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 447 place count 1173 transition count 1292
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 805 places in 2 ms
Iterating global reduction 1 with 358 rules applied. Total rules applied 805 place count 1173 transition count 1293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 806 place count 1173 transition count 1292
Renaming transitions due to excessive name length > 1024 char.
Discarding 238 places :
Symmetric choice reduction at 2 with 238 rule applications. Total rules 1044 place count 935 transition count 1054
Deduced a syphon composed of 567 places in 2 ms
Iterating global reduction 2 with 238 rules applied. Total rules applied 1282 place count 935 transition count 1054
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 568 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1283 place count 935 transition count 1054
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1285 place count 933 transition count 1052
Deduced a syphon composed of 566 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1287 place count 933 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -734
Deduced a syphon composed of 667 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1388 place count 933 transition count 1786
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1489 place count 832 transition count 1584
Deduced a syphon composed of 566 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1590 place count 832 transition count 1584
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -103
Deduced a syphon composed of 581 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 1605 place count 832 transition count 1687
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1620 place count 817 transition count 1657
Deduced a syphon composed of 566 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 1635 place count 817 transition count 1657
Deduced a syphon composed of 566 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 1638 place count 817 transition count 1654
Deduced a syphon composed of 566 places in 0 ms
Applied a total of 1638 rules in 630 ms. Remains 817 /1173 variables (removed 356) and now considering 1654/1173 (removed -481) transitions.
[2023-03-18 20:55:16] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 1654 rows 817 cols
[2023-03-18 20:55:16] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-18 20:55:16] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 817/1173 places, 1654/1173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1335 ms. Remains : 817/1173 places, 1654/1173 transitions.
Built C files in :
/tmp/ltsmin6601946630268689372
[2023-03-18 20:55:16] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6601946630268689372
Running compilation step : cd /tmp/ltsmin6601946630268689372;'/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 1559 ms.
Running link step : cd /tmp/ltsmin6601946630268689372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin6601946630268689372;'/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/stateBased14736534439445590252.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Applied a total of 0 rules in 54 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-18 20:55:31] [INFO ] Computed 121 place invariants in 10 ms
[2023-03-18 20:55:32] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-18 20:55:32] [INFO ] Invariant cache hit.
[2023-03-18 20:55:32] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
[2023-03-18 20:55:32] [INFO ] Invariant cache hit.
[2023-03-18 20:55:33] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1432 ms. Remains : 1173/1173 places, 1173/1173 transitions.
Built C files in :
/tmp/ltsmin18104540363665026165
[2023-03-18 20:55:33] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18104540363665026165
Running compilation step : cd /tmp/ltsmin18104540363665026165;'/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 1546 ms.
Running link step : cd /tmp/ltsmin18104540363665026165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin18104540363665026165;'/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/stateBased9007312606841373028.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 20:55:48] [INFO ] Flatten gal took : 67 ms
[2023-03-18 20:55:48] [INFO ] Flatten gal took : 70 ms
[2023-03-18 20:55:48] [INFO ] Time to serialize gal into /tmp/LTL11468534316418531422.gal : 19 ms
[2023-03-18 20:55:48] [INFO ] Time to serialize properties into /tmp/LTL17820613779994261063.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/LTL11468534316418531422.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15075631213963538701.hoa' '-atoms' '/tmp/LTL17820613779994261063.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17820613779994261063.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15075631213963538701.hoa
Detected timeout of ITS tools.
[2023-03-18 20:56:03] [INFO ] Flatten gal took : 87 ms
[2023-03-18 20:56:03] [INFO ] Flatten gal took : 71 ms
[2023-03-18 20:56:03] [INFO ] Time to serialize gal into /tmp/LTL6480363357879391262.gal : 32 ms
[2023-03-18 20:56:03] [INFO ] Time to serialize properties into /tmp/LTL3192060402963979664.ltl : 42 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/LTL6480363357879391262.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3192060402963979664.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(F("((p111==0)||(p398==1))")))&&("((p726==0)||(p860==1))"))U(!(((X(G("((p111==0)||(p398==1))")))||("(p1302==0)"))||("(p1176==1...163
Formula 0 simplified : ("((p726==0)||(p860==1))" & XF"((p111==0)||(p398==1))") U (!"(p1176==1)" & !"(p1302==0)" & XF!"((p111==0)||(p398==1))")
Detected timeout of ITS tools.
[2023-03-18 20:56:18] [INFO ] Flatten gal took : 41 ms
[2023-03-18 20:56:18] [INFO ] Applying decomposition
[2023-03-18 20:56:19] [INFO ] Flatten gal took : 37 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/graph12293855515535053515.txt' '-o' '/tmp/graph12293855515535053515.bin' '-w' '/tmp/graph12293855515535053515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12293855515535053515.bin' '-l' '-1' '-v' '-w' '/tmp/graph12293855515535053515.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:56:19] [INFO ] Decomposing Gal with order
[2023-03-18 20:56:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:56:19] [INFO ] Removed a total of 298 redundant transitions.
[2023-03-18 20:56:19] [INFO ] Flatten gal took : 159 ms
[2023-03-18 20:56:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2023-03-18 20:56:19] [INFO ] Time to serialize gal into /tmp/LTL6761383118489191883.gal : 28 ms
[2023-03-18 20:56:19] [INFO ] Time to serialize properties into /tmp/LTL7006263490064588582.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/LTL6761383118489191883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7006263490064588582.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((!(((X(F("((i4.i3.u42.p111==0)||(i9.i2.u128.p398==1))")))&&("((i16.i1.u229.p726==0)||(i18.i4.u270.p860==1))"))U(!(((X(G("((i4.i3.u42...253
Formula 0 simplified : ("((i16.i1.u229.p726==0)||(i18.i4.u270.p860==1))" & XF"((i4.i3.u42.p111==0)||(i9.i2.u128.p398==1))") U (!"(i24.i2.u367.p1176==1)" & ...232
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9662600828737674743
[2023-03-18 20:56:34] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9662600828737674743
Running compilation step : cd /tmp/ltsmin9662600828737674743;'/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 1519 ms.
Running link step : cd /tmp/ltsmin9662600828737674743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin9662600828737674743;'/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(<>((LTLAPp0==true)))&&(LTLAPp1==true)) U !(X([]((LTLAPp0==true)))||(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-03 finished in 113952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(X(G(p1)))))'
Support contains 3 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1174 transition count 1174
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1173 transition count 1173
Applied a total of 18 rules in 74 ms. Remains 1173 /1182 variables (removed 9) and now considering 1173/1182 (removed 9) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-18 20:56:50] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-18 20:56:50] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-18 20:56:50] [INFO ] Invariant cache hit.
[2023-03-18 20:56:51] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2023-03-18 20:56:51] [INFO ] Invariant cache hit.
[2023-03-18 20:56:51] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1182 places, 1173/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1626 ms. Remains : 1173/1182 places, 1173/1182 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=5, aps=[p1:(OR (EQ s457 0) (EQ s942 1)), p0:(EQ s586 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 93112 steps with 1 reset in 367 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-05 finished in 2141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1))||F((X(p3)&&p2))))'
Support contains 5 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1174 transition count 1174
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1174 transition count 1174
Applied a total of 16 rules in 50 ms. Remains 1174 /1182 variables (removed 8) and now considering 1174/1182 (removed 8) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2023-03-18 20:56:52] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-18 20:56:52] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-18 20:56:52] [INFO ] Invariant cache hit.
[2023-03-18 20:56:53] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2023-03-18 20:56:53] [INFO ] Invariant cache hit.
[2023-03-18 20:56:53] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1174/1182 places, 1174/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1365 ms. Remains : 1174/1182 places, 1174/1182 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s1104 0) (EQ s1143 1)), p2:(AND (EQ s1143 0) (EQ s1104 1)), p1:(EQ s1002 1), p3:(OR (EQ s645 0) (EQ s395 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 724 reset in 260 ms.
Product exploration explored 100000 steps with 743 reset in 287 ms.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Detected a total of 360/1174 stabilizing places and 360/1174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) p3), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 862 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 20:56:55] [INFO ] Invariant cache hit.
[2023-03-18 20:56:56] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:56:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-18 20:56:56] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-18 20:56:56] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 0 ms to minimize.
[2023-03-18 20:56:57] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 0 ms to minimize.
[2023-03-18 20:56:57] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 1 ms to minimize.
[2023-03-18 20:56:57] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 1 ms to minimize.
[2023-03-18 20:56:57] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 1 ms to minimize.
[2023-03-18 20:56:57] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 0 ms to minimize.
[2023-03-18 20:56:58] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 0 ms to minimize.
[2023-03-18 20:56:58] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 0 ms to minimize.
[2023-03-18 20:56:58] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 0 ms to minimize.
[2023-03-18 20:56:58] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 1 ms to minimize.
[2023-03-18 20:56:58] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 1 ms to minimize.
[2023-03-18 20:56:59] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 13 ms to minimize.
[2023-03-18 20:56:59] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 1 ms to minimize.
[2023-03-18 20:56:59] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 0 ms to minimize.
[2023-03-18 20:56:59] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 0 ms to minimize.
[2023-03-18 20:56:59] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 0 ms to minimize.
[2023-03-18 20:56:59] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 0 ms to minimize.
[2023-03-18 20:57:00] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2023-03-18 20:57:00] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 0 ms to minimize.
[2023-03-18 20:57:00] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2023-03-18 20:57:00] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2023-03-18 20:57:00] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 0 ms to minimize.
[2023-03-18 20:57:00] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 1 ms to minimize.
[2023-03-18 20:57:00] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 1 ms to minimize.
[2023-03-18 20:57:00] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4297 ms
[2023-03-18 20:57:01] [INFO ] After 4813ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-18 20:57:01] [INFO ] After 5132ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 5 out of 1174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1174 transition count 847
Reduce places removed 327 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 328 rules applied. Total rules applied 655 place count 847 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 656 place count 846 transition count 846
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 656 place count 846 transition count 608
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 1132 place count 608 transition count 608
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 0 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 536 rules applied. Total rules applied 1668 place count 340 transition count 340
Renaming transitions due to excessive name length > 1024 char.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 1848 place count 250 transition count 430
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1849 place count 250 transition count 429
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1850 place count 249 transition count 428
Applied a total of 1850 rules in 55 ms. Remains 249 /1174 variables (removed 925) and now considering 428/1174 (removed 746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 249/1174 places, 428/1174 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Finished Best-First random walk after 6458 steps, including 2 resets, run visited all 3 properties in 17 ms. (steps per millisecond=379 )
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) p3), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p3) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3) p2)), (F (AND p2 (NOT p0))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p1) (NOT p3) p2 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p3) p2 (NOT p0)))]
Knowledge based reduction with 26 factoid took 1684 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2023-03-18 20:57:03] [INFO ] Invariant cache hit.
[2023-03-18 20:57:04] [INFO ] [Real]Absence check using 121 positive place invariants in 72 ms returned sat
[2023-03-18 20:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:57:05] [INFO ] [Real]Absence check using state equation in 1513 ms returned sat
[2023-03-18 20:57:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:57:06] [INFO ] [Nat]Absence check using 121 positive place invariants in 77 ms returned sat
[2023-03-18 20:57:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:57:08] [INFO ] [Nat]Absence check using state equation in 2232 ms returned sat
[2023-03-18 20:57:08] [INFO ] Computed and/alt/rep : 1173/1715/1173 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-18 20:57:21] [INFO ] Deduced a trap composed of 13 places in 502 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:57:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 1174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Applied a total of 0 rules in 32 ms. Remains 1174 /1174 variables (removed 0) and now considering 1174/1174 (removed 0) transitions.
[2023-03-18 20:57:21] [INFO ] Invariant cache hit.
[2023-03-18 20:57:21] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-18 20:57:21] [INFO ] Invariant cache hit.
[2023-03-18 20:57:22] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
[2023-03-18 20:57:22] [INFO ] Invariant cache hit.
[2023-03-18 20:57:22] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1474 ms. Remains : 1174/1174 places, 1174/1174 transitions.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Detected a total of 360/1174 stabilizing places and 360/1174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 p3), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 364 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 20:57:23] [INFO ] Invariant cache hit.
[2023-03-18 20:57:23] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:57:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-18 20:57:24] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 20:57:24] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 1 ms to minimize.
[2023-03-18 20:57:24] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 1 ms to minimize.
[2023-03-18 20:57:25] [INFO ] Deduced a trap composed of 35 places in 304 ms of which 1 ms to minimize.
[2023-03-18 20:57:25] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 0 ms to minimize.
[2023-03-18 20:57:25] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 0 ms to minimize.
[2023-03-18 20:57:25] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2023-03-18 20:57:26] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2023-03-18 20:57:26] [INFO ] Deduced a trap composed of 42 places in 285 ms of which 1 ms to minimize.
[2023-03-18 20:57:26] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 1 ms to minimize.
[2023-03-18 20:57:26] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 1 ms to minimize.
[2023-03-18 20:57:26] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 1 ms to minimize.
[2023-03-18 20:57:27] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 0 ms to minimize.
[2023-03-18 20:57:27] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 0 ms to minimize.
[2023-03-18 20:57:27] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2023-03-18 20:57:27] [INFO ] Deduced a trap composed of 37 places in 202 ms of which 1 ms to minimize.
[2023-03-18 20:57:27] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 1 ms to minimize.
[2023-03-18 20:57:28] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 0 ms to minimize.
[2023-03-18 20:57:28] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 1 ms to minimize.
[2023-03-18 20:57:28] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 1 ms to minimize.
[2023-03-18 20:57:28] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 1 ms to minimize.
[2023-03-18 20:57:28] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 0 ms to minimize.
[2023-03-18 20:57:28] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 0 ms to minimize.
[2023-03-18 20:57:28] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 1 ms to minimize.
[2023-03-18 20:57:28] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4571 ms
[2023-03-18 20:57:29] [INFO ] After 5084ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-18 20:57:29] [INFO ] After 5441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 81 ms.
Support contains 5 out of 1174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1174 transition count 847
Reduce places removed 327 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 328 rules applied. Total rules applied 655 place count 847 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 656 place count 846 transition count 846
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 656 place count 846 transition count 608
Deduced a syphon composed of 238 places in 0 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 1132 place count 608 transition count 608
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 0 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 536 rules applied. Total rules applied 1668 place count 340 transition count 340
Renaming transitions due to excessive name length > 1024 char.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 1848 place count 250 transition count 430
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1849 place count 250 transition count 429
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1850 place count 249 transition count 428
Applied a total of 1850 rules in 43 ms. Remains 249 /1174 variables (removed 925) and now considering 428/1174 (removed 746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 249/1174 places, 428/1174 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Finished Best-First random walk after 764 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=254 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 p3), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p1) (NOT p3) (NOT p0))), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p1) (NOT p3) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 11 factoid took 393 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2023-03-18 20:57:30] [INFO ] Invariant cache hit.
[2023-03-18 20:57:30] [INFO ] [Real]Absence check using 121 positive place invariants in 49 ms returned sat
[2023-03-18 20:57:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:57:32] [INFO ] [Real]Absence check using state equation in 1436 ms returned sat
[2023-03-18 20:57:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:57:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 57 ms returned sat
[2023-03-18 20:57:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:57:34] [INFO ] [Nat]Absence check using state equation in 1898 ms returned sat
[2023-03-18 20:57:34] [INFO ] Computed and/alt/rep : 1173/1715/1173 causal constraints (skipped 0 transitions) in 80 ms.
[2023-03-18 20:57:47] [INFO ] Deduced a trap composed of 13 places in 472 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:57:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 734 reset in 319 ms.
Product exploration explored 100000 steps with 752 reset in 316 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 5 out of 1174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1174 transition count 1174
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 119 Pre rules applied. Total rules applied 328 place count 1174 transition count 1294
Deduced a syphon composed of 447 places in 2 ms
Iterating global reduction 1 with 119 rules applied. Total rules applied 447 place count 1174 transition count 1294
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 805 places in 1 ms
Iterating global reduction 1 with 358 rules applied. Total rules applied 805 place count 1174 transition count 1295
Renaming transitions due to excessive name length > 1024 char.
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1044 place count 935 transition count 1055
Deduced a syphon composed of 566 places in 1 ms
Iterating global reduction 1 with 239 rules applied. Total rules applied 1283 place count 935 transition count 1055
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 667 places in 1 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 1384 place count 935 transition count 1787
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 1485 place count 834 transition count 1585
Deduced a syphon composed of 566 places in 0 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 1586 place count 834 transition count 1585
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -136
Deduced a syphon composed of 584 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 1604 place count 834 transition count 1721
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 1622 place count 816 transition count 1685
Deduced a syphon composed of 566 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 1640 place count 816 transition count 1685
Deduced a syphon composed of 566 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 1643 place count 816 transition count 1682
Deduced a syphon composed of 566 places in 0 ms
Applied a total of 1643 rules in 388 ms. Remains 816 /1174 variables (removed 358) and now considering 1682/1174 (removed -508) transitions.
[2023-03-18 20:57:49] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1682 rows 816 cols
[2023-03-18 20:57:49] [INFO ] Computed 121 place invariants in 9 ms
[2023-03-18 20:57:50] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 816/1174 places, 1682/1174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1212 ms. Remains : 816/1174 places, 1682/1174 transitions.
Built C files in :
/tmp/ltsmin6483649399113395330
[2023-03-18 20:57:50] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6483649399113395330
Running compilation step : cd /tmp/ltsmin6483649399113395330;'/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 1675 ms.
Running link step : cd /tmp/ltsmin6483649399113395330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6483649399113395330;'/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/stateBased3321909555214858685.hoa' '--buchi-type=spotba'
LTSmin run took 2889 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-030B-LTLCardinality-09 finished in 62632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 3 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1181 transition count 853
Reduce places removed 328 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 330 rules applied. Total rules applied 658 place count 853 transition count 851
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 660 place count 852 transition count 850
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 661 place count 851 transition count 850
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 234 Pre rules applied. Total rules applied 661 place count 851 transition count 616
Deduced a syphon composed of 234 places in 0 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 4 with 468 rules applied. Total rules applied 1129 place count 617 transition count 616
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1137 place count 609 transition count 608
Iterating global reduction 4 with 8 rules applied. Total rules applied 1145 place count 609 transition count 608
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 1145 place count 609 transition count 601
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1159 place count 602 transition count 601
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 266
Deduced a syphon composed of 266 places in 0 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 4 with 532 rules applied. Total rules applied 1691 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1867 place count 248 transition count 420
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1869 place count 246 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1870 place count 245 transition count 418
Applied a total of 1870 rules in 80 ms. Remains 245 /1182 variables (removed 937) and now considering 418/1182 (removed 764) transitions.
// Phase 1: matrix 418 rows 245 cols
[2023-03-18 20:57:54] [INFO ] Computed 120 place invariants in 0 ms
[2023-03-18 20:57:55] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-18 20:57:55] [INFO ] Invariant cache hit.
[2023-03-18 20:57:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 20:57:55] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2023-03-18 20:57:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 20:57:55] [INFO ] Invariant cache hit.
[2023-03-18 20:57:55] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/1182 places, 418/1182 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 990 ms. Remains : 245/1182 places, 418/1182 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s124 1), p1:(OR (EQ s75 0) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 18 steps with 6 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-10 finished in 1058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1172 transition count 1172
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1171 transition count 1171
Applied a total of 22 rules in 75 ms. Remains 1171 /1182 variables (removed 11) and now considering 1171/1182 (removed 11) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2023-03-18 20:57:55] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-18 20:57:56] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-18 20:57:56] [INFO ] Invariant cache hit.
[2023-03-18 20:57:56] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2023-03-18 20:57:56] [INFO ] Invariant cache hit.
[2023-03-18 20:57:57] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1171/1182 places, 1171/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1400 ms. Remains : 1171/1182 places, 1171/1182 transitions.
Stuttering acceptance computed with spot in 400 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-13 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 (EQ s622 0) (EQ s1160 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 839 ms.
Product exploration explored 100000 steps with 50000 reset in 773 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 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 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-030B-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030B-LTLCardinality-13 finished in 3552 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 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1173 transition count 1173
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1172 transition count 1172
Applied a total of 20 rules in 109 ms. Remains 1172 /1182 variables (removed 10) and now considering 1172/1182 (removed 10) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2023-03-18 20:57:59] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-18 20:57:59] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-18 20:57:59] [INFO ] Invariant cache hit.
[2023-03-18 20:58:00] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2023-03-18 20:58:00] [INFO ] Invariant cache hit.
[2023-03-18 20:58:01] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1182 places, 1172/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1762 ms. Remains : 1172/1182 places, 1172/1182 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-15 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:(EQ s413 0)], 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]]
Entered a terminal (fully accepting) state of product in 354 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-15 finished in 1852 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))&&p1) U !(X(G(p0))||p2)))'
Found a Lengthening insensitive property : ShieldRVt-PT-030B-LTLCardinality-03
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) (NOT p2)), false, false, (NOT p0), p0]
Support contains 6 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1181 transition count 854
Reduce places removed 327 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 329 rules applied. Total rules applied 656 place count 854 transition count 852
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 659 place count 853 transition count 850
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 661 place count 851 transition count 850
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 233 Pre rules applied. Total rules applied 661 place count 851 transition count 617
Deduced a syphon composed of 233 places in 8 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 4 with 466 rules applied. Total rules applied 1127 place count 618 transition count 617
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1134 place count 611 transition count 610
Iterating global reduction 4 with 7 rules applied. Total rules applied 1141 place count 611 transition count 610
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 1141 place count 611 transition count 604
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1153 place count 605 transition count 604
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 266
Deduced a syphon composed of 266 places in 0 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 4 with 532 rules applied. Total rules applied 1685 place count 339 transition count 338
Renaming transitions due to excessive name length > 1024 char.
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 1859 place count 252 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1861 place count 250 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1862 place count 249 transition count 420
Applied a total of 1862 rules in 73 ms. Remains 249 /1182 variables (removed 933) and now considering 420/1182 (removed 762) transitions.
// Phase 1: matrix 420 rows 249 cols
[2023-03-18 20:58:01] [INFO ] Computed 120 place invariants in 0 ms
[2023-03-18 20:58:01] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-18 20:58:01] [INFO ] Invariant cache hit.
[2023-03-18 20:58:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 20:58:01] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2023-03-18 20:58:01] [INFO ] Invariant cache hit.
[2023-03-18 20:58:02] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 249/1182 places, 420/1182 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 688 ms. Remains : 249/1182 places, 420/1182 transitions.
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(OR (EQ s116 0) (EQ s142 1)), p2:(OR (EQ s218 0) (EQ s194 1)), p0:(OR (EQ s14 0) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 357 ms.
Product exploration explored 100000 steps with 28 reset in 416 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 409 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:58:03] [INFO ] Invariant cache hit.
[2023-03-18 20:58:03] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:58:03] [INFO ] [Nat]Absence check using 120 positive place invariants in 10 ms returned sat
[2023-03-18 20:58:03] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:58:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 20:58:03] [INFO ] After 17ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 20:58:03] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-18 20:58:03] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 552 steps, including 9 resets, run visited all 2 properties in 5 ms. (steps per millisecond=110 )
Parikh walk visited 2 properties in 12 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 10 factoid took 277 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 114 ms :[true, false, (NOT p0), p0, false, false]
Support contains 6 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 420/420 transitions.
Applied a total of 0 rules in 1 ms. Remains 249 /249 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-18 20:58:04] [INFO ] Invariant cache hit.
[2023-03-18 20:58:04] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-18 20:58:04] [INFO ] Invariant cache hit.
[2023-03-18 20:58:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 20:58:04] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-18 20:58:04] [INFO ] Invariant cache hit.
[2023-03-18 20:58:04] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 249/249 places, 420/420 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 195 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:58:05] [INFO ] Invariant cache hit.
[2023-03-18 20:58:05] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:58:05] [INFO ] [Nat]Absence check using 120 positive place invariants in 14 ms returned sat
[2023-03-18 20:58:05] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:58:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 20:58:05] [INFO ] After 18ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 20:58:05] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 20:58:05] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 420/420 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 249 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 248 transition count 418
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 2 with 2 rules applied. Total rules applied 5 place count 247 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 246 transition count 419
Applied a total of 7 rules in 10 ms. Remains 246 /249 variables (removed 3) and now considering 419/420 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 246/249 places, 419/420 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 8585 steps, run visited all 2 properties in 125 ms. (steps per millisecond=68 )
Probabilistic random walk after 8585 steps, saw 5416 distinct states, run finished after 125 ms. (steps per millisecond=68 ) properties seen :2
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 8 factoid took 291 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 128 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 113 ms :[true, false, (NOT p0), p0, false, false]
Product exploration explored 100000 steps with 29 reset in 317 ms.
Product exploration explored 100000 steps with 25 reset in 378 ms.
Applying partial POR strategy [true, false, true, true, false, true]
Stuttering acceptance computed with spot in 177 ms :[true, false, (NOT p0), p0, false, false]
Support contains 6 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 420/420 transitions.
Applied a total of 0 rules in 6 ms. Remains 249 /249 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-18 20:58:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 20:58:07] [INFO ] Invariant cache hit.
[2023-03-18 20:58:07] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 249/249 places, 420/420 transitions.
Built C files in :
/tmp/ltsmin15336159610846354466
[2023-03-18 20:58:07] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15336159610846354466
Running compilation step : cd /tmp/ltsmin15336159610846354466;'/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 716 ms.
Running link step : cd /tmp/ltsmin15336159610846354466;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 20 ms.
Running LTSmin : cd /tmp/ltsmin15336159610846354466;'/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/stateBased7667468171613204411.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 420/420 transitions.
Applied a total of 0 rules in 1 ms. Remains 249 /249 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-18 20:58:23] [INFO ] Invariant cache hit.
[2023-03-18 20:58:23] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-18 20:58:23] [INFO ] Invariant cache hit.
[2023-03-18 20:58:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 20:58:23] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-03-18 20:58:23] [INFO ] Invariant cache hit.
[2023-03-18 20:58:23] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 249/249 places, 420/420 transitions.
Built C files in :
/tmp/ltsmin16925744278353828196
[2023-03-18 20:58:23] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16925744278353828196
Running compilation step : cd /tmp/ltsmin16925744278353828196;'/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 553 ms.
Running link step : cd /tmp/ltsmin16925744278353828196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16925744278353828196;'/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/stateBased14686255035737349614.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 20:58:38] [INFO ] Flatten gal took : 14 ms
[2023-03-18 20:58:38] [INFO ] Flatten gal took : 25 ms
[2023-03-18 20:58:38] [INFO ] Time to serialize gal into /tmp/LTL10227227836725942162.gal : 3 ms
[2023-03-18 20:58:38] [INFO ] Time to serialize properties into /tmp/LTL14723840968422284182.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/LTL10227227836725942162.gal' '-t' 'CGAL' '-hoa' '/tmp/aut872437097809335587.hoa' '-atoms' '/tmp/LTL14723840968422284182.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/LTL14723840968422284182.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut872437097809335587.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.36211e+22 deadlock states
Detected timeout of ITS tools.
[2023-03-18 20:58:53] [INFO ] Flatten gal took : 12 ms
[2023-03-18 20:58:53] [INFO ] Flatten gal took : 12 ms
[2023-03-18 20:58:53] [INFO ] Time to serialize gal into /tmp/LTL6180373801066477356.gal : 7 ms
[2023-03-18 20:58:53] [INFO ] Time to serialize properties into /tmp/LTL10783089744817144708.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/LTL6180373801066477356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10783089744817144708.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(F("((p111==0)||(p398==1))")))&&("((p726==0)||(p860==1))"))U(!(((X(G("((p111==0)||(p398==1))")))||("(p1302==0)"))||("(p1176==1...163
Formula 0 simplified : ("((p726==0)||(p860==1))" & XF"((p111==0)||(p398==1))") U (!"(p1176==1)" & !"(p1302==0)" & XF!"((p111==0)||(p398==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.36211e+22 deadlock states
Detected timeout of ITS tools.
[2023-03-18 20:59:08] [INFO ] Flatten gal took : 21 ms
[2023-03-18 20:59:08] [INFO ] Applying decomposition
[2023-03-18 20:59:08] [INFO ] Flatten gal took : 13 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/graph5764318320096383727.txt' '-o' '/tmp/graph5764318320096383727.bin' '-w' '/tmp/graph5764318320096383727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5764318320096383727.bin' '-l' '-1' '-v' '-w' '/tmp/graph5764318320096383727.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:59:08] [INFO ] Decomposing Gal with order
[2023-03-18 20:59:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:59:09] [INFO ] Removed a total of 801 redundant transitions.
[2023-03-18 20:59:09] [INFO ] Flatten gal took : 33 ms
[2023-03-18 20:59:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 458 labels/synchronizations in 9 ms.
[2023-03-18 20:59:09] [INFO ] Time to serialize gal into /tmp/LTL10154699756694676131.gal : 4 ms
[2023-03-18 20:59:09] [INFO ] Time to serialize properties into /tmp/LTL6823447026065506552.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/LTL10154699756694676131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6823447026065506552.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((!(((X(F("((i0.i0.u7.p111==0)||(i2.i1.u30.p398==1))")))&&("((i5.i0.u57.p726==0)||(i6.i0.u69.p860==1))"))U(!(((X(G("((i0.i0.u7.p111==...242
Formula 0 simplified : ("((i5.i0.u57.p726==0)||(i6.i0.u69.p860==1))" & XF"((i0.i0.u7.p111==0)||(i2.i1.u30.p398==1))") U (!"(i8.i0.u95.p1176==1)" & !"(i9.i0...221
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.36211e+22 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11091930409435976060
[2023-03-18 20:59:24] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11091930409435976060
Running compilation step : cd /tmp/ltsmin11091930409435976060;'/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 816 ms.
Running link step : cd /tmp/ltsmin11091930409435976060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11091930409435976060;'/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(<>((LTLAPp0==true)))&&(LTLAPp1==true)) U !(X([]((LTLAPp0==true)))||(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-03 finished in 98035 ms.
[2023-03-18 20:59:39] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1117661483863378792
[2023-03-18 20:59:39] [INFO ] Computing symmetric may disable matrix : 1182 transitions.
[2023-03-18 20:59:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:59:39] [INFO ] Computing symmetric may enable matrix : 1182 transitions.
[2023-03-18 20:59:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:59:39] [INFO ] Applying decomposition
[2023-03-18 20:59:39] [INFO ] Flatten gal took : 56 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/graph12518567983906986697.txt' '-o' '/tmp/graph12518567983906986697.bin' '-w' '/tmp/graph12518567983906986697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12518567983906986697.bin' '-l' '-1' '-v' '-w' '/tmp/graph12518567983906986697.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:59:39] [INFO ] Decomposing Gal with order
[2023-03-18 20:59:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:59:39] [INFO ] Computing Do-Not-Accords matrix : 1182 transitions.
[2023-03-18 20:59:39] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:59:39] [INFO ] Built C files in 409ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1117661483863378792
Running compilation step : cd /tmp/ltsmin1117661483863378792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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-18 20:59:39] [INFO ] Removed a total of 296 redundant transitions.
[2023-03-18 20:59:39] [INFO ] Flatten gal took : 96 ms
[2023-03-18 20:59:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-18 20:59:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality14332140755366057174.gal : 22 ms
[2023-03-18 20:59:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality6479241747325069456.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/LTLCardinality14332140755366057174.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6479241747325069456.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...277
Read 1 LTL properties
Checking formula 0 : !((!(((X(F("((i3.i3.u39.p111==0)||(i9.i2.u125.p398==1))")))&&("((i16.i1.u230.p726==0)||(i18.i4.u270.p860==1))"))U(!(((X(G("((i3.i3.u39...253
Formula 0 simplified : ("((i16.i1.u230.p726==0)||(i18.i4.u270.p860==1))" & XF"((i3.i3.u39.p111==0)||(i9.i2.u125.p398==1))") U (!"(i24.i2.u366.p1176==1)" & ...232
Compilation finished in 3207 ms.
Running link step : cd /tmp/ltsmin1117661483863378792;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1117661483863378792;'/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(<>((LTLAPp0==true)))&&(LTLAPp1==true)) U !(X([]((LTLAPp0==true)))||(LTLAPp2==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.041: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.041: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.042: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.042: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.046: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.046: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.389: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.389: LTL layer: formula: !((X(<>((LTLAPp0==true)))&&(LTLAPp1==true)) U !(X([]((LTLAPp0==true)))||(LTLAPp2==true)))
pins2lts-mc-linux64( 0/ 8), 0.389: "!((X(<>((LTLAPp0==true)))&&(LTLAPp1==true)) U !(X([]((LTLAPp0==true)))||(LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.390: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.527: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.578: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.578: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.581: buchi has 6 states
pins2lts-mc-linux64( 6/ 8), 0.593: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.657: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.658: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.658: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.673: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.609: DFS-FIFO for weak LTL, using special progress label 1186
pins2lts-mc-linux64( 0/ 8), 1.609: There are 1187 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.609: State length is 1183, there are 1194 groups
pins2lts-mc-linux64( 0/ 8), 1.609: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.609: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.609: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.609: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 5.433: ~1 levels ~960 states ~4704 transitions
pins2lts-mc-linux64( 2/ 8), 5.689: ~1 levels ~1920 states ~11152 transitions
pins2lts-mc-linux64( 2/ 8), 6.114: ~1 levels ~3840 states ~22360 transitions
pins2lts-mc-linux64( 0/ 8), 7.135: ~1 levels ~7680 states ~64752 transitions
pins2lts-mc-linux64( 0/ 8), 8.817: ~1 levels ~15360 states ~136656 transitions
pins2lts-mc-linux64( 2/ 8), 11.790: ~1 levels ~30720 states ~233448 transitions
pins2lts-mc-linux64( 0/ 8), 19.258: ~1 levels ~61440 states ~602000 transitions
pins2lts-mc-linux64( 2/ 8), 31.514: ~1 levels ~122880 states ~1045992 transitions
pins2lts-mc-linux64( 5/ 8), 60.075: ~1 levels ~245760 states ~2493904 transitions
pins2lts-mc-linux64( 0/ 8), 106.953: ~1 levels ~491520 states ~5322712 transitions
pins2lts-mc-linux64( 5/ 8), 164.446: ~1 levels ~983040 states ~10974688 transitions
pins2lts-mc-linux64( 5/ 8), 273.205: ~1 levels ~1966080 states ~23258040 transitions
pins2lts-mc-linux64( 7/ 8), 497.105: ~1 levels ~3932160 states ~46015536 transitions
pins2lts-mc-linux64( 5/ 8), 904.147: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 904.336:
pins2lts-mc-linux64( 0/ 8), 904.336: mean standard work distribution: 2.1% (states) 3.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 904.336:
pins2lts-mc-linux64( 0/ 8), 904.336: Explored 7171764 states 90125071 transitions, fanout: 12.567
pins2lts-mc-linux64( 0/ 8), 904.337: Total exploration time 902.690 sec (902.460 sec minimum, 902.594 sec on average)
pins2lts-mc-linux64( 0/ 8), 904.337: States per second: 7945, Transitions per second: 99841
pins2lts-mc-linux64( 0/ 8), 904.337:
pins2lts-mc-linux64( 0/ 8), 904.337: Progress states detected: 18025139
pins2lts-mc-linux64( 0/ 8), 904.337: Redundant explorations: -60.2126
pins2lts-mc-linux64( 0/ 8), 904.337:
pins2lts-mc-linux64( 0/ 8), 904.337: Queue width: 8B, total height: 17164241, memory: 130.95MB
pins2lts-mc-linux64( 0/ 8), 904.337: Tree memory: 393.5MB, 22.9 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 904.337: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 904.337: Stored 1209 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 904.337: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 904.337: Est. total memory use: 524.5MB (~1155.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1117661483863378792;'/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(<>((LTLAPp0==true)))&&(LTLAPp1==true)) U !(X([]((LTLAPp0==true)))||(LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1117661483863378792;'/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(<>((LTLAPp0==true)))&&(LTLAPp1==true)) U !(X([]((LTLAPp0==true)))||(LTLAPp2==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)
Reverse transition relation is NOT exact ! Due to transitions t1063, t1065, t1067, t1069, t1071, t1075, t1079, t1081, t1083, t1087, t1089, t1092, t1094, t1...4023
Computing Next relation with stutter on 7.36211e+22 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:21:45] [INFO ] Applying decomposition
[2023-03-18 21:21:45] [INFO ] Flatten gal took : 21 ms
[2023-03-18 21:21:45] [INFO ] Decomposing Gal with order
[2023-03-18 21:21:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:21:45] [INFO ] Removed a total of 87 redundant transitions.
[2023-03-18 21:21:45] [INFO ] Flatten gal took : 53 ms
[2023-03-18 21:21:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-18 21:21:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality3414104080905169380.gal : 8 ms
[2023-03-18 21:21:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality14501976733177114734.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/LTLCardinality3414104080905169380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14501976733177114734.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...277
Read 1 LTL properties
Checking formula 0 : !((!(((X(F("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u43.p111==0)||(i0.i0.i0.i0.i0....667
Formula 0 simplified : ("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u132.p726==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u149.p860==1))" ...646
Reverse transition relation is NOT exact ! Due to transitions i0.t1063, i0.i0.t1118, i0.i0.i0.t1065, i0.i0.i0.i0.t1116, i0.i0.i0.i0.i0.t1067, i0.i0.i0.i0.i...16860
Computing Next relation with stutter on 7.36211e+22 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:43:50] [INFO ] Flatten gal took : 29 ms
[2023-03-18 21:43:50] [INFO ] Input system was already deterministic with 1182 transitions.
[2023-03-18 21:43:50] [INFO ] Transformed 1182 places.
[2023-03-18 21:43:50] [INFO ] Transformed 1182 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 21:43:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality15467439549828205629.gal : 18 ms
[2023-03-18 21:43:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality11288581536850717503.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/LTLCardinality15467439549828205629.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11288581536850717503.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((!(((X(F("((p111==0)||(p398==1))")))&&("((p726==0)||(p860==1))"))U(!(((X(G("((p111==0)||(p398==1))")))||("(p1302==0)"))||("(p1176==1...163
Formula 0 simplified : ("((p726==0)||(p860==1))" & XF"((p111==0)||(p398==1))") U (!"(p1176==1)" & !"(p1302==0)" & XF!"((p111==0)||(p398==1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 580300 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16032204 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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 r421-tajo-167905975000299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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