Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716228475146

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-20 18:07:56] [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]
[2024-05-20 18:07:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 18:07:57] [INFO ] Load time of PNML (sax parser for PT used): 354 ms
[2024-05-20 18:07:57] [INFO ] Transformed 3684 places.
[2024-05-20 18:07:57] [INFO ] Transformed 9840 transitions.
[2024-05-20 18:07:57] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 467 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 628 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:07:58] [INFO ] Computed 42 invariants in 544 ms
[2024-05-20 18:07:59] [INFO ] Implicit Places using invariants in 1711 ms returned []
[2024-05-20 18:07:59] [INFO ] Invariant cache hit.
[2024-05-20 18:08:01] [INFO ] Implicit Places using invariants and state equation in 2077 ms returned []
Implicit Place search using SMT with State Equation took 3818 ms to find 0 implicit places.
[2024-05-20 18:08:01] [INFO ] Invariant cache hit.
[2024-05-20 18:08:06] [INFO ] Dead Transitions using invariants and state equation in 4681 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9136 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 48 out of 3683 places after structural reductions.
[2024-05-20 18:08:07] [INFO ] Flatten gal took : 398 ms
[2024-05-20 18:08:07] [INFO ] Flatten gal took : 243 ms
[2024-05-20 18:08:07] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 47 out of 3683 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 29) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) 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 7 ms. (steps per millisecond=143 ) properties (out of 16) 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 16) 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 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 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 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 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 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 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 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2024-05-20 18:08:08] [INFO ] Invariant cache hit.
[2024-05-20 18:08:10] [INFO ] After 1311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-20 18:08:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 34 ms returned sat
[2024-05-20 18:08:11] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 41 ms returned sat
[2024-05-20 18:08:21] [INFO ] After 9989ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :14
[2024-05-20 18:08:21] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 18:08:35] [INFO ] After 13126ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :2 sat :14
[2024-05-20 18:08:35] [INFO ] After 13127ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :14
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-20 18:08:35] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :14
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 5 properties in 334 ms.
Support contains 17 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 3404 transition count 9560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1476 Post agglomeration using F-continuation condition.Transition count delta: 1476
Deduced a syphon composed of 1476 places in 20 ms
Reduce places removed 1476 places and 0 transitions.
Iterating global reduction 3 with 2952 rules applied. Total rules applied 3512 place count 1927 transition count 8084
Drop transitions removed 1400 transitions
Redundant transition composition rules discarded 1400 transitions
Iterating global reduction 3 with 1400 rules applied. Total rules applied 4912 place count 1927 transition count 6684
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4914 place count 1927 transition count 6682
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4916 place count 1925 transition count 6682
Partial Free-agglomeration rule applied 1706 times.
Drop transitions removed 1706 transitions
Iterating global reduction 4 with 1706 rules applied. Total rules applied 6622 place count 1925 transition count 6682
Applied a total of 6622 rules in 1856 ms. Remains 1925 /3683 variables (removed 1758) and now considering 6682/9840 (removed 3158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1860 ms. Remains : 1925/3683 places, 6682/9840 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 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 2 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 2 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 2 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 2 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 2 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 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 6682 rows 1925 cols
[2024-05-20 18:08:37] [INFO ] Computed 42 invariants in 202 ms
[2024-05-20 18:08:38] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:08:38] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 27 ms returned sat
[2024-05-20 18:08:38] [INFO ] After 521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-20 18:08:38] [INFO ] [Nat]Absence check using 40 positive place invariants in 24 ms returned sat
[2024-05-20 18:08:38] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:08:42] [INFO ] After 2919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-20 18:08:42] [INFO ] State equation strengthened by 6340 read => feed constraints.
[2024-05-20 18:08:45] [INFO ] After 3252ms SMT Verify possible using 6340 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-20 18:08:47] [INFO ] After 5780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1521 ms.
[2024-05-20 18:08:49] [INFO ] After 10965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 1 properties in 64 ms.
Support contains 11 out of 1925 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1925/1925 places, 6682/6682 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1922 transition count 6679
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 1922 transition count 6679
Applied a total of 10 rules in 449 ms. Remains 1922 /1925 variables (removed 3) and now considering 6679/6682 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 449 ms. Remains : 1922/1925 places, 6679/6682 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 102670 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102670 steps, saw 31686 distinct states, run finished after 3005 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 6679 rows 1922 cols
[2024-05-20 18:08:53] [INFO ] Computed 42 invariants in 169 ms
[2024-05-20 18:08:53] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:08:53] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:08:54] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:08:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 27 ms returned sat
[2024-05-20 18:08:54] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-20 18:08:58] [INFO ] After 3601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:08:58] [INFO ] State equation strengthened by 6349 read => feed constraints.
[2024-05-20 18:09:01] [INFO ] After 3426ms SMT Verify possible using 6349 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 18:09:03] [INFO ] After 5402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1286 ms.
[2024-05-20 18:09:04] [INFO ] After 10973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 126 ms.
Support contains 11 out of 1922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1922/1922 places, 6679/6679 transitions.
Applied a total of 0 rules in 163 ms. Remains 1922 /1922 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 1922/1922 places, 6679/6679 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1922/1922 places, 6679/6679 transitions.
Applied a total of 0 rules in 164 ms. Remains 1922 /1922 variables (removed 0) and now considering 6679/6679 (removed 0) transitions.
[2024-05-20 18:09:05] [INFO ] Invariant cache hit.
[2024-05-20 18:09:07] [INFO ] Implicit Places using invariants in 2081 ms returned []
[2024-05-20 18:09:07] [INFO ] Invariant cache hit.
[2024-05-20 18:09:08] [INFO ] State equation strengthened by 6349 read => feed constraints.
[2024-05-20 18:09:08] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 3429 ms to find 0 implicit places.
[2024-05-20 18:09:09] [INFO ] Redundant transitions in 659 ms returned []
[2024-05-20 18:09:09] [INFO ] Invariant cache hit.
[2024-05-20 18:09:12] [INFO ] Dead Transitions using invariants and state equation in 2984 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7280 ms. Remains : 1922/1922 places, 6679/6679 transitions.
Graph (trivial) has 6208 edges and 1922 vertex of which 1669 / 1922 are part of one of the 2 SCC in 7 ms
Free SCC test removed 1667 places
Drop transitions removed 4620 transitions
Ensure Unique test removed 1588 transitions
Reduce isomorphic transitions removed 6208 transitions.
Graph (complete) has 752 edges and 255 vertex of which 135 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.1 ms
Discarding 120 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Iterating post reduction 0 with 156 rules applied. Total rules applied 158 place count 135 transition count 277
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 233 place count 60 transition count 165
Iterating global reduction 1 with 75 rules applied. Total rules applied 308 place count 60 transition count 165
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 345 place count 23 transition count 91
Iterating global reduction 1 with 37 rules applied. Total rules applied 382 place count 23 transition count 91
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 419 place count 23 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 423 place count 21 transition count 53
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 429 place count 21 transition count 47
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 430 place count 21 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 431 place count 20 transition count 46
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 432 place count 19 transition count 45
Iterating global reduction 4 with 1 rules applied. Total rules applied 433 place count 19 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 435 place count 18 transition count 44
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 437 place count 18 transition count 42
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 440 place count 16 transition count 41
Applied a total of 440 rules in 66 ms. Remains 16 /1922 variables (removed 1906) and now considering 41/6679 (removed 6638) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 41 rows 16 cols
[2024-05-20 18:09:12] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 18:09:12] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:09:12] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:09:12] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-20 18:09:12] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 162 stabilizing places and 280 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 7 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1382 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-20 18:09:14] [INFO ] Computed 42 invariants in 151 ms
[2024-05-20 18:09:15] [INFO ] Implicit Places using invariants in 1328 ms returned []
[2024-05-20 18:09:15] [INFO ] Invariant cache hit.
[2024-05-20 18:09:16] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:09:19] [INFO ] Implicit Places using invariants and state equation in 3679 ms returned []
Implicit Place search using SMT with State Equation took 5013 ms to find 0 implicit places.
[2024-05-20 18:09:20] [INFO ] Redundant transitions in 468 ms returned []
[2024-05-20 18:09:20] [INFO ] Invariant cache hit.
[2024-05-20 18:09:22] [INFO ] Dead Transitions using invariants and state equation in 2869 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9750 ms. Remains : 1844/3683 places, 6520/9840 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s1064), p1:(LEQ s864 s813)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 184 steps with 0 reset in 22 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-00 finished in 10225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p1||(p2&&X(X(p3)))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 290 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:09:24] [INFO ] Computed 42 invariants in 441 ms
[2024-05-20 18:09:26] [INFO ] Implicit Places using invariants in 2430 ms returned []
[2024-05-20 18:09:26] [INFO ] Invariant cache hit.
[2024-05-20 18:09:29] [INFO ] Implicit Places using invariants and state equation in 3253 ms returned []
Implicit Place search using SMT with State Equation took 5706 ms to find 0 implicit places.
[2024-05-20 18:09:29] [INFO ] Invariant cache hit.
[2024-05-20 18:09:34] [INFO ] Dead Transitions using invariants and state equation in 5343 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11348 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p3), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}]], initial=0, aps=[p1:(AND (LEQ s2891 s2502) (LEQ s3381 s3509)), p2:(LEQ s3381 s3509), p0:(LEQ s2891 s2502), p3:(GT 3 s1655)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33336 reset in 2440 ms.
Product exploration explored 100000 steps with 33322 reset in 2256 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 134 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 66133 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 66133 steps, saw 46410 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :2
Running SMT prover for 3 properties.
[2024-05-20 18:09:43] [INFO ] Invariant cache hit.
[2024-05-20 18:09:43] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 18:09:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 32 ms returned sat
[2024-05-20 18:09:44] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 39 ms returned sat
[2024-05-20 18:09:49] [INFO ] After 4885ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 18:09:49] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 18:10:05] [INFO ] After 15630ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 18:10:06] [INFO ] After 17121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 745 ms.
[2024-05-20 18:10:07] [INFO ] After 23456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 2 properties in 68 ms.
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 3 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 2 with 3120 rules applied. Total rules applied 3680 place count 1843 transition count 8000
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 2 with 1482 rules applied. Total rules applied 5162 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5163 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5164 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1640 times.
Drop transitions removed 1640 transitions
Iterating global reduction 3 with 1640 rules applied. Total rules applied 6804 place count 1842 transition count 6517
Applied a total of 6804 rules in 1535 ms. Remains 1842 /3683 variables (removed 1841) and now considering 6517/9840 (removed 3323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1537 ms. Remains : 1842/3683 places, 6517/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 106610 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106610 steps, saw 28326 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6517 rows 1842 cols
[2024-05-20 18:10:12] [INFO ] Computed 42 invariants in 184 ms
[2024-05-20 18:10:12] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:10:12] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:10:14] [INFO ] After 1800ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 18:10:14] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2024-05-20 18:10:15] [INFO ] After 1405ms SMT Verify possible using 6397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:10:15] [INFO ] After 3534ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:10:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2024-05-20 18:10:16] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:10:17] [INFO ] After 1747ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:10:19] [INFO ] After 1324ms SMT Verify possible using 6397 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:10:19] [INFO ] After 1578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 171 ms.
[2024-05-20 18:10:19] [INFO ] After 3775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 212 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 213 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2024-05-20 18:10:20] [INFO ] Invariant cache hit.
[2024-05-20 18:10:21] [INFO ] Implicit Places using invariants in 1924 ms returned []
[2024-05-20 18:10:21] [INFO ] Invariant cache hit.
[2024-05-20 18:10:22] [INFO ] State equation strengthened by 6397 read => feed constraints.
[2024-05-20 18:10:33] [INFO ] Implicit Places using invariants and state equation in 11818 ms returned []
Implicit Place search using SMT with State Equation took 13758 ms to find 0 implicit places.
[2024-05-20 18:10:34] [INFO ] Redundant transitions in 614 ms returned []
[2024-05-20 18:10:34] [INFO ] Invariant cache hit.
[2024-05-20 18:10:37] [INFO ] Dead Transitions using invariants and state equation in 2960 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17561 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Graph (trivial) has 6274 edges and 1842 vertex of which 1678 / 1842 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1676 places
Drop transitions removed 4716 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6348 transitions.
Graph (complete) has 411 edges and 166 vertex of which 45 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 45 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 44 transition count 48
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 6 transition count 10
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 6 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 6 transition count 7
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 166 place count 5 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 4 transition count 5
Applied a total of 167 rules in 14 ms. Remains 4 /1842 variables (removed 1838) and now considering 5/6517 (removed 6512) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 4 cols
[2024-05-20 18:10:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 18:10:37] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:10:37] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:10:37] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 18:10:37] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p2 p0 p3), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X p3))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (F (NOT (OR p1 p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))
Knowledge based reduction with 11 factoid took 128 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-01 finished in 74195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(G(p1))||F((!p0&&X((F(p2)||G(!p0))))))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 232 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:10:38] [INFO ] Computed 42 invariants in 383 ms
[2024-05-20 18:10:40] [INFO ] Implicit Places using invariants in 2378 ms returned []
[2024-05-20 18:10:40] [INFO ] Invariant cache hit.
[2024-05-20 18:10:43] [INFO ] Implicit Places using invariants and state equation in 3077 ms returned []
Implicit Place search using SMT with State Equation took 5456 ms to find 0 implicit places.
[2024-05-20 18:10:43] [INFO ] Invariant cache hit.
[2024-05-20 18:10:48] [INFO ] Dead Transitions using invariants and state equation in 5335 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11033 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ s3259 s2487), p1:(GT 1 s1072), p2:(GT s3014 s2936)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 102 reset in 777 ms.
Product exploration explored 100000 steps with 104 reset in 896 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1 (NOT p2))), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 211 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-20 18:10:51] [INFO ] Invariant cache hit.
[2024-05-20 18:10:51] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2024-05-20 18:10:51] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-20 18:10:56] [INFO ] After 5666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 18:10:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 38 ms returned sat
[2024-05-20 18:10:57] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 44 ms returned sat
[2024-05-20 18:11:05] [INFO ] After 7861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 18:11:05] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 18:11:11] [INFO ] After 6002ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-20 18:11:13] [INFO ] After 7811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1043 ms.
[2024-05-20 18:11:14] [INFO ] After 17579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 2 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 2 with 3114 rules applied. Total rules applied 3674 place count 1846 transition count 8003
Drop transitions removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 2 with 1479 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5154 place count 1846 transition count 6523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5155 place count 1845 transition count 6523
Partial Free-agglomeration rule applied 1639 times.
Drop transitions removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 6794 place count 1845 transition count 6523
Applied a total of 6794 rules in 1338 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6523/9840 (removed 3317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1338 ms. Remains : 1845/3683 places, 6523/9840 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6523 rows 1845 cols
[2024-05-20 18:11:16] [INFO ] Computed 42 invariants in 165 ms
[2024-05-20 18:11:16] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:11:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:11:16] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:11:18] [INFO ] After 2112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:11:18] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 18:11:20] [INFO ] After 1205ms SMT Verify possible using 6393 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:11:20] [INFO ] After 1464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 248 ms.
[2024-05-20 18:11:20] [INFO ] After 4171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 189 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 104033 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104033 steps, saw 28027 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 18:11:23] [INFO ] Invariant cache hit.
[2024-05-20 18:11:24] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:11:24] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2024-05-20 18:11:24] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:11:26] [INFO ] After 1989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:11:26] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 18:11:27] [INFO ] After 1214ms SMT Verify possible using 6393 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:11:27] [INFO ] After 1511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 174 ms.
[2024-05-20 18:11:28] [INFO ] After 4008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 202 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 204 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
[2024-05-20 18:11:28] [INFO ] Invariant cache hit.
[2024-05-20 18:11:30] [INFO ] Implicit Places using invariants in 1832 ms returned []
[2024-05-20 18:11:30] [INFO ] Invariant cache hit.
[2024-05-20 18:11:31] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 18:11:43] [INFO ] Implicit Places using invariants and state equation in 13485 ms returned []
Implicit Place search using SMT with State Equation took 15319 ms to find 0 implicit places.
[2024-05-20 18:11:44] [INFO ] Redundant transitions in 560 ms returned []
[2024-05-20 18:11:44] [INFO ] Invariant cache hit.
[2024-05-20 18:11:47] [INFO ] Dead Transitions using invariants and state equation in 2721 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18821 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Graph (trivial) has 6264 edges and 1845 vertex of which 1677 / 1845 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1675 places
Drop transitions removed 4710 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6342 transitions.
Graph (complete) has 423 edges and 170 vertex of which 49 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 49 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 48 transition count 60
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 10 transition count 22
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 place count 10 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 10 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 10 transition count 19
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 166 place count 9 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 8 transition count 17
Applied a total of 167 rules in 11 ms. Remains 8 /1845 variables (removed 1837) and now considering 17/6523 (removed 6506) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 17 rows 8 cols
[2024-05-20 18:11:47] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 18:11:47] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:11:47] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:11:47] [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 2 ms.
[2024-05-20 18:11:47] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1 (NOT p2))), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 17 factoid took 507 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 248 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:11:48] [INFO ] Computed 42 invariants in 423 ms
[2024-05-20 18:11:49] [INFO ] Implicit Places using invariants in 1238 ms returned []
[2024-05-20 18:11:49] [INFO ] Invariant cache hit.
[2024-05-20 18:11:51] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 3118 ms to find 0 implicit places.
[2024-05-20 18:11:51] [INFO ] Invariant cache hit.
[2024-05-20 18:11:57] [INFO ] Dead Transitions using invariants and state equation in 5853 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9221 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 159 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-20 18:11:58] [INFO ] Invariant cache hit.
[2024-05-20 18:11:58] [INFO ] [Real]Absence check using 40 positive place invariants in 34 ms returned sat
[2024-05-20 18:11:58] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 41 ms returned sat
[2024-05-20 18:12:03] [INFO ] After 5523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:12:04] [INFO ] [Nat]Absence check using 40 positive place invariants in 55 ms returned sat
[2024-05-20 18:12:04] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 41 ms returned sat
[2024-05-20 18:12:09] [INFO ] After 5037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:12:09] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 18:12:21] [INFO ] After 11791ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 18:12:24] [INFO ] After 14493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1490 ms.
[2024-05-20 18:12:25] [INFO ] After 22049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 110 ms.
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 3 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 2 with 3114 rules applied. Total rules applied 3674 place count 1846 transition count 8003
Drop transitions removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 2 with 1479 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5154 place count 1846 transition count 6523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5155 place count 1845 transition count 6523
Partial Free-agglomeration rule applied 1639 times.
Drop transitions removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 6794 place count 1845 transition count 6523
Applied a total of 6794 rules in 1377 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6523/9840 (removed 3317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1377 ms. Remains : 1845/3683 places, 6523/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6523 rows 1845 cols
[2024-05-20 18:12:27] [INFO ] Computed 42 invariants in 171 ms
[2024-05-20 18:12:27] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:12:28] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:12:28] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:12:30] [INFO ] After 2045ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:12:30] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 18:12:31] [INFO ] After 1261ms SMT Verify possible using 6393 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:12:31] [INFO ] After 1544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 189 ms.
[2024-05-20 18:12:31] [INFO ] After 4106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6523/6523 transitions.
Applied a total of 0 rules in 199 ms. Remains 1845 /1845 variables (removed 0) and now considering 6523/6523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 1845/1845 places, 6523/6523 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103930 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103930 steps, saw 28019 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 18:12:35] [INFO ] Invariant cache hit.
[2024-05-20 18:12:35] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:12:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:12:35] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:12:37] [INFO ] After 1875ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:12:37] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 18:12:38] [INFO ] After 1163ms SMT Verify possible using 6393 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:12:39] [INFO ] After 1459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 179 ms.
[2024-05-20 18:12:39] [INFO ] After 3842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 125 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p1 (NOT p2))), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 (NOT p2)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND (NOT p2) p0)))]
Knowledge based reduction with 15 factoid took 479 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering criterion allowed to conclude after 29114 steps with 31 reset in 241 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-03 finished in 123030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 245 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:12:41] [INFO ] Computed 42 invariants in 415 ms
[2024-05-20 18:12:42] [INFO ] Implicit Places using invariants in 1285 ms returned []
[2024-05-20 18:12:42] [INFO ] Invariant cache hit.
[2024-05-20 18:12:45] [INFO ] Implicit Places using invariants and state equation in 3249 ms returned []
Implicit Place search using SMT with State Equation took 4535 ms to find 0 implicit places.
[2024-05-20 18:12:45] [INFO ] Invariant cache hit.
[2024-05-20 18:12:50] [INFO ] Dead Transitions using invariants and state equation in 4787 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9568 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT s1477 s1428) (LEQ s1233 s149) (GT 2 s412))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1027 steps with 0 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-04 finished in 9750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((G(p1) U p2))||p0))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5157 place count 1845 transition count 6521
Applied a total of 5157 rules in 1050 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6521/9840 (removed 3319) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 18:12:51] [INFO ] Computed 42 invariants in 129 ms
[2024-05-20 18:12:52] [INFO ] Implicit Places using invariants in 1326 ms returned []
[2024-05-20 18:12:52] [INFO ] Invariant cache hit.
[2024-05-20 18:12:53] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:12:56] [INFO ] Implicit Places using invariants and state equation in 4003 ms returned []
Implicit Place search using SMT with State Equation took 5330 ms to find 0 implicit places.
[2024-05-20 18:12:57] [INFO ] Redundant transitions in 587 ms returned []
[2024-05-20 18:12:57] [INFO ] Invariant cache hit.
[2024-05-20 18:13:00] [INFO ] Dead Transitions using invariants and state equation in 2945 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6521/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9925 ms. Remains : 1845/3683 places, 6521/9840 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LEQ s1705 s412) (GT 3 s542)), p2:(LEQ 1 s35), p1:(LEQ 2 s247)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 488 reset in 1032 ms.
Product exploration explored 100000 steps with 494 reset in 1048 ms.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Detected a total of 124/1845 stabilizing places and 201/6521 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 194 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 95728 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95728 steps, saw 28396 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-20 18:13:06] [INFO ] Invariant cache hit.
[2024-05-20 18:13:06] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:13:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:13:07] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:13:09] [INFO ] After 2553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:13:10] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:13:12] [INFO ] After 2368ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 18:13:14] [INFO ] After 4070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1148 ms.
[2024-05-20 18:13:15] [INFO ] After 8393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 40 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 566 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 566 ms. Remains : 1843/1845 places, 6519/6521 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 88773 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88773 steps, saw 24148 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-20 18:13:19] [INFO ] Computed 42 invariants in 173 ms
[2024-05-20 18:13:19] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:13:20] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:13:20] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:13:22] [INFO ] After 2220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:13:22] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:13:25] [INFO ] After 2460ms SMT Verify possible using 6394 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 18:13:26] [INFO ] After 4186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1154 ms.
[2024-05-20 18:13:27] [INFO ] After 8146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 48 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 188 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 196 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-20 18:13:28] [INFO ] Invariant cache hit.
[2024-05-20 18:13:30] [INFO ] Implicit Places using invariants in 1930 ms returned []
[2024-05-20 18:13:30] [INFO ] Invariant cache hit.
[2024-05-20 18:13:31] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:13:43] [INFO ] Implicit Places using invariants and state equation in 13493 ms returned []
Implicit Place search using SMT with State Equation took 15423 ms to find 0 implicit places.
[2024-05-20 18:13:44] [INFO ] Redundant transitions in 494 ms returned []
[2024-05-20 18:13:44] [INFO ] Invariant cache hit.
[2024-05-20 18:13:47] [INFO ] Dead Transitions using invariants and state equation in 2878 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19008 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6264 edges and 1843 vertex of which 1676 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1674 places
Drop transitions removed 4709 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6341 transitions.
Graph (complete) has 420 edges and 169 vertex of which 52 are kept as prefixes of interest. Removing 117 places using SCC suffix rule.0 ms
Discarding 117 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 79 transitions
Reduce isomorphic transitions removed 79 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 80 rules applied. Total rules applied 82 place count 52 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 51 transition count 60
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 120 place count 14 transition count 23
Iterating global reduction 2 with 37 rules applied. Total rules applied 157 place count 14 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 14 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 14 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 13 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 13 transition count 19
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 164 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 11 transition count 17
Applied a total of 165 rules in 12 ms. Remains 11 /1843 variables (removed 1832) and now considering 17/6519 (removed 6502) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 17 rows 11 cols
[2024-05-20 18:13:47] [INFO ] Computed 1 invariants in 1 ms
[2024-05-20 18:13:47] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:13:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 18:13:47] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:13:47] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-20 18:13:47] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 189 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 188 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 18:13:48] [INFO ] Computed 42 invariants in 127 ms
[2024-05-20 18:13:49] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2024-05-20 18:13:49] [INFO ] Invariant cache hit.
[2024-05-20 18:13:50] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:13:53] [INFO ] Implicit Places using invariants and state equation in 4021 ms returned []
Implicit Place search using SMT with State Equation took 5329 ms to find 0 implicit places.
[2024-05-20 18:13:53] [INFO ] Redundant transitions in 469 ms returned []
[2024-05-20 18:13:53] [INFO ] Invariant cache hit.
[2024-05-20 18:13:56] [INFO ] Dead Transitions using invariants and state equation in 3000 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8998 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Computed a total of 124 stabilizing places and 201 stable transitions
Computed a total of 124 stabilizing places and 201 stable transitions
Detected a total of 124/1845 stabilizing places and 201/6521 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 172 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 94387 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94387 steps, saw 28219 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-20 18:14:00] [INFO ] Invariant cache hit.
[2024-05-20 18:14:00] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:14:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:14:01] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:14:03] [INFO ] After 2479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:14:03] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:14:06] [INFO ] After 2428ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 18:14:08] [INFO ] After 4135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1188 ms.
[2024-05-20 18:14:09] [INFO ] After 8367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 49 ms.
Support contains 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1845 transition count 6519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6519
Partial Free-agglomeration rule applied 1638 times.
Drop transitions removed 1638 transitions
Iterating global reduction 1 with 1638 rules applied. Total rules applied 1642 place count 1843 transition count 6519
Applied a total of 1642 rules in 579 ms. Remains 1843 /1845 variables (removed 2) and now considering 6519/6521 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 581 ms. Remains : 1843/1845 places, 6519/6521 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 89777 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89777 steps, saw 24277 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 6519 rows 1843 cols
[2024-05-20 18:14:13] [INFO ] Computed 42 invariants in 162 ms
[2024-05-20 18:14:13] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:14:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2024-05-20 18:14:14] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:14:16] [INFO ] After 2286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:14:16] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:14:19] [INFO ] After 2557ms SMT Verify possible using 6394 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-20 18:14:21] [INFO ] After 4321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1169 ms.
[2024-05-20 18:14:22] [INFO ] After 8398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 55 ms.
Support contains 5 out of 1843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 200 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1843/1843 places, 6519/6519 transitions.
Applied a total of 0 rules in 197 ms. Remains 1843 /1843 variables (removed 0) and now considering 6519/6519 (removed 0) transitions.
[2024-05-20 18:14:22] [INFO ] Invariant cache hit.
[2024-05-20 18:14:24] [INFO ] Implicit Places using invariants in 1992 ms returned []
[2024-05-20 18:14:24] [INFO ] Invariant cache hit.
[2024-05-20 18:14:25] [INFO ] State equation strengthened by 6394 read => feed constraints.
[2024-05-20 18:14:37] [INFO ] Implicit Places using invariants and state equation in 12360 ms returned []
Implicit Place search using SMT with State Equation took 14354 ms to find 0 implicit places.
[2024-05-20 18:14:37] [INFO ] Redundant transitions in 483 ms returned []
[2024-05-20 18:14:37] [INFO ] Invariant cache hit.
[2024-05-20 18:14:40] [INFO ] Dead Transitions using invariants and state equation in 2792 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17853 ms. Remains : 1843/1843 places, 6519/6519 transitions.
Graph (trivial) has 6264 edges and 1843 vertex of which 1676 / 1843 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1674 places
Drop transitions removed 4709 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6341 transitions.
Graph (complete) has 420 edges and 169 vertex of which 52 are kept as prefixes of interest. Removing 117 places using SCC suffix rule.0 ms
Discarding 117 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 79 transitions
Reduce isomorphic transitions removed 79 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 80 rules applied. Total rules applied 82 place count 52 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 51 transition count 60
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 120 place count 14 transition count 23
Iterating global reduction 2 with 37 rules applied. Total rules applied 157 place count 14 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 14 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 14 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 13 transition count 20
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 13 transition count 19
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 164 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 11 transition count 17
Applied a total of 165 rules in 10 ms. Remains 11 /1843 variables (removed 1832) and now considering 17/6519 (removed 6502) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 17 rows 11 cols
[2024-05-20 18:14:40] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 18:14:40] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-20 18:14:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 18:14:40] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-20 18:14:40] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-20 18:14:40] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 196 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 491 reset in 1033 ms.
Product exploration explored 100000 steps with 493 reset in 1058 ms.
Built C files in :
/tmp/ltsmin13762976028098419195
[2024-05-20 18:14:43] [INFO ] Too many transitions (6521) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:14:43] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13762976028098419195
Running compilation step : cd /tmp/ltsmin13762976028098419195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin13762976028098419195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13762976028098419195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 5 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6521/6521 transitions.
Applied a total of 0 rules in 184 ms. Remains 1845 /1845 variables (removed 0) and now considering 6521/6521 (removed 0) transitions.
// Phase 1: matrix 6521 rows 1845 cols
[2024-05-20 18:14:46] [INFO ] Computed 42 invariants in 127 ms
[2024-05-20 18:14:47] [INFO ] Implicit Places using invariants in 1269 ms returned []
[2024-05-20 18:14:47] [INFO ] Invariant cache hit.
[2024-05-20 18:14:48] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:14:51] [INFO ] Implicit Places using invariants and state equation in 3680 ms returned []
Implicit Place search using SMT with State Equation took 4961 ms to find 0 implicit places.
[2024-05-20 18:14:52] [INFO ] Redundant transitions in 492 ms returned []
[2024-05-20 18:14:52] [INFO ] Invariant cache hit.
[2024-05-20 18:14:54] [INFO ] Dead Transitions using invariants and state equation in 2880 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8528 ms. Remains : 1845/1845 places, 6521/6521 transitions.
Built C files in :
/tmp/ltsmin11601664790730733675
[2024-05-20 18:14:55] [INFO ] Too many transitions (6521) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:14:55] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11601664790730733675
Running compilation step : cd /tmp/ltsmin11601664790730733675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin11601664790730733675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11601664790730733675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-20 18:14:58] [INFO ] Flatten gal took : 139 ms
[2024-05-20 18:14:58] [INFO ] Flatten gal took : 156 ms
[2024-05-20 18:14:58] [INFO ] Time to serialize gal into /tmp/LTL16190448653552859560.gal : 35 ms
[2024-05-20 18:14:58] [INFO ] Time to serialize properties into /tmp/LTL938034000955033382.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16190448653552859560.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2440304701086111946.hoa' '-atoms' '/tmp/LTL938034000955033382.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL938034000955033382.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2440304701086111946.hoa
Detected timeout of ITS tools.
[2024-05-20 18:15:13] [INFO ] Flatten gal took : 118 ms
[2024-05-20 18:15:14] [INFO ] Flatten gal took : 120 ms
[2024-05-20 18:15:14] [INFO ] Time to serialize gal into /tmp/LTL5846097614247928427.gal : 21 ms
[2024-05-20 18:15:14] [INFO ] Time to serialize properties into /tmp/LTL5031346793191473021.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5846097614247928427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5031346793191473021.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((Node36requestsent20<=Node4requestsent9)||(Node7GiveAnswer18<3))")||(G((G("(Node0requestsent4>=2)"))U("(Node5IsInserted>=1)"...162
Formula 0 simplified : G(F(F!"(Node0requestsent4>=2)" R !"(Node5IsInserted>=1)") & FG!"((Node36requestsent20<=Node4requestsent9)||(Node7GiveAnswer18<3))")
Detected timeout of ITS tools.
[2024-05-20 18:15:29] [INFO ] Flatten gal took : 114 ms
[2024-05-20 18:15:29] [INFO ] Applying decomposition
[2024-05-20 18:15:29] [INFO ] Flatten gal took : 123 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10906931080839338441.txt' '-o' '/tmp/graph10906931080839338441.bin' '-w' '/tmp/graph10906931080839338441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10906931080839338441.bin' '-l' '-1' '-v' '-w' '/tmp/graph10906931080839338441.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:15:30] [INFO ] Decomposing Gal with order
[2024-05-20 18:15:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:15:30] [INFO ] Removed a total of 4810 redundant transitions.
[2024-05-20 18:15:31] [INFO ] Flatten gal took : 857 ms
[2024-05-20 18:15:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 3119 labels/synchronizations in 359 ms.
[2024-05-20 18:15:31] [INFO ] Time to serialize gal into /tmp/LTL14860012623279042083.gal : 35 ms
[2024-05-20 18:15:31] [INFO ] Time to serialize properties into /tmp/LTL11863861425254881971.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14860012623279042083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11863861425254881971.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((gu41.Node36requestsent20<=gu41.Node4requestsent9)||(gi0.gu19.Node7GiveAnswer18<3))")||(G((G("(gi0.gu1.Node0requestsent4>=2)...197
Formula 0 simplified : G(F(F!"(gi0.gu1.Node0requestsent4>=2)" R !"(gi0.gu6.Node5IsInserted>=1)") & FG!"((gu41.Node36requestsent20<=gu41.Node4requestsent9)|...189
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2011131214083103747
[2024-05-20 18:15:47] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2011131214083103747
Running compilation step : cd /tmp/ltsmin2011131214083103747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2011131214083103747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2011131214083103747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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-040-LTLCardinality-07 finished in 179734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(F(p1)))))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 274 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:15:50] [INFO ] Computed 42 invariants in 428 ms
[2024-05-20 18:15:51] [INFO ] Implicit Places using invariants in 1315 ms returned []
[2024-05-20 18:15:51] [INFO ] Invariant cache hit.
[2024-05-20 18:15:53] [INFO ] Implicit Places using invariants and state equation in 1963 ms returned []
Implicit Place search using SMT with State Equation took 3279 ms to find 0 implicit places.
[2024-05-20 18:15:53] [INFO ] Invariant cache hit.
[2024-05-20 18:15:59] [INFO ] Dead Transitions using invariants and state equation in 6051 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9606 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ 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=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 1 s3462), p0:(GT 2 s841)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 106 reset in 926 ms.
Product exploration explored 100000 steps with 102 reset in 900 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 p0), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Finished random walk after 4238 steps, including 4 resets, run visited all 1 properties in 41 ms. (steps per millisecond=103 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 3683 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 966 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-20 18:16:03] [INFO ] Computed 42 invariants in 125 ms
[2024-05-20 18:16:04] [INFO ] Implicit Places using invariants in 1287 ms returned []
[2024-05-20 18:16:04] [INFO ] Invariant cache hit.
[2024-05-20 18:16:05] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:16:08] [INFO ] Implicit Places using invariants and state equation in 3805 ms returned []
Implicit Place search using SMT with State Equation took 5094 ms to find 0 implicit places.
[2024-05-20 18:16:08] [INFO ] Redundant transitions in 561 ms returned []
[2024-05-20 18:16:08] [INFO ] Invariant cache hit.
[2024-05-20 18:16:11] [INFO ] Dead Transitions using invariants and state equation in 2938 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9573 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 107201 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107201 steps, saw 29790 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 18:16:15] [INFO ] Invariant cache hit.
[2024-05-20 18:16:15] [INFO ] [Real]Absence check using 40 positive place invariants in 23 ms returned sat
[2024-05-20 18:16:15] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:16:17] [INFO ] After 1606ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 18:16:17] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:16:17] [INFO ] After 458ms SMT Verify possible using 4757 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:16:17] [INFO ] After 2372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:16:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:16:17] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:16:19] [INFO ] After 1661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:16:19] [INFO ] After 426ms SMT Verify possible using 4757 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:16:20] [INFO ] After 663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 149 ms.
[2024-05-20 18:16:20] [INFO ] After 2774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 492 reset in 1016 ms.
Stack based approach found an accepted trace after 95846 steps with 473 reset with depth 165 and stack size 165 in 989 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-08 finished in 32590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 3404 transition count 9560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1481 Post agglomeration using F-continuation condition.Transition count delta: 1481
Deduced a syphon composed of 1481 places in 3 ms
Reduce places removed 1481 places and 0 transitions.
Iterating global reduction 3 with 2962 rules applied. Total rules applied 3522 place count 1922 transition count 8079
Drop transitions removed 1405 transitions
Redundant transition composition rules discarded 1405 transitions
Iterating global reduction 3 with 1405 rules applied. Total rules applied 4927 place count 1922 transition count 6674
Partial Post-agglomeration rule applied 154 times.
Drop transitions removed 154 transitions
Iterating global reduction 3 with 154 rules applied. Total rules applied 5081 place count 1922 transition count 6674
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 5157 place count 1846 transition count 6598
Iterating global reduction 3 with 76 rules applied. Total rules applied 5233 place count 1846 transition count 6598
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 5271 place count 1846 transition count 6560
Applied a total of 5271 rules in 1492 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6560/9840 (removed 3280) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2024-05-20 18:16:24] [INFO ] Computed 42 invariants in 129 ms
[2024-05-20 18:16:25] [INFO ] Implicit Places using invariants in 1241 ms returned []
[2024-05-20 18:16:25] [INFO ] Invariant cache hit.
[2024-05-20 18:16:26] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-20 18:16:29] [INFO ] Implicit Places using invariants and state equation in 3636 ms returned []
Implicit Place search using SMT with State Equation took 4895 ms to find 0 implicit places.
[2024-05-20 18:16:29] [INFO ] Redundant transitions in 497 ms returned []
[2024-05-20 18:16:29] [INFO ] Invariant cache hit.
[2024-05-20 18:16:32] [INFO ] Dead Transitions using invariants and state equation in 2985 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1846/3683 places, 6560/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9879 ms. Remains : 1846/3683 places, 6560/9840 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT s927 s230) (GT 2 s1806))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 486 reset in 979 ms.
Product exploration explored 100000 steps with 485 reset in 988 ms.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 98 ms. (steps per millisecond=102 ) 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 105533 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105533 steps, saw 29619 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 18:16:37] [INFO ] Invariant cache hit.
[2024-05-20 18:16:38] [INFO ] [Real]Absence check using 40 positive place invariants in 22 ms returned sat
[2024-05-20 18:16:38] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:16:39] [INFO ] After 2018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:16:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 17 ms returned sat
[2024-05-20 18:16:40] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:16:41] [INFO ] After 1665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:16:41] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-20 18:16:44] [INFO ] After 2527ms SMT Verify possible using 4793 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:16:44] [INFO ] After 2887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 215 ms.
[2024-05-20 18:16:45] [INFO ] After 5067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 6559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 6559
Partial Free-agglomeration rule applied 1601 times.
Drop transitions removed 1601 transitions
Iterating global reduction 1 with 1601 rules applied. Total rules applied 1603 place count 1845 transition count 6559
Applied a total of 1603 rules in 545 ms. Remains 1845 /1846 variables (removed 1) and now considering 6559/6560 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 545 ms. Remains : 1845/1846 places, 6559/6560 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 132 ms. (steps per millisecond=75 ) 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 99275 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99275 steps, saw 27505 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6559 rows 1845 cols
[2024-05-20 18:16:48] [INFO ] Computed 42 invariants in 149 ms
[2024-05-20 18:16:49] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:16:49] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 19 ms returned sat
[2024-05-20 18:16:50] [INFO ] After 1864ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:16:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:16:51] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:16:52] [INFO ] After 1694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:16:52] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 18:16:55] [INFO ] After 2983ms SMT Verify possible using 6393 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:16:56] [INFO ] After 3386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 233 ms.
[2024-05-20 18:16:56] [INFO ] After 5640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 201 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 221 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
[2024-05-20 18:16:56] [INFO ] Invariant cache hit.
[2024-05-20 18:16:58] [INFO ] Implicit Places using invariants in 1870 ms returned []
[2024-05-20 18:16:58] [INFO ] Invariant cache hit.
[2024-05-20 18:16:59] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 18:17:10] [INFO ] Implicit Places using invariants and state equation in 11437 ms returned []
Implicit Place search using SMT with State Equation took 13310 ms to find 0 implicit places.
[2024-05-20 18:17:10] [INFO ] Redundant transitions in 498 ms returned []
[2024-05-20 18:17:10] [INFO ] Invariant cache hit.
[2024-05-20 18:17:13] [INFO ] Dead Transitions using invariants and state equation in 2781 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16839 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Graph (trivial) has 6272 edges and 1845 vertex of which 1637 / 1845 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1635 places
Drop transitions removed 4561 transitions
Ensure Unique test removed 1625 transitions
Reduce isomorphic transitions removed 6186 transitions.
Graph (complete) has 616 edges and 210 vertex of which 89 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.1 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 89 transition count 215
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 196 place count 14 transition count 66
Iterating global reduction 1 with 75 rules applied. Total rules applied 271 place count 14 transition count 66
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 308 place count 14 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 312 place count 12 transition count 28
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 317 place count 12 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 11 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 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 2 with 2 rules applied. Total rules applied 321 place count 10 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 322 place count 10 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 10 transition count 19
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 325 place count 9 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 9 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 8 transition count 17
Applied a total of 327 rules in 15 ms. Remains 8 /1845 variables (removed 1837) and now considering 17/6559 (removed 6542) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 17 rows 8 cols
[2024-05-20 18:17:13] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 18:17:13] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:17:13] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:17:13] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 18:17:13] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Applied a total of 0 rules in 202 ms. Remains 1846 /1846 variables (removed 0) and now considering 6560/6560 (removed 0) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2024-05-20 18:17:14] [INFO ] Computed 42 invariants in 130 ms
[2024-05-20 18:17:15] [INFO ] Implicit Places using invariants in 1255 ms returned []
[2024-05-20 18:17:15] [INFO ] Invariant cache hit.
[2024-05-20 18:17:16] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-20 18:17:18] [INFO ] Implicit Places using invariants and state equation in 3698 ms returned []
Implicit Place search using SMT with State Equation took 4965 ms to find 0 implicit places.
[2024-05-20 18:17:19] [INFO ] Redundant transitions in 488 ms returned []
[2024-05-20 18:17:19] [INFO ] Invariant cache hit.
[2024-05-20 18:17:22] [INFO ] Dead Transitions using invariants and state equation in 2923 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8589 ms. Remains : 1846/1846 places, 6560/6560 transitions.
Computed a total of 123 stabilizing places and 200 stable transitions
Computed a total of 123 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 105065 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105065 steps, saw 29566 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 18:17:25] [INFO ] Invariant cache hit.
[2024-05-20 18:17:25] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2024-05-20 18:17:25] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:17:27] [INFO ] After 1986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:17:27] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:17:27] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:17:29] [INFO ] After 1758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:17:29] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-20 18:17:32] [INFO ] After 2671ms SMT Verify possible using 4793 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:17:32] [INFO ] After 3033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 227 ms.
[2024-05-20 18:17:33] [INFO ] After 5321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1846 transition count 6559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1845 transition count 6559
Partial Free-agglomeration rule applied 1601 times.
Drop transitions removed 1601 transitions
Iterating global reduction 1 with 1601 rules applied. Total rules applied 1603 place count 1845 transition count 6559
Applied a total of 1603 rules in 630 ms. Remains 1845 /1846 variables (removed 1) and now considering 6559/6560 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 630 ms. Remains : 1845/1846 places, 6559/6560 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 130 ms. (steps per millisecond=76 ) 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 100415 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100415 steps, saw 27636 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6559 rows 1845 cols
[2024-05-20 18:17:36] [INFO ] Computed 42 invariants in 163 ms
[2024-05-20 18:17:37] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:17:37] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:17:38] [INFO ] After 1876ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:17:39] [INFO ] [Nat]Absence check using 40 positive place invariants in 17 ms returned sat
[2024-05-20 18:17:39] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-20 18:17:41] [INFO ] After 1867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:17:41] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 18:17:44] [INFO ] After 3330ms SMT Verify possible using 6393 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:17:44] [INFO ] After 3756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 228 ms.
[2024-05-20 18:17:45] [INFO ] After 6166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 227 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6559/6559 transitions.
Applied a total of 0 rules in 211 ms. Remains 1845 /1845 variables (removed 0) and now considering 6559/6559 (removed 0) transitions.
[2024-05-20 18:17:45] [INFO ] Invariant cache hit.
[2024-05-20 18:17:47] [INFO ] Implicit Places using invariants in 1956 ms returned []
[2024-05-20 18:17:47] [INFO ] Invariant cache hit.
[2024-05-20 18:17:48] [INFO ] State equation strengthened by 6393 read => feed constraints.
[2024-05-20 18:18:00] [INFO ] Implicit Places using invariants and state equation in 12940 ms returned []
Implicit Place search using SMT with State Equation took 14899 ms to find 0 implicit places.
[2024-05-20 18:18:00] [INFO ] Redundant transitions in 494 ms returned []
[2024-05-20 18:18:00] [INFO ] Invariant cache hit.
[2024-05-20 18:18:03] [INFO ] Dead Transitions using invariants and state equation in 2833 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18448 ms. Remains : 1845/1845 places, 6559/6559 transitions.
Graph (trivial) has 6272 edges and 1845 vertex of which 1637 / 1845 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1635 places
Drop transitions removed 4561 transitions
Ensure Unique test removed 1625 transitions
Reduce isomorphic transitions removed 6186 transitions.
Graph (complete) has 616 edges and 210 vertex of which 89 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 89 transition count 215
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 196 place count 14 transition count 66
Iterating global reduction 1 with 75 rules applied. Total rules applied 271 place count 14 transition count 66
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 308 place count 14 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 312 place count 12 transition count 28
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 317 place count 12 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 11 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 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 2 with 2 rules applied. Total rules applied 321 place count 10 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 322 place count 10 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 323 place count 10 transition count 19
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 325 place count 9 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 9 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 8 transition count 17
Applied a total of 327 rules in 12 ms. Remains 8 /1845 variables (removed 1837) and now considering 17/6559 (removed 6542) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 17 rows 8 cols
[2024-05-20 18:18:03] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 18:18:03] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:18:03] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:18:03] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-20 18:18:03] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 487 reset in 950 ms.
Product exploration explored 100000 steps with 486 reset in 981 ms.
Built C files in :
/tmp/ltsmin3130039303488112819
[2024-05-20 18:18:06] [INFO ] Too many transitions (6560) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:18:06] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3130039303488112819
Running compilation step : cd /tmp/ltsmin3130039303488112819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin3130039303488112819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3130039303488112819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 1846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1846/1846 places, 6560/6560 transitions.
Applied a total of 0 rules in 192 ms. Remains 1846 /1846 variables (removed 0) and now considering 6560/6560 (removed 0) transitions.
// Phase 1: matrix 6560 rows 1846 cols
[2024-05-20 18:18:09] [INFO ] Computed 42 invariants in 127 ms
[2024-05-20 18:18:10] [INFO ] Implicit Places using invariants in 1300 ms returned []
[2024-05-20 18:18:10] [INFO ] Invariant cache hit.
[2024-05-20 18:18:11] [INFO ] State equation strengthened by 4793 read => feed constraints.
[2024-05-20 18:18:14] [INFO ] Implicit Places using invariants and state equation in 3785 ms returned []
Implicit Place search using SMT with State Equation took 5090 ms to find 0 implicit places.
[2024-05-20 18:18:14] [INFO ] Redundant transitions in 471 ms returned []
[2024-05-20 18:18:14] [INFO ] Invariant cache hit.
[2024-05-20 18:18:17] [INFO ] Dead Transitions using invariants and state equation in 3002 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8762 ms. Remains : 1846/1846 places, 6560/6560 transitions.
Built C files in :
/tmp/ltsmin12249753588538771109
[2024-05-20 18:18:17] [INFO ] Too many transitions (6560) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:18:18] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12249753588538771109
Running compilation step : cd /tmp/ltsmin12249753588538771109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin12249753588538771109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12249753588538771109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-20 18:18:21] [INFO ] Flatten gal took : 214 ms
[2024-05-20 18:18:21] [INFO ] Flatten gal took : 156 ms
[2024-05-20 18:18:21] [INFO ] Time to serialize gal into /tmp/LTL5089132302760240686.gal : 20 ms
[2024-05-20 18:18:21] [INFO ] Time to serialize properties into /tmp/LTL688531229738733773.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5089132302760240686.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18435318031171194507.hoa' '-atoms' '/tmp/LTL688531229738733773.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL688531229738733773.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18435318031171194507.hoa
Detected timeout of ITS tools.
[2024-05-20 18:18:36] [INFO ] Flatten gal took : 108 ms
[2024-05-20 18:18:36] [INFO ] Flatten gal took : 109 ms
[2024-05-20 18:18:36] [INFO ] Time to serialize gal into /tmp/LTL2983718881218737564.gal : 18 ms
[2024-05-20 18:18:36] [INFO ] Time to serialize properties into /tmp/LTL3895593353734762272.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2983718881218737564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3895593353734762272.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node17GiveAnswer2>Node37NOshare)||(Node39GiveAnswer0<2))"))))
Formula 0 simplified : FG!"((Node17GiveAnswer2>Node37NOshare)||(Node39GiveAnswer0<2))"
Detected timeout of ITS tools.
[2024-05-20 18:18:52] [INFO ] Flatten gal took : 113 ms
[2024-05-20 18:18:52] [INFO ] Applying decomposition
[2024-05-20 18:18:52] [INFO ] Flatten gal took : 131 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8987950874077393687.txt' '-o' '/tmp/graph8987950874077393687.bin' '-w' '/tmp/graph8987950874077393687.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8987950874077393687.bin' '-l' '-1' '-v' '-w' '/tmp/graph8987950874077393687.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:18:52] [INFO ] Decomposing Gal with order
[2024-05-20 18:18:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:18:52] [INFO ] Removed a total of 4979 redundant transitions.
[2024-05-20 18:18:53] [INFO ] Flatten gal took : 423 ms
[2024-05-20 18:18:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 3202 labels/synchronizations in 203 ms.
[2024-05-20 18:18:53] [INFO ] Time to serialize gal into /tmp/LTL7033950537568753108.gal : 25 ms
[2024-05-20 18:18:53] [INFO ] Time to serialize properties into /tmp/LTL14496078725032992815.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7033950537568753108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14496078725032992815.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((gu42.Node17GiveAnswer2>gu42.Node37NOshare)||(gi0.gu1.Node39GiveAnswer0<2))"))))
Formula 0 simplified : FG!"((gu42.Node17GiveAnswer2>gu42.Node37NOshare)||(gi0.gu1.Node39GiveAnswer0<2))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2095692500217672829
[2024-05-20 18:19:08] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2095692500217672829
Running compilation step : cd /tmp/ltsmin2095692500217672829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2095692500217672829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2095692500217672829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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-040-LTLCardinality-10 finished in 169009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 5 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 267 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:19:12] [INFO ] Computed 42 invariants in 432 ms
[2024-05-20 18:19:13] [INFO ] Implicit Places using invariants in 1290 ms returned []
[2024-05-20 18:19:13] [INFO ] Invariant cache hit.
[2024-05-20 18:19:16] [INFO ] Implicit Places using invariants and state equation in 3109 ms returned []
Implicit Place search using SMT with State Equation took 4401 ms to find 0 implicit places.
[2024-05-20 18:19:16] [INFO ] Invariant cache hit.
[2024-05-20 18:19:22] [INFO ] Dead Transitions using invariants and state equation in 5863 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10546 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (LEQ s2160 s2406) (LEQ 1 s1199)), p0:(LEQ s51 s2754)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-11 finished in 10759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 294 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2024-05-20 18:19:22] [INFO ] Invariant cache hit.
[2024-05-20 18:19:24] [INFO ] Implicit Places using invariants in 2126 ms returned []
[2024-05-20 18:19:24] [INFO ] Invariant cache hit.
[2024-05-20 18:19:26] [INFO ] Implicit Places using invariants and state equation in 1825 ms returned []
Implicit Place search using SMT with State Equation took 3953 ms to find 0 implicit places.
[2024-05-20 18:19:26] [INFO ] Invariant cache hit.
[2024-05-20 18:19:32] [INFO ] Dead Transitions using invariants and state equation in 5370 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9635 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s1667), p1:(LEQ 1 s2158)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 927 steps with 0 reset in 10 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-12 finished in 9765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1126 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2024-05-20 18:19:33] [INFO ] Computed 42 invariants in 130 ms
[2024-05-20 18:19:34] [INFO ] Implicit Places using invariants in 1323 ms returned []
[2024-05-20 18:19:34] [INFO ] Invariant cache hit.
[2024-05-20 18:19:35] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2024-05-20 18:19:38] [INFO ] Implicit Places using invariants and state equation in 3873 ms returned []
Implicit Place search using SMT with State Equation took 5214 ms to find 0 implicit places.
[2024-05-20 18:19:39] [INFO ] Redundant transitions in 542 ms returned []
[2024-05-20 18:19:39] [INFO ] Invariant cache hit.
[2024-05-20 18:19:42] [INFO ] Dead Transitions using invariants and state equation in 2949 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9850 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1488 s1790)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 490 reset in 993 ms.
Stack based approach found an accepted trace after 15061 steps with 72 reset with depth 196 and stack size 195 in 185 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-13 finished in 11086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 267 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-20 18:19:44] [INFO ] Computed 42 invariants in 407 ms
[2024-05-20 18:19:44] [INFO ] Implicit Places using invariants in 1274 ms returned []
[2024-05-20 18:19:44] [INFO ] Invariant cache hit.
[2024-05-20 18:19:46] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 3374 ms to find 0 implicit places.
[2024-05-20 18:19:46] [INFO ] Invariant cache hit.
[2024-05-20 18:19:52] [INFO ] Dead Transitions using invariants and state equation in 5736 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9382 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 3 s3258)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-040-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLCardinality-14 finished in 9544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G(p1)))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Deduced a syphon composed of 1560 places in 2 ms
Reduce places removed 1560 places and 0 transitions.
Iterating global reduction 3 with 3120 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 3 with 1482 rules applied. Total rules applied 5158 place count 1845 transition count 6520
Applied a total of 5158 rules in 1108 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2024-05-20 18:19:54] [INFO ] Computed 42 invariants in 125 ms
[2024-05-20 18:19:55] [INFO ] Implicit Places using invariants in 1313 ms returned []
[2024-05-20 18:19:55] [INFO ] Invariant cache hit.
[2024-05-20 18:19:56] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-20 18:19:58] [INFO ] Implicit Places using invariants and state equation in 3530 ms returned []
Implicit Place search using SMT with State Equation took 4846 ms to find 0 implicit places.
[2024-05-20 18:19:59] [INFO ] Redundant transitions in 468 ms returned []
[2024-05-20 18:19:59] [INFO ] Invariant cache hit.
[2024-05-20 18:20:02] [INFO ] Dead Transitions using invariants and state equation in 2953 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9402 ms. Remains : 1845/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s53 s803), p0:(OR (GT 1 s396) (GT 2 s833))], 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 498 reset in 953 ms.
Product exploration explored 100000 steps with 493 reset in 1029 ms.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 118 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 73 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 18:20:04] [INFO ] Invariant cache hit.
[2024-05-20 18:20:04] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:20:04] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:20:06] [INFO ] After 1598ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 18:20:06] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-20 18:20:07] [INFO ] After 1070ms SMT Verify possible using 4758 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:20:07] [INFO ] After 2998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:20:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:20:07] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-20 18:20:09] [INFO ] After 1766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:20:10] [INFO ] After 937ms SMT Verify possible using 4758 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:20:10] [INFO ] After 1195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 166 ms.
[2024-05-20 18:20:11] [INFO ] After 3413ms 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 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6520/6520 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 1845 transition count 6518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1639 times.
Drop transitions removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 1645 place count 1842 transition count 6517
Applied a total of 1645 rules in 607 ms. Remains 1842 /1845 variables (removed 3) and now considering 6517/6520 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 607 ms. Remains : 1842/1845 places, 6517/6520 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 106050 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106050 steps, saw 28251 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6517 rows 1842 cols
[2024-05-20 18:20:15] [INFO ] Computed 42 invariants in 159 ms
[2024-05-20 18:20:15] [INFO ] [Real]Absence check using 40 positive place invariants in 26 ms returned sat
[2024-05-20 18:20:15] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 27 ms returned sat
[2024-05-20 18:20:16] [INFO ] After 1501ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 18:20:16] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-20 18:20:17] [INFO ] After 1001ms SMT Verify possible using 6396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:20:17] [INFO ] After 2824ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:20:18] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2024-05-20 18:20:18] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2024-05-20 18:20:20] [INFO ] After 2582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:20:21] [INFO ] After 1095ms SMT Verify possible using 6396 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:20:22] [INFO ] After 1352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 177 ms.
[2024-05-20 18:20:22] [INFO ] After 4365ms 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 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 214 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 216 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2024-05-20 18:20:22] [INFO ] Invariant cache hit.
[2024-05-20 18:20:24] [INFO ] Implicit Places using invariants in 1933 ms returned []
[2024-05-20 18:20:24] [INFO ] Invariant cache hit.
[2024-05-20 18:20:25] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-20 18:20:25] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 3238 ms to find 0 implicit places.
[2024-05-20 18:20:26] [INFO ] Redundant transitions in 487 ms returned []
[2024-05-20 18:20:26] [INFO ] Invariant cache hit.
[2024-05-20 18:20:29] [INFO ] Dead Transitions using invariants and state equation in 2777 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6728 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Graph (trivial) has 6270 edges and 1842 vertex of which 1677 / 1842 are part of one of the 2 SCC in 2 ms
Free SCC test removed 1675 places
Drop transitions removed 4713 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6345 transitions.
Graph (complete) has 414 edges and 167 vertex of which 46 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 45 transition count 51
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 7 transition count 13
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 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 163 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 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 166 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 167 place count 5 transition count 8
Applied a total of 167 rules in 14 ms. Remains 5 /1842 variables (removed 1837) and now considering 8/6517 (removed 6509) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2024-05-20 18:20:29] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 18:20:29] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:20:29] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:20:29] [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 1 ms.
[2024-05-20 18:20:29] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 139 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 59 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p0)]
Support contains 4 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 182 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2024-05-20 18:20:29] [INFO ] Computed 42 invariants in 127 ms
[2024-05-20 18:20:30] [INFO ] Implicit Places using invariants in 1247 ms returned []
[2024-05-20 18:20:30] [INFO ] Invariant cache hit.
[2024-05-20 18:20:31] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-20 18:20:34] [INFO ] Implicit Places using invariants and state equation in 3481 ms returned []
Implicit Place search using SMT with State Equation took 4740 ms to find 0 implicit places.
[2024-05-20 18:20:34] [INFO ] Redundant transitions in 443 ms returned []
[2024-05-20 18:20:34] [INFO ] Invariant cache hit.
[2024-05-20 18:20:37] [INFO ] Dead Transitions using invariants and state equation in 2909 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8283 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Computed a total of 125 stabilizing places and 202 stable transitions
Computed a total of 125 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 219 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 88 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 18:20:38] [INFO ] Invariant cache hit.
[2024-05-20 18:20:38] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:20:38] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:20:40] [INFO ] After 1627ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 18:20:40] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-20 18:20:41] [INFO ] After 969ms SMT Verify possible using 4758 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:20:41] [INFO ] After 2926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:20:41] [INFO ] [Nat]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-20 18:20:41] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:20:43] [INFO ] After 1677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:20:44] [INFO ] After 852ms SMT Verify possible using 4758 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:20:44] [INFO ] After 1092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 160 ms.
[2024-05-20 18:20:44] [INFO ] After 3215ms 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 1845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1845/1845 places, 6520/6520 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 1845 transition count 6518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1843 transition count 6518
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1843 transition count 6517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1842 transition count 6517
Partial Free-agglomeration rule applied 1639 times.
Drop transitions removed 1639 transitions
Iterating global reduction 3 with 1639 rules applied. Total rules applied 1645 place count 1842 transition count 6517
Applied a total of 1645 rules in 594 ms. Remains 1842 /1845 variables (removed 3) and now considering 6517/6520 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 594 ms. Remains : 1842/1845 places, 6517/6520 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 106610 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106610 steps, saw 28325 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6517 rows 1842 cols
[2024-05-20 18:20:48] [INFO ] Computed 42 invariants in 179 ms
[2024-05-20 18:20:48] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2024-05-20 18:20:48] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2024-05-20 18:20:50] [INFO ] After 1474ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 18:20:50] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-20 18:20:51] [INFO ] After 987ms SMT Verify possible using 6396 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:20:51] [INFO ] After 2765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:20:51] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-20 18:20:51] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-20 18:20:54] [INFO ] After 2699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:20:55] [INFO ] After 1044ms SMT Verify possible using 6396 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 18:20:55] [INFO ] After 1283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 196 ms.
[2024-05-20 18:20:55] [INFO ] After 4456ms 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 1842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 215 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1842/1842 places, 6517/6517 transitions.
Applied a total of 0 rules in 210 ms. Remains 1842 /1842 variables (removed 0) and now considering 6517/6517 (removed 0) transitions.
[2024-05-20 18:20:56] [INFO ] Invariant cache hit.
[2024-05-20 18:20:57] [INFO ] Implicit Places using invariants in 1861 ms returned []
[2024-05-20 18:20:57] [INFO ] Invariant cache hit.
[2024-05-20 18:20:58] [INFO ] State equation strengthened by 6396 read => feed constraints.
[2024-05-20 18:21:09] [INFO ] Implicit Places using invariants and state equation in 11598 ms returned []
Implicit Place search using SMT with State Equation took 13476 ms to find 0 implicit places.
[2024-05-20 18:21:10] [INFO ] Redundant transitions in 502 ms returned []
[2024-05-20 18:21:10] [INFO ] Invariant cache hit.
[2024-05-20 18:21:12] [INFO ] Dead Transitions using invariants and state equation in 2823 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17034 ms. Remains : 1842/1842 places, 6517/6517 transitions.
Graph (trivial) has 6270 edges and 1842 vertex of which 1677 / 1842 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1675 places
Drop transitions removed 4713 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6345 transitions.
Graph (complete) has 414 edges and 167 vertex of which 46 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.0 ms
Discarding 121 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 81 transitions
Reduce isomorphic transitions removed 81 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 82 rules applied. Total rules applied 84 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 45 transition count 51
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 123 place count 7 transition count 13
Iterating global reduction 2 with 38 rules applied. Total rules applied 161 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 163 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 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 166 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 167 place count 5 transition count 8
Applied a total of 167 rules in 9 ms. Remains 5 /1842 variables (removed 1837) and now considering 8/6517 (removed 6509) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2024-05-20 18:21:12] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 18:21:12] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 18:21:12] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 18:21:12] [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.
[2024-05-20 18:21:12] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 140 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 91 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 495 reset in 1160 ms.
Product exploration explored 100000 steps with 501 reset in 1175 ms.
Built C files in :
/tmp/ltsmin17756450023945490664
[2024-05-20 18:21:15] [INFO ] Too many transitions (6520) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:21:15] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17756450023945490664
Running compilation step : cd /tmp/ltsmin17756450023945490664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin17756450023945490664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17756450023945490664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 4 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 212 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2024-05-20 18:21:19] [INFO ] Computed 42 invariants in 125 ms
[2024-05-20 18:21:20] [INFO ] Implicit Places using invariants in 1246 ms returned []
[2024-05-20 18:21:20] [INFO ] Invariant cache hit.
[2024-05-20 18:21:21] [INFO ] State equation strengthened by 4758 read => feed constraints.
[2024-05-20 18:21:24] [INFO ] Implicit Places using invariants and state equation in 3985 ms returned []
Implicit Place search using SMT with State Equation took 5233 ms to find 0 implicit places.
[2024-05-20 18:21:24] [INFO ] Redundant transitions in 485 ms returned []
[2024-05-20 18:21:24] [INFO ] Invariant cache hit.
[2024-05-20 18:21:27] [INFO ] Dead Transitions using invariants and state equation in 2660 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8603 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Built C files in :
/tmp/ltsmin2317542372846700883
[2024-05-20 18:21:27] [INFO ] Too many transitions (6520) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:21:27] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2317542372846700883
Running compilation step : cd /tmp/ltsmin2317542372846700883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2317542372846700883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2317542372846700883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-20 18:21:30] [INFO ] Flatten gal took : 125 ms
[2024-05-20 18:21:30] [INFO ] Flatten gal took : 133 ms
[2024-05-20 18:21:30] [INFO ] Time to serialize gal into /tmp/LTL8701233397169823215.gal : 23 ms
[2024-05-20 18:21:30] [INFO ] Time to serialize properties into /tmp/LTL1723945231882210591.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8701233397169823215.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12042102338196838385.hoa' '-atoms' '/tmp/LTL1723945231882210591.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1723945231882210591.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12042102338196838385.hoa
Detected timeout of ITS tools.
[2024-05-20 18:21:46] [INFO ] Flatten gal took : 99 ms
[2024-05-20 18:21:46] [INFO ] Flatten gal took : 103 ms
[2024-05-20 18:21:46] [INFO ] Time to serialize gal into /tmp/LTL12138660434539278965.gal : 18 ms
[2024-05-20 18:21:46] [INFO ] Time to serialize properties into /tmp/LTL1185112917557049982.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12138660434539278965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1185112917557049982.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(F("((Node3requestsent32<1)||(Node14requestsent29<2))")))U(G("(Node8ID<=Node13requestsent39)"))))
Formula 0 simplified : XG!"((Node3requestsent32<1)||(Node14requestsent29<2))" R F!"(Node8ID<=Node13requestsent39)"
Detected timeout of ITS tools.
[2024-05-20 18:22:01] [INFO ] Flatten gal took : 105 ms
[2024-05-20 18:22:01] [INFO ] Applying decomposition
[2024-05-20 18:22:01] [INFO ] Flatten gal took : 108 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14444606408826375101.txt' '-o' '/tmp/graph14444606408826375101.bin' '-w' '/tmp/graph14444606408826375101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14444606408826375101.bin' '-l' '-1' '-v' '-w' '/tmp/graph14444606408826375101.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:22:01] [INFO ] Decomposing Gal with order
[2024-05-20 18:22:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:22:02] [INFO ] Removed a total of 4815 redundant transitions.
[2024-05-20 18:22:02] [INFO ] Flatten gal took : 387 ms
[2024-05-20 18:22:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 3122 labels/synchronizations in 214 ms.
[2024-05-20 18:22:02] [INFO ] Time to serialize gal into /tmp/LTL17958901562769324028.gal : 23 ms
[2024-05-20 18:22:02] [INFO ] Time to serialize properties into /tmp/LTL3339327492158003602.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17958901562769324028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3339327492158003602.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(F("((gi0.gu4.Node3requestsent32<1)||(gi0.gu16.Node14requestsent29<2))")))U(G("(gu42.Node8ID<=gu42.Node13requestsent39)"))))
Formula 0 simplified : XG!"((gi0.gu4.Node3requestsent32<1)||(gi0.gu16.Node14requestsent29<2))" R F!"(gu42.Node8ID<=gu42.Node13requestsent39)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18035743591200447769
[2024-05-20 18:22:17] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18035743591200447769
Running compilation step : cd /tmp/ltsmin18035743591200447769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin18035743591200447769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18035743591200447769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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-040-LTLCardinality-15 finished in 147920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((G(p1) U p2))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G(p1)))'
[2024-05-20 18:22:21] [INFO ] Flatten gal took : 165 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8187962262446402975
[2024-05-20 18:22:21] [INFO ] Too many transitions (9840) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:22:21] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8187962262446402975
Running compilation step : cd /tmp/ltsmin8187962262446402975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 18:22:21] [INFO ] Applying decomposition
[2024-05-20 18:22:21] [INFO ] Flatten gal took : 169 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2540103771127058859.txt' '-o' '/tmp/graph2540103771127058859.bin' '-w' '/tmp/graph2540103771127058859.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2540103771127058859.bin' '-l' '-1' '-v' '-w' '/tmp/graph2540103771127058859.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:22:22] [INFO ] Decomposing Gal with order
[2024-05-20 18:22:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:22:22] [INFO ] Removed a total of 4984 redundant transitions.
[2024-05-20 18:22:22] [INFO ] Flatten gal took : 478 ms
[2024-05-20 18:22:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 3198 labels/synchronizations in 228 ms.
[2024-05-20 18:22:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality17204708174135090478.gal : 38 ms
[2024-05-20 18:22:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality3534865530673334567.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17204708174135090478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3534865530673334567.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((G(F(("((gu163.Node36requestsent20<=gu163.Node4requestsent9)||(gi1.gi25.gu75.Node7GiveAnswer18<3))")||(G((G("(gi1.gi25.gu3.Node0requ...215
Formula 0 simplified : G(F(F!"(gi1.gi25.gu3.Node0requestsent4>=2)" R !"(gi1.gi25.gu81.Node5IsInserted>=1)") & FG!"((gu163.Node36requestsent20<=gu163.Node4r...207
Compilation finished in 51412 ms.
Running link step : cd /tmp/ltsmin8187962262446402975;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 97 ms.
Running LTSmin : cd /tmp/ltsmin8187962262446402975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([](([]((LTLAPp1==true)) U (LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8187962262446402975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([](([]((LTLAPp1==true)) U (LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8187962262446402975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-20 18:47:30] [INFO ] Flatten gal took : 5978 ms
[2024-05-20 18:47:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality10437731810289476885.gal : 1242 ms
[2024-05-20 18:47:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality7355425095206818518.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10437731810289476885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7355425095206818518.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((G(F(("((Node36requestsent20<=Node4requestsent9)||(Node7GiveAnswer18<3))")||(G((G("(Node0requestsent4>=2)"))U("(Node5IsInserted>=1)"...162
Formula 0 simplified : G(F(F!"(Node0requestsent4>=2)" R !"(Node5IsInserted>=1)") & FG!"((Node36requestsent20<=Node4requestsent9)||(Node7GiveAnswer18<3))")
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8187962262446402975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8187962262446402975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp4==true))) U []((LTLAPp5==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 2649512 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16011352 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CANInsertWithFailure-PT-040, 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 r087-tall-171620521400077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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