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.r037-tajo-167813690700715.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 CANInsertWithFailure-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690700715
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 9.6K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 01:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 01:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 00:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.6M Mar 5 18:22 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 CANInsertWithFailure-PT-020-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678374522859

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=CANInsertWithFailure-PT-020
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 15:08:44] [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-09 15:08:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 15:08:44] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2023-03-09 15:08:44] [INFO ] Transformed 1044 places.
[2023-03-09 15:08:44] [INFO ] Transformed 2520 transitions.
[2023-03-09 15:08:44] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1043 transition count 2520
Applied a total of 1 rules in 82 ms. Remains 1043 /1044 variables (removed 1) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-09 15:08:44] [INFO ] Computed 22 place invariants in 73 ms
[2023-03-09 15:08:45] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-09 15:08:45] [INFO ] Invariant cache hit.
[2023-03-09 15:08:45] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:08:48] [INFO ] Implicit Places using invariants and state equation in 3122 ms returned []
Implicit Place search using SMT with State Equation took 3630 ms to find 0 implicit places.
[2023-03-09 15:08:48] [INFO ] Invariant cache hit.
[2023-03-09 15:08:49] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1043/1044 places, 2520/2520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4718 ms. Remains : 1043/1044 places, 2520/2520 transitions.
Support contains 49 out of 1043 places after structural reductions.
[2023-03-09 15:08:49] [INFO ] Flatten gal took : 127 ms
[2023-03-09 15:08:49] [INFO ] Flatten gal took : 76 ms
[2023-03-09 15:08:49] [INFO ] Input system was already deterministic with 2520 transitions.
Support contains 48 out of 1043 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 828 ms. (steps per millisecond=12 ) properties (out of 32) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-09 15:08:50] [INFO ] Invariant cache hit.
[2023-03-09 15:08:51] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-09 15:08:51] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-09 15:08:51] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:15
[2023-03-09 15:08:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-09 15:08:51] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-09 15:08:53] [INFO ] After 1629ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :11
[2023-03-09 15:08:53] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:08:56] [INFO ] After 2866ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :5 sat :11
[2023-03-09 15:08:58] [INFO ] After 4927ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :11
Attempting to minimize the solution found.
Minimization took 1419 ms.
[2023-03-09 15:08:59] [INFO ] After 8456ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :11
Fused 16 Parikh solutions to 10 different solutions.
Parikh walk visited 3 properties in 231 ms.
Support contains 9 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1043 transition count 2384
Reduce places removed 136 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 137 rules applied. Total rules applied 273 place count 907 transition count 2383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 906 transition count 2383
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 1 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 988 place count 549 transition count 2026
Drop transitions removed 322 transitions
Redundant transition composition rules discarded 322 transitions
Iterating global reduction 3 with 322 rules applied. Total rules applied 1310 place count 549 transition count 1704
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1312 place count 549 transition count 1702
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1314 place count 547 transition count 1702
Partial Free-agglomeration rule applied 473 times.
Drop transitions removed 473 transitions
Iterating global reduction 4 with 473 rules applied. Total rules applied 1787 place count 547 transition count 1702
Applied a total of 1787 rules in 383 ms. Remains 547 /1043 variables (removed 496) and now considering 1702/2520 (removed 818) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 547/1043 places, 1702/2520 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 378343 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 378343 steps, saw 53516 distinct states, run finished after 3002 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1702 rows 547 cols
[2023-03-09 15:09:03] [INFO ] Computed 22 place invariants in 58 ms
[2023-03-09 15:09:04] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:09:04] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-09 15:09:04] [INFO ] After 846ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 15:09:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:09:04] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:09:05] [INFO ] After 555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 15:09:05] [INFO ] State equation strengthened by 1586 read => feed constraints.
[2023-03-09 15:09:06] [INFO ] After 733ms SMT Verify possible using 1586 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-09 15:09:06] [INFO ] After 1368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 622 ms.
[2023-03-09 15:09:07] [INFO ] After 2772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 125 ms.
Support contains 9 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1702/1702 transitions.
Applied a total of 0 rules in 43 ms. Remains 547 /547 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 547/547 places, 1702/1702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1702/1702 transitions.
Applied a total of 0 rules in 41 ms. Remains 547 /547 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
[2023-03-09 15:09:07] [INFO ] Invariant cache hit.
[2023-03-09 15:09:08] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-09 15:09:08] [INFO ] Invariant cache hit.
[2023-03-09 15:09:08] [INFO ] State equation strengthened by 1586 read => feed constraints.
[2023-03-09 15:09:12] [INFO ] Implicit Places using invariants and state equation in 4235 ms returned []
Implicit Place search using SMT with State Equation took 4658 ms to find 0 implicit places.
[2023-03-09 15:09:12] [INFO ] Redundant transitions in 167 ms returned []
[2023-03-09 15:09:12] [INFO ] Invariant cache hit.
[2023-03-09 15:09:13] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5516 ms. Remains : 547/547 places, 1702/1702 transitions.
Graph (trivial) has 1519 edges and 547 vertex of which 433 / 547 are part of one of the 2 SCC in 5 ms
Free SCC test removed 431 places
Drop transitions removed 1109 transitions
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 1510 transitions.
Graph (complete) has 316 edges and 116 vertex of which 58 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Drop transitions removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 58 transition count 116
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 93 place count 25 transition count 66
Iterating global reduction 1 with 33 rules applied. Total rules applied 126 place count 25 transition count 66
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 143 place count 25 transition count 49
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 145 place count 24 transition count 48
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 147 place count 23 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 23 transition count 46
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 23 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 23 transition count 42
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 154 place count 22 transition count 41
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 22 transition count 40
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 157 place count 21 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 19 transition count 37
Applied a total of 159 rules in 26 ms. Remains 19 /547 variables (removed 528) and now considering 37/1702 (removed 1665) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 37 rows 19 cols
[2023-03-09 15:09:13] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 15:09:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-09 15:09:13] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 15:09:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-09 15:09:13] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 15:09:13] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 15:09:13] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 82 stabilizing places and 140 stable transitions
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 20 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-09 15:09:13] [INFO ] Computed 22 place invariants in 50 ms
[2023-03-09 15:09:13] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-09 15:09:13] [INFO ] Invariant cache hit.
[2023-03-09 15:09:14] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:09:16] [INFO ] Implicit Places using invariants and state equation in 2963 ms returned []
Implicit Place search using SMT with State Equation took 3268 ms to find 0 implicit places.
[2023-03-09 15:09:16] [INFO ] Invariant cache hit.
[2023-03-09 15:09:17] [INFO ] Dead Transitions using invariants and state equation in 1095 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4386 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, p0, p0]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 3 s252) (LEQ 3 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 214 reset in 495 ms.
Product exploration explored 100000 steps with 217 reset in 455 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 383 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 268091 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268091 steps, saw 64150 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:09:22] [INFO ] Invariant cache hit.
[2023-03-09 15:09:22] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-09 15:09:22] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-09 15:09:23] [INFO ] After 840ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:09:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-09 15:09:23] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-09 15:09:24] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:09:24] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:09:24] [INFO ] After 493ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:09:25] [INFO ] After 632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-09 15:09:25] [INFO ] After 1531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 2 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1324 place count 544 transition count 1695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1326 place count 542 transition count 1695
Partial Free-agglomeration rule applied 459 times.
Drop transitions removed 459 transitions
Iterating global reduction 4 with 459 rules applied. Total rules applied 1785 place count 542 transition count 1695
Applied a total of 1785 rules in 224 ms. Remains 542 /1043 variables (removed 501) and now considering 1695/2520 (removed 825) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 542/1043 places, 1695/2520 transitions.
Incomplete random walk after 10000 steps, including 97 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 497309 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 497309 steps, saw 67894 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1695 rows 542 cols
[2023-03-09 15:09:28] [INFO ] Computed 22 place invariants in 39 ms
[2023-03-09 15:09:28] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:09:28] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:09:29] [INFO ] After 489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:09:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-09 15:09:29] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-09 15:09:29] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:09:29] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-09 15:09:29] [INFO ] After 203ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:09:29] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-09 15:09:29] [INFO ] After 940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 43 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 542/542 places, 1695/1695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 36 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
[2023-03-09 15:09:30] [INFO ] Invariant cache hit.
[2023-03-09 15:09:30] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-09 15:09:30] [INFO ] Invariant cache hit.
[2023-03-09 15:09:30] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-09 15:09:34] [INFO ] Implicit Places using invariants and state equation in 4356 ms returned []
Implicit Place search using SMT with State Equation took 4807 ms to find 0 implicit places.
[2023-03-09 15:09:34] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-09 15:09:34] [INFO ] Invariant cache hit.
[2023-03-09 15:09:35] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5547 ms. Remains : 542/542 places, 1695/1695 transitions.
Graph (trivial) has 1536 edges and 542 vertex of which 437 / 542 are part of one of the 2 SCC in 2 ms
Free SCC test removed 435 places
Drop transitions removed 1121 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 1527 transitions.
Graph (complete) has 291 edges and 107 vertex of which 49 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 49 transition count 92
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 15 transition count 41
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 15 transition count 41
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 15 transition count 24
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 148 place count 14 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 13 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 13 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 14 ms. Remains 10 /542 variables (removed 532) and now considering 15/1695 (removed 1680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2023-03-09 15:09:35] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 15:09:35] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-09 15:09:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 15:09:35] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:09:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-09 15:09:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 15:09:35] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:09:35] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 15:09:35] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 90 ms :[true, p0, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 28 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-09 15:09:36] [INFO ] Computed 22 place invariants in 44 ms
[2023-03-09 15:09:36] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-09 15:09:36] [INFO ] Invariant cache hit.
[2023-03-09 15:09:37] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:09:39] [INFO ] Implicit Places using invariants and state equation in 2986 ms returned []
Implicit Place search using SMT with State Equation took 3361 ms to find 0 implicit places.
[2023-03-09 15:09:39] [INFO ] Invariant cache hit.
[2023-03-09 15:09:40] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4354 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 21 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 231440 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 231440 steps, saw 57105 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:09:43] [INFO ] Invariant cache hit.
[2023-03-09 15:09:43] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-09 15:09:43] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-09 15:09:44] [INFO ] After 821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:09:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-09 15:09:44] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-09 15:09:45] [INFO ] After 629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:09:45] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:09:45] [INFO ] After 510ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:09:46] [INFO ] After 632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-09 15:09:46] [INFO ] After 1594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 1 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1324 place count 544 transition count 1695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1326 place count 542 transition count 1695
Partial Free-agglomeration rule applied 459 times.
Drop transitions removed 459 transitions
Iterating global reduction 4 with 459 rules applied. Total rules applied 1785 place count 542 transition count 1695
Applied a total of 1785 rules in 208 ms. Remains 542 /1043 variables (removed 501) and now considering 1695/2520 (removed 825) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 542/1043 places, 1695/2520 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 474785 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 474785 steps, saw 65487 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1695 rows 542 cols
[2023-03-09 15:09:49] [INFO ] Computed 22 place invariants in 17 ms
[2023-03-09 15:09:49] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:09:49] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-09 15:09:49] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:09:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:09:50] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-09 15:09:50] [INFO ] After 406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:09:50] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-09 15:09:50] [INFO ] After 222ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:09:50] [INFO ] After 340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-09 15:09:50] [INFO ] After 956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 28 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 542/542 places, 1695/1695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 28 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
[2023-03-09 15:09:51] [INFO ] Invariant cache hit.
[2023-03-09 15:09:51] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-09 15:09:51] [INFO ] Invariant cache hit.
[2023-03-09 15:09:51] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-09 15:09:55] [INFO ] Implicit Places using invariants and state equation in 3648 ms returned []
Implicit Place search using SMT with State Equation took 4100 ms to find 0 implicit places.
[2023-03-09 15:09:55] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-09 15:09:55] [INFO ] Invariant cache hit.
[2023-03-09 15:09:55] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4883 ms. Remains : 542/542 places, 1695/1695 transitions.
Graph (trivial) has 1536 edges and 542 vertex of which 437 / 542 are part of one of the 2 SCC in 5 ms
Free SCC test removed 435 places
Drop transitions removed 1121 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 1527 transitions.
Graph (complete) has 291 edges and 107 vertex of which 49 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 49 transition count 92
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 15 transition count 41
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 15 transition count 41
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 15 transition count 24
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 148 place count 14 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 13 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 13 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 17 ms. Remains 10 /542 variables (removed 532) and now considering 15/1695 (removed 1680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2023-03-09 15:09:55] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 15:09:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-09 15:09:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 15:09:55] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:09:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 15:09:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 15:09:55] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:09:55] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 15:09:55] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 100 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 105 ms :[true, p0, p0]
Product exploration explored 100000 steps with 214 reset in 466 ms.
Product exploration explored 100000 steps with 212 reset in 455 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[true, p0, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1043 transition count 2520
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 99 place count 1043 transition count 2520
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 118 place count 1043 transition count 2520
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 156 place count 1005 transition count 2482
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 194 place count 1005 transition count 2482
Performed 381 Post agglomeration using F-continuation condition.Transition count delta: -682
Deduced a syphon composed of 461 places in 1 ms
Iterating global reduction 1 with 381 rules applied. Total rules applied 575 place count 1005 transition count 3164
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 655 place count 925 transition count 3084
Deduced a syphon composed of 381 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 735 place count 925 transition count 3084
Deduced a syphon composed of 381 places in 0 ms
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 1 with 324 rules applied. Total rules applied 1059 place count 925 transition count 2760
Deduced a syphon composed of 381 places in 1 ms
Applied a total of 1059 rules in 681 ms. Remains 925 /1043 variables (removed 118) and now considering 2760/2520 (removed -240) transitions.
[2023-03-09 15:09:58] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 2760 rows 925 cols
[2023-03-09 15:09:58] [INFO ] Computed 22 place invariants in 58 ms
[2023-03-09 15:09:59] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 925/1043 places, 2760/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1888 ms. Remains : 925/1043 places, 2760/2520 transitions.
Built C files in :
/tmp/ltsmin3662977219409537127
[2023-03-09 15:09:59] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3662977219409537127
Running compilation step : cd /tmp/ltsmin3662977219409537127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3662977219409537127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3662977219409537127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 40 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-09 15:10:02] [INFO ] Computed 22 place invariants in 56 ms
[2023-03-09 15:10:03] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-09 15:10:03] [INFO ] Invariant cache hit.
[2023-03-09 15:10:03] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:10:05] [INFO ] Implicit Places using invariants and state equation in 2813 ms returned []
Implicit Place search using SMT with State Equation took 3275 ms to find 0 implicit places.
[2023-03-09 15:10:05] [INFO ] Invariant cache hit.
[2023-03-09 15:10:06] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4292 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Built C files in :
/tmp/ltsmin16983330328069146875
[2023-03-09 15:10:06] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16983330328069146875
Running compilation step : cd /tmp/ltsmin16983330328069146875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16983330328069146875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16983330328069146875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 15:10:10] [INFO ] Flatten gal took : 81 ms
[2023-03-09 15:10:10] [INFO ] Flatten gal took : 75 ms
[2023-03-09 15:10:10] [INFO ] Time to serialize gal into /tmp/LTL9867532841877355634.gal : 18 ms
[2023-03-09 15:10:10] [INFO ] Time to serialize properties into /tmp/LTL16435004027821404913.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9867532841877355634.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3967788448620183553.hoa' '-atoms' '/tmp/LTL16435004027821404913.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/LTL16435004027821404913.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3967788448620183553.hoa
Detected timeout of ITS tools.
[2023-03-09 15:10:25] [INFO ] Flatten gal took : 89 ms
[2023-03-09 15:10:25] [INFO ] Flatten gal took : 72 ms
[2023-03-09 15:10:25] [INFO ] Time to serialize gal into /tmp/LTL2650558098571873198.gal : 11 ms
[2023-03-09 15:10:25] [INFO ] Time to serialize properties into /tmp/LTL5384474720516456871.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2650558098571873198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5384474720516456871.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(G("((Node17OKshare<3)&&(Node0DHTinfo2<3))"))))
Formula 0 simplified : XF!"((Node17OKshare<3)&&(Node0DHTinfo2<3))"
Detected timeout of ITS tools.
[2023-03-09 15:10:40] [INFO ] Flatten gal took : 67 ms
[2023-03-09 15:10:40] [INFO ] Applying decomposition
[2023-03-09 15:10:40] [INFO ] Flatten gal took : 99 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/graph17814096339648560613.txt' '-o' '/tmp/graph17814096339648560613.bin' '-w' '/tmp/graph17814096339648560613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17814096339648560613.bin' '-l' '-1' '-v' '-w' '/tmp/graph17814096339648560613.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:10:41] [INFO ] Decomposing Gal with order
[2023-03-09 15:10:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:10:41] [INFO ] Removed a total of 1200 redundant transitions.
[2023-03-09 15:10:41] [INFO ] Flatten gal took : 238 ms
[2023-03-09 15:10:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1178 labels/synchronizations in 86 ms.
[2023-03-09 15:10:41] [INFO ] Time to serialize gal into /tmp/LTL11727077209392679857.gal : 20 ms
[2023-03-09 15:10:41] [INFO ] Time to serialize properties into /tmp/LTL3441243462120628004.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/LTL11727077209392679857.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3441243462120628004.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(G("((u68.Node17OKshare<3)&&(i1.u1.Node0DHTinfo2<3))"))))
Formula 0 simplified : XF!"((u68.Node17OKshare<3)&&(i1.u1.Node0DHTinfo2<3))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8427787900574723459
[2023-03-09 15:10:56] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8427787900574723459
Running compilation step : cd /tmp/ltsmin8427787900574723459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8427787900574723459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8427787900574723459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-02 finished in 106338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 0 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 2 with 756 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1377 place count 525 transition count 1661
Applied a total of 1377 rules in 159 ms. Remains 525 /1043 variables (removed 518) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-09 15:11:00] [INFO ] Computed 22 place invariants in 30 ms
[2023-03-09 15:11:00] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-09 15:11:00] [INFO ] Invariant cache hit.
[2023-03-09 15:11:00] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-09 15:11:02] [INFO ] Implicit Places using invariants and state equation in 2012 ms returned []
Implicit Place search using SMT with State Equation took 2309 ms to find 0 implicit places.
[2023-03-09 15:11:02] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-09 15:11:02] [INFO ] Invariant cache hit.
[2023-03-09 15:11:03] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1661/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3242 ms. Remains : 525/1043 places, 1661/2520 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s144 s175), p1:(GT 2 s517)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 964 reset in 594 ms.
Product exploration explored 100000 steps with 966 reset in 455 ms.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 420910 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 420910 steps, saw 54985 distinct states, run finished after 3005 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 15:11:07] [INFO ] Invariant cache hit.
[2023-03-09 15:11:07] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:11:07] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:11:08] [INFO ] After 489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:11:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-09 15:11:08] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-09 15:11:08] [INFO ] After 420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:11:08] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-09 15:11:09] [INFO ] After 294ms SMT Verify possible using 1175 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 15:11:09] [INFO ] After 485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-09 15:11:09] [INFO ] After 1142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 525 transition count 1660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 422 place count 524 transition count 1660
Applied a total of 422 rules in 89 ms. Remains 524 /525 variables (removed 1) and now considering 1660/1661 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 524/525 places, 1660/1661 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 424018 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 424018 steps, saw 55665 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1660 rows 524 cols
[2023-03-09 15:11:12] [INFO ] Computed 22 place invariants in 30 ms
[2023-03-09 15:11:12] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:11:12] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:11:13] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:11:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:11:13] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 12 ms returned sat
[2023-03-09 15:11:13] [INFO ] After 456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:11:13] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-09 15:11:14] [INFO ] After 329ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 15:11:14] [INFO ] After 511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-09 15:11:14] [INFO ] After 1254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 38 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 31 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2023-03-09 15:11:14] [INFO ] Invariant cache hit.
[2023-03-09 15:11:15] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-09 15:11:15] [INFO ] Invariant cache hit.
[2023-03-09 15:11:15] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-09 15:11:18] [INFO ] Implicit Places using invariants and state equation in 3929 ms returned []
Implicit Place search using SMT with State Equation took 4363 ms to find 0 implicit places.
[2023-03-09 15:11:19] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-09 15:11:19] [INFO ] Invariant cache hit.
[2023-03-09 15:11:19] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5103 ms. Remains : 524/524 places, 1660/1660 transitions.
Graph (trivial) has 1529 edges and 524 vertex of which 437 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 435 places
Drop transitions removed 1153 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 1562 transitions.
Graph (complete) has 220 edges and 89 vertex of which 28 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 28 transition count 38
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 9 transition count 19
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 9 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 8 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 8 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 7 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 6 transition count 12
Applied a total of 90 rules in 7 ms. Remains 6 /524 variables (removed 518) and now considering 12/1660 (removed 1648) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 6 cols
[2023-03-09 15:11:19] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 15:11:19] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:11:19] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:11:19] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-09 15:11:19] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 39 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-09 15:11:20] [INFO ] Computed 22 place invariants in 26 ms
[2023-03-09 15:11:20] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-09 15:11:20] [INFO ] Invariant cache hit.
[2023-03-09 15:11:20] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-09 15:11:21] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 1795 ms to find 0 implicit places.
[2023-03-09 15:11:22] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-09 15:11:22] [INFO ] Invariant cache hit.
[2023-03-09 15:11:22] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2422 ms. Remains : 525/525 places, 1661/1661 transitions.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 504493 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 504493 steps, saw 64082 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 15:11:25] [INFO ] Invariant cache hit.
[2023-03-09 15:11:26] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-09 15:11:26] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-09 15:11:26] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:11:26] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:11:26] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-09 15:11:26] [INFO ] After 480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:11:27] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-09 15:11:27] [INFO ] After 360ms SMT Verify possible using 1175 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 15:11:27] [INFO ] After 507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-09 15:11:27] [INFO ] After 1244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 525 transition count 1660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 422 place count 524 transition count 1660
Applied a total of 422 rules in 83 ms. Remains 524 /525 variables (removed 1) and now considering 1660/1661 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 524/525 places, 1660/1661 transitions.
Incomplete random walk after 10000 steps, including 103 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 458153 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 458153 steps, saw 59434 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1660 rows 524 cols
[2023-03-09 15:11:30] [INFO ] Computed 22 place invariants in 36 ms
[2023-03-09 15:11:31] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:11:31] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-09 15:11:31] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:11:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:11:31] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:11:31] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:11:31] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-09 15:11:32] [INFO ] After 272ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 15:11:32] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-09 15:11:32] [INFO ] After 1041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 33 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 30 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2023-03-09 15:11:32] [INFO ] Invariant cache hit.
[2023-03-09 15:11:32] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-09 15:11:32] [INFO ] Invariant cache hit.
[2023-03-09 15:11:33] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-09 15:11:36] [INFO ] Implicit Places using invariants and state equation in 4002 ms returned []
Implicit Place search using SMT with State Equation took 4405 ms to find 0 implicit places.
[2023-03-09 15:11:37] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-09 15:11:37] [INFO ] Invariant cache hit.
[2023-03-09 15:11:37] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5232 ms. Remains : 524/524 places, 1660/1660 transitions.
Graph (trivial) has 1529 edges and 524 vertex of which 437 / 524 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions removed 1153 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 1562 transitions.
Graph (complete) has 220 edges and 89 vertex of which 28 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 28 transition count 38
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 9 transition count 19
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 9 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 8 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 8 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 7 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 6 transition count 12
Applied a total of 90 rules in 5 ms. Remains 6 /524 variables (removed 518) and now considering 12/1660 (removed 1648) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 6 cols
[2023-03-09 15:11:37] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 15:11:37] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:11:37] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:11:37] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 15:11:37] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 973 reset in 577 ms.
Product exploration explored 100000 steps with 968 reset in 493 ms.
Built C files in :
/tmp/ltsmin15188601898323663584
[2023-03-09 15:11:39] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2023-03-09 15:11:39] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15188601898323663584
Running compilation step : cd /tmp/ltsmin15188601898323663584;'/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 2742 ms.
Running link step : cd /tmp/ltsmin15188601898323663584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin15188601898323663584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6845043689452230229.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 20 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-09 15:11:54] [INFO ] Computed 22 place invariants in 12 ms
[2023-03-09 15:11:54] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-09 15:11:54] [INFO ] Invariant cache hit.
[2023-03-09 15:11:55] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-09 15:11:56] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 1743 ms to find 0 implicit places.
[2023-03-09 15:11:56] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-09 15:11:56] [INFO ] Invariant cache hit.
[2023-03-09 15:11:56] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2500 ms. Remains : 525/525 places, 1661/1661 transitions.
Built C files in :
/tmp/ltsmin12095286080365625647
[2023-03-09 15:11:56] [INFO ] Too many transitions (1661) to apply POR reductions. Disabling POR matrices.
[2023-03-09 15:11:56] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12095286080365625647
Running compilation step : cd /tmp/ltsmin12095286080365625647;'/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 2761 ms.
Running link step : cd /tmp/ltsmin12095286080365625647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin12095286080365625647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1220977680813423614.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 15:12:12] [INFO ] Flatten gal took : 36 ms
[2023-03-09 15:12:12] [INFO ] Flatten gal took : 34 ms
[2023-03-09 15:12:12] [INFO ] Time to serialize gal into /tmp/LTL14800963051433366978.gal : 8 ms
[2023-03-09 15:12:12] [INFO ] Time to serialize properties into /tmp/LTL12965542643472646411.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/LTL14800963051433366978.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14501491729350592611.hoa' '-atoms' '/tmp/LTL12965542643472646411.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/LTL12965542643472646411.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14501491729350592611.hoa
Detected timeout of ITS tools.
[2023-03-09 15:12:27] [INFO ] Flatten gal took : 62 ms
[2023-03-09 15:12:27] [INFO ] Flatten gal took : 45 ms
[2023-03-09 15:12:27] [INFO ] Time to serialize gal into /tmp/LTL15646138535915215709.gal : 9 ms
[2023-03-09 15:12:27] [INFO ] Time to serialize properties into /tmp/LTL4769612171153793602.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/LTL15646138535915215709.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4769612171153793602.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(Node1requestsent2>Node2GiveAnswer12)"))||(G(F("(Node19GiveAnswer12<2)"))))))
Formula 0 simplified : G(F!"(Node1requestsent2>Node2GiveAnswer12)" & FG!"(Node19GiveAnswer12<2)")
Detected timeout of ITS tools.
[2023-03-09 15:12:42] [INFO ] Flatten gal took : 59 ms
[2023-03-09 15:12:42] [INFO ] Applying decomposition
[2023-03-09 15:12:42] [INFO ] Flatten gal took : 44 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/graph18137064909871773354.txt' '-o' '/tmp/graph18137064909871773354.bin' '-w' '/tmp/graph18137064909871773354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18137064909871773354.bin' '-l' '-1' '-v' '-w' '/tmp/graph18137064909871773354.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:12:42] [INFO ] Decomposing Gal with order
[2023-03-09 15:12:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:12:42] [INFO ] Removed a total of 1206 redundant transitions.
[2023-03-09 15:12:42] [INFO ] Flatten gal took : 111 ms
[2023-03-09 15:12:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 761 labels/synchronizations in 46 ms.
[2023-03-09 15:12:42] [INFO ] Time to serialize gal into /tmp/LTL5398606857044553499.gal : 11 ms
[2023-03-09 15:12:42] [INFO ] Time to serialize properties into /tmp/LTL17227140601097547000.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/LTL5398606857044553499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17227140601097547000.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(gu21.Node1requestsent2>gu21.Node2GiveAnswer12)"))||(G(F("(gi0.gu13.Node19GiveAnswer12<2)"))))))
Formula 0 simplified : G(F!"(gu21.Node1requestsent2>gu21.Node2GiveAnswer12)" & FG!"(gi0.gu13.Node19GiveAnswer12<2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2642905584108734935
[2023-03-09 15:12:58] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2642905584108734935
Running compilation step : cd /tmp/ltsmin2642905584108734935;'/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 2866 ms.
Running link step : cd /tmp/ltsmin2642905584108734935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin2642905584108734935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-04 finished in 133206 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)||G((p2 U p1))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 1 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 3 with 756 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 340 transitions
Redundant transition composition rules discarded 340 transitions
Iterating global reduction 3 with 340 rules applied. Total rules applied 1374 place count 526 transition count 1663
Applied a total of 1374 rules in 105 ms. Remains 526 /1043 variables (removed 517) and now considering 1663/2520 (removed 857) transitions.
// Phase 1: matrix 1663 rows 526 cols
[2023-03-09 15:13:13] [INFO ] Computed 22 place invariants in 12 ms
[2023-03-09 15:13:13] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-09 15:13:13] [INFO ] Invariant cache hit.
[2023-03-09 15:13:13] [INFO ] State equation strengthened by 1176 read => feed constraints.
[2023-03-09 15:13:15] [INFO ] Implicit Places using invariants and state equation in 2058 ms returned []
Implicit Place search using SMT with State Equation took 2295 ms to find 0 implicit places.
[2023-03-09 15:13:15] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-09 15:13:15] [INFO ] Invariant cache hit.
[2023-03-09 15:13:16] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1663/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3099 ms. Remains : 526/1043 places, 1663/2520 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(OR p1 p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s213), p0:(LEQ s467 s375), p2:(LEQ s46 s422)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-05 finished in 3418 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)&&X(G(p1))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 37 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-09 15:13:16] [INFO ] Computed 22 place invariants in 55 ms
[2023-03-09 15:13:17] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-09 15:13:17] [INFO ] Invariant cache hit.
[2023-03-09 15:13:17] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:13:20] [INFO ] Implicit Places using invariants and state equation in 3352 ms returned []
Implicit Place search using SMT with State Equation took 3812 ms to find 0 implicit places.
[2023-03-09 15:13:20] [INFO ] Invariant cache hit.
[2023-03-09 15:13:21] [INFO ] Dead Transitions using invariants and state equation in 1053 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4905 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (GT s517 s842) (GT 1 s780)) (GT s528 s230)), p0:(LEQ 1 s780)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-07 finished in 5101 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)&&(F(p1)||(p2&&G(p3))))))'
Support contains 6 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 38 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-09 15:13:21] [INFO ] Invariant cache hit.
[2023-03-09 15:13:22] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-09 15:13:22] [INFO ] Invariant cache hit.
[2023-03-09 15:13:22] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:13:25] [INFO ] Implicit Places using invariants and state equation in 3234 ms returned []
Implicit Place search using SMT with State Equation took 3620 ms to find 0 implicit places.
[2023-03-09 15:13:25] [INFO ] Invariant cache hit.
[2023-03-09 15:13:26] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4728 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s230 s378), p1:(LEQ s7 s94), p2:(LEQ 1 s206), p3:(LEQ 1 s410)], 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 50000 reset in 981 ms.
Product exploration explored 100000 steps with 50000 reset in 905 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))
Knowledge based reduction with 8 factoid took 192 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-08 finished in 7105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(G(p2))&&(p0 U (p1||G(p0)))))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1375 place count 526 transition count 1662
Applied a total of 1375 rules in 99 ms. Remains 526 /1043 variables (removed 517) and now considering 1662/2520 (removed 858) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2023-03-09 15:13:28] [INFO ] Computed 22 place invariants in 26 ms
[2023-03-09 15:13:29] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-09 15:13:29] [INFO ] Invariant cache hit.
[2023-03-09 15:13:29] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:13:30] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
[2023-03-09 15:13:30] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-09 15:13:30] [INFO ] Invariant cache hit.
[2023-03-09 15:13:31] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1662/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2851 ms. Remains : 526/1043 places, 1662/2520 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p2) p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ s464 s326), p0:(GT 3 s345), p1:(AND (GT 2 s83) (GT 3 s345))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 967 reset in 465 ms.
Product exploration explored 100000 steps with 967 reset in 450 ms.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (OR (AND p0 p2) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (OR (AND p0 p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 757 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-09 15:13:34] [INFO ] Invariant cache hit.
[2023-03-09 15:13:34] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:13:34] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:13:34] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 15:13:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:13:34] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:13:34] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-09 15:13:34] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:13:35] [INFO ] After 502ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2023-03-09 15:13:35] [INFO ] After 1026ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-09 15:13:36] [INFO ] After 2051ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 1661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 525 transition count 1661
Partial Free-agglomeration rule applied 436 times.
Drop transitions removed 436 transitions
Iterating global reduction 1 with 436 rules applied. Total rules applied 438 place count 525 transition count 1661
Applied a total of 438 rules in 73 ms. Remains 525 /526 variables (removed 1) and now considering 1661/1662 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 525/526 places, 1661/1662 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 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 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 398066 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 398066 steps, saw 51836 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-09 15:13:39] [INFO ] Computed 22 place invariants in 11 ms
[2023-03-09 15:13:39] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-09 15:13:39] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-09 15:13:39] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 15:13:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:13:39] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:13:40] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 15:13:40] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-09 15:13:41] [INFO ] After 482ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 15:13:41] [INFO ] After 851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-09 15:13:41] [INFO ] After 1835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 37 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 525/525 places, 1661/1661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 32 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2023-03-09 15:13:41] [INFO ] Invariant cache hit.
[2023-03-09 15:13:42] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-09 15:13:42] [INFO ] Invariant cache hit.
[2023-03-09 15:13:42] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-09 15:13:46] [INFO ] Implicit Places using invariants and state equation in 3998 ms returned []
Implicit Place search using SMT with State Equation took 4405 ms to find 0 implicit places.
[2023-03-09 15:13:46] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-09 15:13:46] [INFO ] Invariant cache hit.
[2023-03-09 15:13:46] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5033 ms. Remains : 525/525 places, 1661/1661 transitions.
Graph (trivial) has 1530 edges and 525 vertex of which 437 / 525 are part of one of the 2 SCC in 0 ms
Free SCC test removed 435 places
Drop transitions removed 1154 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 1561 transitions.
Graph (complete) has 222 edges and 90 vertex of which 29 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 29 transition count 40
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 11 transition count 22
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 place count 11 transition count 22
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 1 with 2 rules applied. Total rules applied 80 place count 10 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 9 transition count 17
Applied a total of 84 rules in 8 ms. Remains 9 /525 variables (removed 516) and now considering 17/1661 (removed 1644) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 17 rows 9 cols
[2023-03-09 15:13:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 15:13:46] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 15:13:46] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 15:13:46] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 15:13:46] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (OR (AND p0 p2) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (OR (AND p0 p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 19 factoid took 797 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 27 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2023-03-09 15:13:47] [INFO ] Computed 22 place invariants in 18 ms
[2023-03-09 15:13:48] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-09 15:13:48] [INFO ] Invariant cache hit.
[2023-03-09 15:13:48] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:13:50] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
[2023-03-09 15:13:50] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-09 15:13:50] [INFO ] Invariant cache hit.
[2023-03-09 15:13:50] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2843 ms. Remains : 526/526 places, 1662/1662 transitions.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 271 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 15:13:51] [INFO ] Invariant cache hit.
[2023-03-09 15:13:51] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:13:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:13:51] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:13:52] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:13:52] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:13:52] [INFO ] After 332ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:13:52] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-09 15:13:52] [INFO ] After 1289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 1661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 525 transition count 1661
Partial Free-agglomeration rule applied 436 times.
Drop transitions removed 436 transitions
Iterating global reduction 1 with 436 rules applied. Total rules applied 438 place count 525 transition count 1661
Applied a total of 438 rules in 88 ms. Remains 525 /526 variables (removed 1) and now considering 1661/1662 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 525/526 places, 1661/1662 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 394527 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 394527 steps, saw 51391 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-09 15:13:56] [INFO ] Computed 22 place invariants in 31 ms
[2023-03-09 15:13:56] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:13:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:13:56] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-09 15:13:56] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:13:56] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-09 15:13:57] [INFO ] After 313ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:13:57] [INFO ] After 534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-09 15:13:57] [INFO ] After 1195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 24 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 525/525 places, 1661/1661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 47 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2023-03-09 15:13:57] [INFO ] Invariant cache hit.
[2023-03-09 15:13:58] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-09 15:13:58] [INFO ] Invariant cache hit.
[2023-03-09 15:13:58] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-09 15:14:01] [INFO ] Implicit Places using invariants and state equation in 3410 ms returned []
Implicit Place search using SMT with State Equation took 3860 ms to find 0 implicit places.
[2023-03-09 15:14:01] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-09 15:14:01] [INFO ] Invariant cache hit.
[2023-03-09 15:14:02] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4701 ms. Remains : 525/525 places, 1661/1661 transitions.
Graph (trivial) has 1530 edges and 525 vertex of which 437 / 525 are part of one of the 2 SCC in 0 ms
Free SCC test removed 435 places
Drop transitions removed 1154 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 1561 transitions.
Graph (complete) has 222 edges and 90 vertex of which 29 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 29 transition count 40
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 11 transition count 22
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 place count 11 transition count 22
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 1 with 2 rules applied. Total rules applied 80 place count 10 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 9 transition count 17
Applied a total of 84 rules in 3 ms. Remains 9 /525 variables (removed 516) and now considering 17/1661 (removed 1644) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 17 rows 9 cols
[2023-03-09 15:14:02] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 15:14:02] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:14:02] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:14:02] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 15:14:02] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 9 factoid took 348 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 970 reset in 573 ms.
Product exploration explored 100000 steps with 956 reset in 504 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 43 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2023-03-09 15:14:04] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 1662 rows 526 cols
[2023-03-09 15:14:04] [INFO ] Computed 22 place invariants in 22 ms
[2023-03-09 15:14:05] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 834 ms. Remains : 526/526 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin11910710746596565538
[2023-03-09 15:14:05] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11910710746596565538
Running compilation step : cd /tmp/ltsmin11910710746596565538;'/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 2814 ms.
Running link step : cd /tmp/ltsmin11910710746596565538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin11910710746596565538;'/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/stateBased9314111350172869899.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 13 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2023-03-09 15:14:20] [INFO ] Invariant cache hit.
[2023-03-09 15:14:20] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-09 15:14:20] [INFO ] Invariant cache hit.
[2023-03-09 15:14:21] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:14:22] [INFO ] Implicit Places using invariants and state equation in 2056 ms returned []
Implicit Place search using SMT with State Equation took 2307 ms to find 0 implicit places.
[2023-03-09 15:14:22] [INFO ] Invariant cache hit.
[2023-03-09 15:14:23] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2965 ms. Remains : 526/526 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin5711173162169043873
[2023-03-09 15:14:23] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5711173162169043873
Running compilation step : cd /tmp/ltsmin5711173162169043873;'/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 2582 ms.
Running link step : cd /tmp/ltsmin5711173162169043873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin5711173162169043873;'/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/stateBased7501551175900577876.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 15:14:38] [INFO ] Flatten gal took : 75 ms
[2023-03-09 15:14:38] [INFO ] Flatten gal took : 51 ms
[2023-03-09 15:14:38] [INFO ] Time to serialize gal into /tmp/LTL7508946056567242367.gal : 10 ms
[2023-03-09 15:14:38] [INFO ] Time to serialize properties into /tmp/LTL7090431877495414316.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/LTL7508946056567242367.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12666438743993291679.hoa' '-atoms' '/tmp/LTL7090431877495414316.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/LTL7090431877495414316.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12666438743993291679.hoa
Detected timeout of ITS tools.
[2023-03-09 15:14:53] [INFO ] Flatten gal took : 24 ms
[2023-03-09 15:14:53] [INFO ] Flatten gal took : 24 ms
[2023-03-09 15:14:53] [INFO ] Time to serialize gal into /tmp/LTL9514566636489516055.gal : 4 ms
[2023-03-09 15:14:53] [INFO ] Time to serialize properties into /tmp/LTL15699302810391543496.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/LTL9514566636489516055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15699302810391543496.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 : !(((("(Node10GiveAnswer19<3)")U((G("(Node10GiveAnswer19<3)"))||("((Node13ResZone<2)&&(Node10GiveAnswer19<3))")))U((G(("(Node10GiveAnsw...415
Formula 0 simplified : (!"(Node10GiveAnswer19<3)" M !"((Node13ResZone<2)&&(Node10GiveAnswer19<3))") R (F(!"((Node13ResZone<2)&&(Node10GiveAnswer19<3))" & !...310
Detected timeout of ITS tools.
[2023-03-09 15:15:08] [INFO ] Flatten gal took : 55 ms
[2023-03-09 15:15:08] [INFO ] Applying decomposition
[2023-03-09 15:15:08] [INFO ] Flatten gal took : 42 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/graph16457201960980821893.txt' '-o' '/tmp/graph16457201960980821893.bin' '-w' '/tmp/graph16457201960980821893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16457201960980821893.bin' '-l' '-1' '-v' '-w' '/tmp/graph16457201960980821893.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:15:09] [INFO ] Decomposing Gal with order
[2023-03-09 15:15:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:15:09] [INFO ] Removed a total of 1213 redundant transitions.
[2023-03-09 15:15:09] [INFO ] Flatten gal took : 119 ms
[2023-03-09 15:15:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 764 labels/synchronizations in 50 ms.
[2023-03-09 15:15:09] [INFO ] Time to serialize gal into /tmp/LTL11569001259821783897.gal : 11 ms
[2023-03-09 15:15:09] [INFO ] Time to serialize properties into /tmp/LTL758268379404906629.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/LTL11569001259821783897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL758268379404906629.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 : !(((("(gi0.gu21.Node10GiveAnswer19<3)")U((G("(gi0.gu21.Node10GiveAnswer19<3)"))||("((gi0.gu14.Node13ResZone<2)&&(gi0.gu21.Node10GiveAn...533
Formula 0 simplified : (!"(gi0.gu21.Node10GiveAnswer19<3)" M !"((gi0.gu14.Node13ResZone<2)&&(gi0.gu21.Node10GiveAnswer19<3))") R (F(!"((gi0.gu14.Node13ResZ...401
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1332259119231749205
[2023-03-09 15:15:24] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1332259119231749205
Running compilation step : cd /tmp/ltsmin1332259119231749205;'/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 2655 ms.
Running link step : cd /tmp/ltsmin1332259119231749205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin1332259119231749205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true))) U ([](((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))||(X([]((LTLAPp2==true)))&&((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-09 finished in 130844 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))||G((G(F(p1)) U p2))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 39 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-09 15:15:39] [INFO ] Computed 22 place invariants in 62 ms
[2023-03-09 15:15:40] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-09 15:15:40] [INFO ] Invariant cache hit.
[2023-03-09 15:15:40] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:15:43] [INFO ] Implicit Places using invariants and state equation in 3429 ms returned []
Implicit Place search using SMT with State Equation took 3847 ms to find 0 implicit places.
[2023-03-09 15:15:43] [INFO ] Invariant cache hit.
[2023-03-09 15:15:44] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4933 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p2)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s444), p0:(GT 3 s857), p1:(GT 1 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33266 reset in 865 ms.
Product exploration explored 100000 steps with 33267 reset in 667 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Detected a total of 82/1043 stabilizing places and 140/2520 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 18 factoid took 1343 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 6) seen :3
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 15:15:48] [INFO ] Invariant cache hit.
[2023-03-09 15:15:48] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-09 15:15:48] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-09 15:15:49] [INFO ] After 874ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-09 15:15:49] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:15:49] [INFO ] After 363ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-09 15:15:49] [INFO ] After 1491ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-09 15:15:50] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-09 15:15:50] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-09 15:15:50] [INFO ] After 688ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-09 15:15:51] [INFO ] After 663ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-09 15:15:51] [INFO ] After 982ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 223 ms.
[2023-03-09 15:15:51] [INFO ] After 2123ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1038 place count 524 transition count 2001
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1379 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1380 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1381 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 1801 place count 523 transition count 1659
Applied a total of 1801 rules in 169 ms. Remains 523 /1043 variables (removed 520) and now considering 1659/2520 (removed 861) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 523/1043 places, 1659/2520 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 455470 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 455470 steps, saw 58908 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1659 rows 523 cols
[2023-03-09 15:15:55] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-09 15:15:55] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-09 15:15:55] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:15:55] [INFO ] After 320ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 15:15:55] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-09 15:15:55] [INFO ] After 216ms SMT Verify possible using 1596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:15:55] [INFO ] After 634ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:15:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-09 15:15:56] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-09 15:15:56] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:15:56] [INFO ] After 299ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 15:15:56] [INFO ] After 443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-09 15:15:57] [INFO ] After 1186ms 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 2 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 30 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 43 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-09 15:15:57] [INFO ] Invariant cache hit.
[2023-03-09 15:15:57] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-09 15:15:57] [INFO ] Invariant cache hit.
[2023-03-09 15:15:58] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-09 15:16:01] [INFO ] Implicit Places using invariants and state equation in 4260 ms returned []
Implicit Place search using SMT with State Equation took 4711 ms to find 0 implicit places.
[2023-03-09 15:16:01] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-09 15:16:01] [INFO ] Invariant cache hit.
[2023-03-09 15:16:02] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5441 ms. Remains : 523/523 places, 1659/1659 transitions.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 5 transition count 8
Applied a total of 87 rules in 7 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-09 15:16:02] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 15:16:02] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:16:02] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:16:02] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 15:16:02] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F p2)]
Knowledge based reduction with 19 factoid took 1190 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 348 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 30 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-09 15:16:04] [INFO ] Computed 22 place invariants in 63 ms
[2023-03-09 15:16:05] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-09 15:16:05] [INFO ] Invariant cache hit.
[2023-03-09 15:16:05] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:16:08] [INFO ] Implicit Places using invariants and state equation in 3294 ms returned []
Implicit Place search using SMT with State Equation took 3740 ms to find 0 implicit places.
[2023-03-09 15:16:08] [INFO ] Invariant cache hit.
[2023-03-09 15:16:09] [INFO ] Dead Transitions using invariants and state equation in 1130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4901 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Detected a total of 82/1043 stabilizing places and 140/2520 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 456 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 15:16:10] [INFO ] Invariant cache hit.
[2023-03-09 15:16:10] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-09 15:16:10] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-09 15:16:11] [INFO ] After 945ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2023-03-09 15:16:11] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:16:12] [INFO ] After 612ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 15:16:12] [INFO ] After 1830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 15:16:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-09 15:16:12] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-09 15:16:13] [INFO ] After 932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 15:16:14] [INFO ] After 1172ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 15:16:15] [INFO ] After 1988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 589 ms.
[2023-03-09 15:16:16] [INFO ] After 3794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 11 ms.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1038 place count 524 transition count 2001
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1379 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1380 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1381 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 1801 place count 523 transition count 1659
Applied a total of 1801 rules in 170 ms. Remains 523 /1043 variables (removed 520) and now considering 1659/2520 (removed 861) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 523/1043 places, 1659/2520 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 456704 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 456704 steps, saw 59056 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1659 rows 523 cols
[2023-03-09 15:16:19] [INFO ] Computed 22 place invariants in 27 ms
[2023-03-09 15:16:19] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:16:19] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-09 15:16:20] [INFO ] After 386ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 15:16:20] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-09 15:16:20] [INFO ] After 317ms SMT Verify possible using 1596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:16:20] [INFO ] After 876ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:16:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:16:20] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-09 15:16:21] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:16:21] [INFO ] After 316ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 15:16:21] [INFO ] After 533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-09 15:16:21] [INFO ] After 1288ms 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 3 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 38 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 33 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-09 15:16:21] [INFO ] Invariant cache hit.
[2023-03-09 15:16:22] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-09 15:16:22] [INFO ] Invariant cache hit.
[2023-03-09 15:16:22] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-09 15:16:26] [INFO ] Implicit Places using invariants and state equation in 3882 ms returned []
Implicit Place search using SMT with State Equation took 4306 ms to find 0 implicit places.
[2023-03-09 15:16:26] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-09 15:16:26] [INFO ] Invariant cache hit.
[2023-03-09 15:16:26] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5127 ms. Remains : 523/523 places, 1659/1659 transitions.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 5 transition count 8
Applied a total of 87 rules in 7 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-09 15:16:26] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 15:16:27] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:16:27] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:16:27] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 15:16:27] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 756 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 303 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 215 reset in 440 ms.
Product exploration explored 100000 steps with 215 reset in 433 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 506 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1043 transition count 2520
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 99 place count 1043 transition count 2520
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 119 place count 1043 transition count 2520
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 159 place count 1003 transition count 2480
Deduced a syphon composed of 79 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 199 place count 1003 transition count 2480
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: -718
Deduced a syphon composed of 477 places in 1 ms
Iterating global reduction 1 with 398 rules applied. Total rules applied 597 place count 1003 transition count 3198
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 675 place count 925 transition count 3120
Deduced a syphon composed of 399 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 753 place count 925 transition count 3120
Deduced a syphon composed of 399 places in 1 ms
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 1 with 341 rules applied. Total rules applied 1094 place count 925 transition count 2779
Deduced a syphon composed of 399 places in 0 ms
Applied a total of 1094 rules in 283 ms. Remains 925 /1043 variables (removed 118) and now considering 2779/2520 (removed -259) transitions.
[2023-03-09 15:16:30] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 2779 rows 925 cols
[2023-03-09 15:16:30] [INFO ] Computed 22 place invariants in 53 ms
[2023-03-09 15:16:31] [INFO ] Dead Transitions using invariants and state equation in 1185 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 925/1043 places, 2779/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1544 ms. Remains : 925/1043 places, 2779/2520 transitions.
Built C files in :
/tmp/ltsmin17836537751307751005
[2023-03-09 15:16:31] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17836537751307751005
Running compilation step : cd /tmp/ltsmin17836537751307751005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17836537751307751005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17836537751307751005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 36 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-09 15:16:34] [INFO ] Computed 22 place invariants in 57 ms
[2023-03-09 15:16:35] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-09 15:16:35] [INFO ] Invariant cache hit.
[2023-03-09 15:16:36] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:16:38] [INFO ] Implicit Places using invariants and state equation in 3127 ms returned []
Implicit Place search using SMT with State Equation took 3567 ms to find 0 implicit places.
[2023-03-09 15:16:38] [INFO ] Invariant cache hit.
[2023-03-09 15:16:39] [INFO ] Dead Transitions using invariants and state equation in 1073 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4677 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Built C files in :
/tmp/ltsmin1891368015442547934
[2023-03-09 15:16:39] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1891368015442547934
Running compilation step : cd /tmp/ltsmin1891368015442547934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1891368015442547934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1891368015442547934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 15:16:42] [INFO ] Flatten gal took : 39 ms
[2023-03-09 15:16:42] [INFO ] Flatten gal took : 36 ms
[2023-03-09 15:16:42] [INFO ] Time to serialize gal into /tmp/LTL8226325434289888438.gal : 7 ms
[2023-03-09 15:16:42] [INFO ] Time to serialize properties into /tmp/LTL10435376745884431095.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8226325434289888438.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16111420330354943786.hoa' '-atoms' '/tmp/LTL10435376745884431095.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10435376745884431095.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16111420330354943786.hoa
Detected timeout of ITS tools.
[2023-03-09 15:16:57] [INFO ] Flatten gal took : 68 ms
[2023-03-09 15:16:57] [INFO ] Flatten gal took : 60 ms
[2023-03-09 15:16:57] [INFO ] Time to serialize gal into /tmp/LTL9351772900725152590.gal : 10 ms
[2023-03-09 15:16:57] [INFO ] Time to serialize properties into /tmp/LTL6085039877598761663.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/LTL9351772900725152590.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6085039877598761663.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(G("(Node15requestsent2<3)")))||(G((G(F("(Node2ID<1)")))U("(Node4GiveAnswer5>=1)")))))
Formula 0 simplified : XF!"(Node15requestsent2<3)" & F(FG!"(Node2ID<1)" R !"(Node4GiveAnswer5>=1)")
Detected timeout of ITS tools.
[2023-03-09 15:17:13] [INFO ] Flatten gal took : 84 ms
[2023-03-09 15:17:13] [INFO ] Applying decomposition
[2023-03-09 15:17:13] [INFO ] Flatten gal took : 62 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/graph7455607719823856902.txt' '-o' '/tmp/graph7455607719823856902.bin' '-w' '/tmp/graph7455607719823856902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7455607719823856902.bin' '-l' '-1' '-v' '-w' '/tmp/graph7455607719823856902.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:17:13] [INFO ] Decomposing Gal with order
[2023-03-09 15:17:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:17:13] [INFO ] Removed a total of 1199 redundant transitions.
[2023-03-09 15:17:13] [INFO ] Flatten gal took : 140 ms
[2023-03-09 15:17:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1064 labels/synchronizations in 39 ms.
[2023-03-09 15:17:13] [INFO ] Time to serialize gal into /tmp/LTL9639800544625345665.gal : 18 ms
[2023-03-09 15:17:13] [INFO ] Time to serialize properties into /tmp/LTL13276210989694737010.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/LTL9639800544625345665.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13276210989694737010.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(G("(u61.Node15requestsent2<3)")))||(G((G(F("(i2.i1.u8.Node2ID<1)")))U("(u23.Node4GiveAnswer5>=1)")))))
Formula 0 simplified : XF!"(u61.Node15requestsent2<3)" & F(FG!"(i2.i1.u8.Node2ID<1)" R !"(u23.Node4GiveAnswer5>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17184505324636952803
[2023-03-09 15:17:28] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17184505324636952803
Running compilation step : cd /tmp/ltsmin17184505324636952803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17184505324636952803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17184505324636952803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-11 finished in 112137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))||G(p1)))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-09 15:17:31] [INFO ] Invariant cache hit.
[2023-03-09 15:17:32] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-09 15:17:32] [INFO ] Invariant cache hit.
[2023-03-09 15:17:32] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:17:35] [INFO ] Implicit Places using invariants and state equation in 3009 ms returned []
Implicit Place search using SMT with State Equation took 3371 ms to find 0 implicit places.
[2023-03-09 15:17:35] [INFO ] Invariant cache hit.
[2023-03-09 15:17:36] [INFO ] Dead Transitions using invariants and state equation in 963 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4352 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 367 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=p1, acceptance={} source=7 dest: 4}, { cond=(NOT p1), acceptance={} source=7 dest: 6}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=7, aps=[p0:(GT s787 s724), p1:(OR (GT s787 s724) (GT 1 s709))], 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2951 steps with 6 reset in 20 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-12 finished in 4772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 30 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-09 15:17:36] [INFO ] Invariant cache hit.
[2023-03-09 15:17:36] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-09 15:17:36] [INFO ] Invariant cache hit.
[2023-03-09 15:17:37] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-09 15:17:40] [INFO ] Implicit Places using invariants and state equation in 3347 ms returned []
Implicit Place search using SMT with State Equation took 3721 ms to find 0 implicit places.
[2023-03-09 15:17:40] [INFO ] Invariant cache hit.
[2023-03-09 15:17:41] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4861 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 2 s716)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 449 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-13 finished in 5037 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)))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-020-LTLCardinality-02
Stuttering acceptance computed with spot in 93 ms :[true, p0, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 1 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Partial Post-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 1360 place count 544 transition count 1697
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1378 place count 526 transition count 1679
Iterating global reduction 3 with 18 rules applied. Total rules applied 1396 place count 526 transition count 1679
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 1414 place count 526 transition count 1661
Applied a total of 1414 rules in 179 ms. Remains 526 /1043 variables (removed 517) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2023-03-09 15:17:41] [INFO ] Computed 22 place invariants in 22 ms
[2023-03-09 15:17:42] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-09 15:17:42] [INFO ] Invariant cache hit.
[2023-03-09 15:17:42] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:17:44] [INFO ] Implicit Places using invariants and state equation in 1887 ms returned []
Implicit Place search using SMT with State Equation took 2179 ms to find 0 implicit places.
[2023-03-09 15:17:44] [INFO ] Invariant cache hit.
[2023-03-09 15:17:44] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 526/1043 places, 1661/2520 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3003 ms. Remains : 526/1043 places, 1661/2520 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 3 s111) (LEQ 3 s5))], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 950 reset in 445 ms.
Product exploration explored 100000 steps with 947 reset in 419 ms.
Computed a total of 60 stabilizing places and 99 stable transitions
Computed a total of 60 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 479615 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 479615 steps, saw 68778 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:17:48] [INFO ] Invariant cache hit.
[2023-03-09 15:17:49] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-09 15:17:49] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-09 15:17:49] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:17:49] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-09 15:17:49] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:49] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:17:50] [INFO ] After 244ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:50] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-09 15:17:50] [INFO ] After 853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1659
Partial Free-agglomeration rule applied 421 times.
Drop transitions removed 421 transitions
Iterating global reduction 1 with 421 rules applied. Total rules applied 425 place count 524 transition count 1659
Applied a total of 425 rules in 97 ms. Remains 524 /526 variables (removed 2) and now considering 1659/1661 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 524/526 places, 1659/1661 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 498721 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 498721 steps, saw 68127 distinct states, run finished after 3002 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1659 rows 524 cols
[2023-03-09 15:17:53] [INFO ] Computed 22 place invariants in 23 ms
[2023-03-09 15:17:53] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:17:53] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-09 15:17:53] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:17:53] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:17:54] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:54] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2023-03-09 15:17:54] [INFO ] After 185ms SMT Verify possible using 1577 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:54] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-09 15:17:54] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 33 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 524/524 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 29 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-09 15:17:54] [INFO ] Invariant cache hit.
[2023-03-09 15:17:55] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-09 15:17:55] [INFO ] Invariant cache hit.
[2023-03-09 15:17:55] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2023-03-09 15:17:58] [INFO ] Implicit Places using invariants and state equation in 3842 ms returned []
Implicit Place search using SMT with State Equation took 4289 ms to find 0 implicit places.
[2023-03-09 15:17:58] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-09 15:17:58] [INFO ] Invariant cache hit.
[2023-03-09 15:17:59] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5060 ms. Remains : 524/524 places, 1659/1659 transitions.
Graph (trivial) has 1519 edges and 524 vertex of which 418 / 524 are part of one of the 2 SCC in 1 ms
Free SCC test removed 416 places
Drop transitions removed 1084 transitions
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 1492 transitions.
Graph (complete) has 291 edges and 108 vertex of which 50 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 50 transition count 91
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 16 transition count 40
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 16 transition count 40
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 16 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 15 transition count 22
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 150 place count 14 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 14 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 6 ms. Remains 10 /524 variables (removed 514) and now considering 15/1659 (removed 1644) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2023-03-09 15:17:59] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 15:17:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-09 15:17:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 15:17:59] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:17:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 15:17:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 15:17:59] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:17:59] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 15:17:59] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 95 ms :[true, p0, p0]
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 14 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2023-03-09 15:18:00] [INFO ] Computed 22 place invariants in 26 ms
[2023-03-09 15:18:00] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-09 15:18:00] [INFO ] Invariant cache hit.
[2023-03-09 15:18:00] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:18:02] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 2021 ms to find 0 implicit places.
[2023-03-09 15:18:02] [INFO ] Invariant cache hit.
[2023-03-09 15:18:02] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2576 ms. Remains : 526/526 places, 1661/1661 transitions.
Computed a total of 60 stabilizing places and 99 stable transitions
Computed a total of 60 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 530811 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 530811 steps, saw 75056 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 15:18:06] [INFO ] Invariant cache hit.
[2023-03-09 15:18:06] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-09 15:18:06] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-09 15:18:06] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:18:06] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:18:06] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:06] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:18:07] [INFO ] After 212ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:07] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-09 15:18:07] [INFO ] After 889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1659
Partial Free-agglomeration rule applied 421 times.
Drop transitions removed 421 transitions
Iterating global reduction 1 with 421 rules applied. Total rules applied 425 place count 524 transition count 1659
Applied a total of 425 rules in 91 ms. Remains 524 /526 variables (removed 2) and now considering 1659/1661 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 524/526 places, 1659/1661 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 441749 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :{}
Probabilistic random walk after 441749 steps, saw 61494 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1659 rows 524 cols
[2023-03-09 15:18:10] [INFO ] Computed 22 place invariants in 23 ms
[2023-03-09 15:18:10] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:18:10] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-09 15:18:11] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:18:11] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:18:11] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:11] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2023-03-09 15:18:11] [INFO ] After 283ms SMT Verify possible using 1577 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:11] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-09 15:18:11] [INFO ] After 938ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 50 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 524/524 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 34 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-09 15:18:12] [INFO ] Invariant cache hit.
[2023-03-09 15:18:12] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-09 15:18:12] [INFO ] Invariant cache hit.
[2023-03-09 15:18:12] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2023-03-09 15:18:16] [INFO ] Implicit Places using invariants and state equation in 3989 ms returned []
Implicit Place search using SMT with State Equation took 4445 ms to find 0 implicit places.
[2023-03-09 15:18:16] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-09 15:18:16] [INFO ] Invariant cache hit.
[2023-03-09 15:18:17] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5137 ms. Remains : 524/524 places, 1659/1659 transitions.
Graph (trivial) has 1519 edges and 524 vertex of which 418 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 416 places
Drop transitions removed 1084 transitions
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 1492 transitions.
Graph (complete) has 291 edges and 108 vertex of which 50 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 50 transition count 91
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 16 transition count 40
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 16 transition count 40
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 16 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 15 transition count 22
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 150 place count 14 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 14 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 5 ms. Remains 10 /524 variables (removed 514) and now considering 15/1659 (removed 1644) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2023-03-09 15:18:17] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 15:18:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 15:18:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-09 15:18:17] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 15:18:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-09 15:18:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-09 15:18:17] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 15:18:17] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 15:18:17] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 58 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 116 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 128 ms :[true, p0, p0]
Product exploration explored 100000 steps with 951 reset in 557 ms.
Product exploration explored 100000 steps with 944 reset in 460 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[true, p0, p0]
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 35 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2023-03-09 15:18:18] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1661 rows 526 cols
[2023-03-09 15:18:18] [INFO ] Computed 22 place invariants in 27 ms
[2023-03-09 15:18:19] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 826 ms. Remains : 526/526 places, 1661/1661 transitions.
Built C files in :
/tmp/ltsmin2397806166778613629
[2023-03-09 15:18:19] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2397806166778613629
Running compilation step : cd /tmp/ltsmin2397806166778613629;'/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 2831 ms.
Running link step : cd /tmp/ltsmin2397806166778613629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin2397806166778613629;'/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/stateBased1217800149219517286.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 9 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2023-03-09 15:18:34] [INFO ] Invariant cache hit.
[2023-03-09 15:18:35] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-09 15:18:35] [INFO ] Invariant cache hit.
[2023-03-09 15:18:35] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:18:36] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2023-03-09 15:18:36] [INFO ] Invariant cache hit.
[2023-03-09 15:18:37] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2552 ms. Remains : 526/526 places, 1661/1661 transitions.
Built C files in :
/tmp/ltsmin5742549857607952508
[2023-03-09 15:18:37] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5742549857607952508
Running compilation step : cd /tmp/ltsmin5742549857607952508;'/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 2815 ms.
Running link step : cd /tmp/ltsmin5742549857607952508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin5742549857607952508;'/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/stateBased6686078030464196033.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 15:18:52] [INFO ] Flatten gal took : 29 ms
[2023-03-09 15:18:52] [INFO ] Flatten gal took : 26 ms
[2023-03-09 15:18:52] [INFO ] Time to serialize gal into /tmp/LTL4075083378213979282.gal : 5 ms
[2023-03-09 15:18:52] [INFO ] Time to serialize properties into /tmp/LTL4159007051729483246.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4075083378213979282.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2537632070075023613.hoa' '-atoms' '/tmp/LTL4159007051729483246.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4159007051729483246.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2537632070075023613.hoa
Detected timeout of ITS tools.
[2023-03-09 15:19:07] [INFO ] Flatten gal took : 24 ms
[2023-03-09 15:19:07] [INFO ] Flatten gal took : 27 ms
[2023-03-09 15:19:07] [INFO ] Time to serialize gal into /tmp/LTL10363420618326530150.gal : 5 ms
[2023-03-09 15:19:07] [INFO ] Time to serialize properties into /tmp/LTL18256525455811909787.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/LTL10363420618326530150.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18256525455811909787.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G("((Node17OKshare<3)&&(Node0DHTinfo2<3))"))))
Formula 0 simplified : XF!"((Node17OKshare<3)&&(Node0DHTinfo2<3))"
Detected timeout of ITS tools.
[2023-03-09 15:19:22] [INFO ] Flatten gal took : 57 ms
[2023-03-09 15:19:22] [INFO ] Applying decomposition
[2023-03-09 15:19:22] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8116032473655474729.txt' '-o' '/tmp/graph8116032473655474729.bin' '-w' '/tmp/graph8116032473655474729.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8116032473655474729.bin' '-l' '-1' '-v' '-w' '/tmp/graph8116032473655474729.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:19:22] [INFO ] Decomposing Gal with order
[2023-03-09 15:19:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:19:23] [INFO ] Removed a total of 1206 redundant transitions.
[2023-03-09 15:19:23] [INFO ] Flatten gal took : 101 ms
[2023-03-09 15:19:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 800 labels/synchronizations in 28 ms.
[2023-03-09 15:19:23] [INFO ] Time to serialize gal into /tmp/LTL4016978148936063480.gal : 11 ms
[2023-03-09 15:19:23] [INFO ] Time to serialize properties into /tmp/LTL18223008422614485956.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/LTL4016978148936063480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18223008422614485956.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(G("((u19.Node17OKshare<3)&&(i1.u2.Node0DHTinfo2<3))"))))
Formula 0 simplified : XF!"((u19.Node17OKshare<3)&&(i1.u2.Node0DHTinfo2<3))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13452754286740865889
[2023-03-09 15:19:38] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13452754286740865889
Running compilation step : cd /tmp/ltsmin13452754286740865889;'/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 2865 ms.
Running link step : cd /tmp/ltsmin13452754286740865889;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin13452754286740865889;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-02 finished in 131782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(G(p2))&&(p0 U (p1||G(p0)))))))'
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))||G((G(F(p1)) U p2))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-020-LTLCardinality-11
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) (NOT p2)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1043 transition count 2383
Reduce places removed 137 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 138 rules applied. Total rules applied 275 place count 906 transition count 2382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 3 with 341 rules applied. Total rules applied 1375 place count 526 transition count 1662
Applied a total of 1375 rules in 123 ms. Remains 526 /1043 variables (removed 517) and now considering 1662/2520 (removed 858) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2023-03-09 15:19:54] [INFO ] Computed 22 place invariants in 23 ms
[2023-03-09 15:19:54] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-09 15:19:54] [INFO ] Invariant cache hit.
[2023-03-09 15:19:54] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:19:56] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 2093 ms to find 0 implicit places.
[2023-03-09 15:19:56] [INFO ] Invariant cache hit.
[2023-03-09 15:19:56] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 526/1043 places, 1662/2520 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2836 ms. Remains : 526/1043 places, 1662/2520 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s210), p0:(GT 3 s428), p1:(GT 1 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33447 reset in 786 ms.
Product exploration explored 100000 steps with 33344 reset in 572 ms.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Detected a total of 65/526 stabilizing places and 102/1662 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 18 factoid took 1288 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 15:20:00] [INFO ] Invariant cache hit.
[2023-03-09 15:20:00] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:20:00] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:20:00] [INFO ] After 504ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2023-03-09 15:20:00] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:20:01] [INFO ] After 182ms SMT Verify possible using 1177 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-09 15:20:01] [INFO ] After 851ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-09 15:20:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:20:01] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-09 15:20:01] [INFO ] After 465ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-09 15:20:01] [INFO ] After 329ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-09 15:20:02] [INFO ] After 511ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-09 15:20:02] [INFO ] After 1289ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 5 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 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 526 transition count 1660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 426 place count 523 transition count 1659
Applied a total of 426 rules in 101 ms. Remains 523 /526 variables (removed 3) and now considering 1659/1662 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 523/526 places, 1659/1662 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 455960 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 455960 steps, saw 58965 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1659 rows 523 cols
[2023-03-09 15:20:05] [INFO ] Computed 22 place invariants in 27 ms
[2023-03-09 15:20:05] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-09 15:20:05] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-09 15:20:06] [INFO ] After 412ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 15:20:06] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-09 15:20:06] [INFO ] After 285ms SMT Verify possible using 1596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:20:06] [INFO ] After 849ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:20:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:20:06] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-09 15:20:07] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:20:07] [INFO ] After 290ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 15:20:07] [INFO ] After 487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-09 15:20:07] [INFO ] After 1231ms 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 4 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 38 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 34 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-09 15:20:07] [INFO ] Invariant cache hit.
[2023-03-09 15:20:08] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-09 15:20:08] [INFO ] Invariant cache hit.
[2023-03-09 15:20:08] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-09 15:20:12] [INFO ] Implicit Places using invariants and state equation in 3894 ms returned []
Implicit Place search using SMT with State Equation took 4348 ms to find 0 implicit places.
[2023-03-09 15:20:12] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-09 15:20:12] [INFO ] Invariant cache hit.
[2023-03-09 15:20:12] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5080 ms. Remains : 523/523 places, 1659/1659 transitions.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 1 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 5 transition count 8
Applied a total of 87 rules in 5 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-09 15:20:12] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 15:20:12] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:20:12] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:20:12] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-09 15:20:12] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F p2)]
Knowledge based reduction with 19 factoid took 1407 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 364 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 18 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2023-03-09 15:20:15] [INFO ] Computed 22 place invariants in 21 ms
[2023-03-09 15:20:15] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-09 15:20:15] [INFO ] Invariant cache hit.
[2023-03-09 15:20:15] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:20:17] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
[2023-03-09 15:20:17] [INFO ] Invariant cache hit.
[2023-03-09 15:20:17] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2685 ms. Remains : 526/526 places, 1662/1662 transitions.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Detected a total of 65/526 stabilizing places and 102/1662 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 620 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 5 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 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 15:20:18] [INFO ] Invariant cache hit.
[2023-03-09 15:20:19] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:20:19] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:20:19] [INFO ] After 503ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 15:20:19] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:20:19] [INFO ] After 238ms SMT Verify possible using 1177 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:20:19] [INFO ] After 872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:20:19] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-09 15:20:19] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 15:20:20] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:20:20] [INFO ] After 321ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 15:20:20] [INFO ] After 470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-09 15:20:20] [INFO ] After 1153ms 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 4 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 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 526 transition count 1660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 426 place count 523 transition count 1659
Applied a total of 426 rules in 122 ms. Remains 523 /526 variables (removed 3) and now considering 1659/1662 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 523/526 places, 1659/1662 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 431579 steps, run timeout after 3007 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 431579 steps, saw 56249 distinct states, run finished after 3007 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1659 rows 523 cols
[2023-03-09 15:20:24] [INFO ] Computed 22 place invariants in 27 ms
[2023-03-09 15:20:24] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:20:24] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-09 15:20:24] [INFO ] After 401ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-09 15:20:24] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-09 15:20:25] [INFO ] After 328ms SMT Verify possible using 1596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:20:25] [INFO ] After 875ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:20:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-09 15:20:25] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-09 15:20:25] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:20:26] [INFO ] After 318ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 15:20:26] [INFO ] After 487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-09 15:20:26] [INFO ] After 1218ms 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 3 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 39 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 31 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-09 15:20:26] [INFO ] Invariant cache hit.
[2023-03-09 15:20:26] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-09 15:20:26] [INFO ] Invariant cache hit.
[2023-03-09 15:20:27] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-09 15:20:31] [INFO ] Implicit Places using invariants and state equation in 4402 ms returned []
Implicit Place search using SMT with State Equation took 4839 ms to find 0 implicit places.
[2023-03-09 15:20:31] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-09 15:20:31] [INFO ] Invariant cache hit.
[2023-03-09 15:20:32] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5515 ms. Remains : 523/523 places, 1659/1659 transitions.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 1 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 5 transition count 8
Applied a total of 87 rules in 3 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-09 15:20:32] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 15:20:32] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 15:20:32] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 15:20:32] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 15:20:32] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 655 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 330 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 301 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 959 reset in 589 ms.
Product exploration explored 100000 steps with 968 reset in 522 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 351 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 26 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2023-03-09 15:20:35] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1662 rows 526 cols
[2023-03-09 15:20:35] [INFO ] Computed 22 place invariants in 24 ms
[2023-03-09 15:20:35] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 674 ms. Remains : 526/526 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin14909123006343102376
[2023-03-09 15:20:35] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14909123006343102376
Running compilation step : cd /tmp/ltsmin14909123006343102376;'/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 2994 ms.
Running link step : cd /tmp/ltsmin14909123006343102376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14909123006343102376;'/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/stateBased11623120785023809760.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 19 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2023-03-09 15:20:51] [INFO ] Invariant cache hit.
[2023-03-09 15:20:51] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-09 15:20:51] [INFO ] Invariant cache hit.
[2023-03-09 15:20:51] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-09 15:20:52] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
[2023-03-09 15:20:52] [INFO ] Invariant cache hit.
[2023-03-09 15:20:53] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2453 ms. Remains : 526/526 places, 1662/1662 transitions.
Built C files in :
/tmp/ltsmin544743323448595751
[2023-03-09 15:20:53] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin544743323448595751
Running compilation step : cd /tmp/ltsmin544743323448595751;'/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 2933 ms.
Running link step : cd /tmp/ltsmin544743323448595751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin544743323448595751;'/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/stateBased7028635599030237703.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 15:21:08] [INFO ] Flatten gal took : 47 ms
[2023-03-09 15:21:08] [INFO ] Flatten gal took : 47 ms
[2023-03-09 15:21:08] [INFO ] Time to serialize gal into /tmp/LTL2666905752994712893.gal : 12 ms
[2023-03-09 15:21:08] [INFO ] Time to serialize properties into /tmp/LTL17999126379877585402.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/LTL2666905752994712893.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5547940891014987286.hoa' '-atoms' '/tmp/LTL17999126379877585402.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/LTL17999126379877585402.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5547940891014987286.hoa
Detected timeout of ITS tools.
[2023-03-09 15:21:23] [INFO ] Flatten gal took : 44 ms
[2023-03-09 15:21:23] [INFO ] Flatten gal took : 37 ms
[2023-03-09 15:21:23] [INFO ] Time to serialize gal into /tmp/LTL16897966583178916874.gal : 6 ms
[2023-03-09 15:21:23] [INFO ] Time to serialize properties into /tmp/LTL7907056944742761570.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16897966583178916874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7907056944742761570.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(G("(Node15requestsent2<3)")))||(G((G(F("(Node2ID<1)")))U("(Node4GiveAnswer5>=1)")))))
Formula 0 simplified : XF!"(Node15requestsent2<3)" & F(FG!"(Node2ID<1)" R !"(Node4GiveAnswer5>=1)")
Detected timeout of ITS tools.
[2023-03-09 15:21:39] [INFO ] Flatten gal took : 26 ms
[2023-03-09 15:21:39] [INFO ] Applying decomposition
[2023-03-09 15:21:39] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4845840638927796679.txt' '-o' '/tmp/graph4845840638927796679.bin' '-w' '/tmp/graph4845840638927796679.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4845840638927796679.bin' '-l' '-1' '-v' '-w' '/tmp/graph4845840638927796679.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:21:39] [INFO ] Decomposing Gal with order
[2023-03-09 15:21:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:21:39] [INFO ] Removed a total of 1209 redundant transitions.
[2023-03-09 15:21:39] [INFO ] Flatten gal took : 69 ms
[2023-03-09 15:21:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 761 labels/synchronizations in 16 ms.
[2023-03-09 15:21:39] [INFO ] Time to serialize gal into /tmp/LTL15367177259476113357.gal : 7 ms
[2023-03-09 15:21:39] [INFO ] Time to serialize properties into /tmp/LTL13377016525291545471.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/LTL15367177259476113357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13377016525291545471.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(G("(u17.Node15requestsent2<3)")))||(G((G(F("(i2.u3.Node2ID<1)")))U("(u7.Node4GiveAnswer5>=1)")))))
Formula 0 simplified : XF!"(u17.Node15requestsent2<3)" & F(FG!"(i2.u3.Node2ID<1)" R !"(u7.Node4GiveAnswer5>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6159573702823653289
[2023-03-09 15:21:54] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6159573702823653289
Running compilation step : cd /tmp/ltsmin6159573702823653289;'/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 2842 ms.
Running link step : cd /tmp/ltsmin6159573702823653289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin6159573702823653289;'/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 (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-11 finished in 135893 ms.
[2023-03-09 15:22:09] [INFO ] Flatten gal took : 80 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2951398858113224997
[2023-03-09 15:22:09] [INFO ] Too many transitions (2520) to apply POR reductions. Disabling POR matrices.
[2023-03-09 15:22:09] [INFO ] Applying decomposition
[2023-03-09 15:22:09] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2951398858113224997
Running compilation step : cd /tmp/ltsmin2951398858113224997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' '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-09 15:22:09] [INFO ] Flatten gal took : 53 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/graph3230748402867531920.txt' '-o' '/tmp/graph3230748402867531920.bin' '-w' '/tmp/graph3230748402867531920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3230748402867531920.bin' '-l' '-1' '-v' '-w' '/tmp/graph3230748402867531920.weights' '-q' '0' '-e' '0.001'
[2023-03-09 15:22:09] [INFO ] Decomposing Gal with order
[2023-03-09 15:22:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 15:22:09] [INFO ] Removed a total of 1215 redundant transitions.
[2023-03-09 15:22:09] [INFO ] Flatten gal took : 105 ms
[2023-03-09 15:22:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 724 labels/synchronizations in 21 ms.
[2023-03-09 15:22:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality5536231096580646788.gal : 9 ms
[2023-03-09 15:22:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality12128030804894426714.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/LTLCardinality5536231096580646788.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12128030804894426714.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 4 LTL properties
Checking formula 0 : !((X(G(!("((gi0.gi1.gu67.Node17OKshare>=3)||(gi0.gi0.gu1.Node0DHTinfo2>=3))")))))
Formula 0 simplified : XF"((gi0.gi1.gu67.Node17OKshare>=3)||(gi0.gi0.gu1.Node0DHTinfo2>=3))"
Compilation finished in 4848 ms.
Running link step : cd /tmp/ltsmin2951398858113224997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin2951398858113224997;'/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)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2951398858113224997;'/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)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2951398858113224997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp1==true))||[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 15:46:39] [INFO ] Flatten gal took : 84 ms
[2023-03-09 15:46:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality10976844426984014688.gal : 6 ms
[2023-03-09 15:46:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality2339721469374834745.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/LTLCardinality10976844426984014688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2339721469374834745.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 4 LTL properties
Checking formula 0 : !((X(G(!("((Node17OKshare>=3)||(Node0DHTinfo2>=3))")))))
Formula 0 simplified : XF"((Node17OKshare>=3)||(Node0DHTinfo2>=3))"
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2951398858113224997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp1==true))||[](<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2951398858113224997;'/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' '(((LTLAPp3==true) U ([]((LTLAPp3==true))||(LTLAPp4==true))) U ([](((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))||(X([]((LTLAPp5==true)))&&((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2951398858113224997;'/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' '(((LTLAPp3==true) U ([]((LTLAPp3==true))||(LTLAPp4==true))) U ([](((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))||(X([]((LTLAPp5==true)))&&((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2951398858113224997;'/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([]((LTLAPp6==true)))||[](([](<>((LTLAPp7==true))) U (LTLAPp8==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 1106340 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16031608 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-020"
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 CANInsertWithFailure-PT-020, 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 r037-tajo-167813690700715"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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