Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.2K Feb 26 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 08:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679088498879

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb103
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 21:28:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 21:28:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 21:28:21] [INFO ] Load time of PNML (sax parser for PT used): 801 ms
[2023-03-17 21:28:21] [INFO ] Transformed 520 places.
[2023-03-17 21:28:21] [INFO ] Transformed 31658 transitions.
[2023-03-17 21:28:21] [INFO ] Found NUPN structural information;
[2023-03-17 21:28:21] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 980 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
FORMULA RERS2020-PT-pb103-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb103-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 520 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 513 transition count 28429
Applied a total of 7 rules in 97 ms. Remains 513 /520 variables (removed 7) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:28:22] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:28:22] [INFO ] Computed 8 place invariants in 145 ms
[2023-03-17 21:28:23] [INFO ] Implicit Places using invariants in 1124 ms returned []
Implicit Place search using SMT only with invariants took 1151 ms to find 0 implicit places.
[2023-03-17 21:28:23] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:28:23] [INFO ] Invariant cache hit.
[2023-03-17 21:28:32] [INFO ] Dead Transitions using invariants and state equation in 8799 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 513/520 places, 28429/28429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10057 ms. Remains : 513/520 places, 28429/28429 transitions.
Support contains 63 out of 513 places after structural reductions.
[2023-03-17 21:28:33] [INFO ] Flatten gal took : 1080 ms
[2023-03-17 21:28:34] [INFO ] Flatten gal took : 794 ms
[2023-03-17 21:28:36] [INFO ] Input system was already deterministic with 28429 transitions.
Support contains 60 out of 513 places (down from 63) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 817 ms. (steps per millisecond=12 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-17 21:28:37] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:28:37] [INFO ] Invariant cache hit.
[2023-03-17 21:28:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:28:47] [INFO ] After 9262ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:27
[2023-03-17 21:28:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-17 21:29:00] [INFO ] After 12447ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :27
[2023-03-17 21:29:00] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-17 21:29:12] [INFO ] After 11843ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :1 sat :27
[2023-03-17 21:29:12] [INFO ] After 11844ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :27
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-17 21:29:12] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :27
Fused 28 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 117 ms.
Support contains 49 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 33 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 11 times.
Iterating global reduction 1 with 11 rules applied. Total rules applied 1077 place count 511 transition count 27366
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 1176 place count 500 transition count 27278
Applied a total of 1176 rules in 1169 ms. Remains 500 /513 variables (removed 13) and now considering 27278/28429 (removed 1151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1173 ms. Remains : 500/513 places, 27278/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 686 ms. (steps per millisecond=14 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Interrupted probabilistic random walk after 32416 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 32416 steps, saw 23141 distinct states, run finished after 3005 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 27 properties.
[2023-03-17 21:29:17] [INFO ] Flow matrix only has 18597 transitions (discarded 8681 similar events)
// Phase 1: matrix 18597 rows 500 cols
[2023-03-17 21:29:17] [INFO ] Computed 8 place invariants in 83 ms
[2023-03-17 21:29:18] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-17 21:29:32] [INFO ] After 14828ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-17 21:29:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:29:45] [INFO ] After 11997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-17 21:29:45] [INFO ] State equation strengthened by 1369 read => feed constraints.
[2023-03-17 21:29:58] [INFO ] After 12352ms SMT Verify possible using 1369 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-03-17 21:29:58] [INFO ] After 12353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-17 21:29:58] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 65 ms.
Support contains 49 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 27278/27278 transitions.
Applied a total of 0 rules in 125 ms. Remains 500 /500 variables (removed 0) and now considering 27278/27278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 500/500 places, 27278/27278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 27278/27278 transitions.
Applied a total of 0 rules in 140 ms. Remains 500 /500 variables (removed 0) and now considering 27278/27278 (removed 0) transitions.
[2023-03-17 21:29:58] [INFO ] Flow matrix only has 18597 transitions (discarded 8681 similar events)
[2023-03-17 21:29:58] [INFO ] Invariant cache hit.
[2023-03-17 21:29:59] [INFO ] Implicit Places using invariants in 1275 ms returned []
Implicit Place search using SMT only with invariants took 1277 ms to find 0 implicit places.
[2023-03-17 21:29:59] [INFO ] Flow matrix only has 18597 transitions (discarded 8681 similar events)
[2023-03-17 21:29:59] [INFO ] Invariant cache hit.
[2023-03-17 21:30:08] [INFO ] Dead Transitions using invariants and state equation in 8638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10076 ms. Remains : 500/500 places, 27278/27278 transitions.
Graph (trivial) has 7748 edges and 500 vertex of which 312 / 500 are part of one of the 49 SCC in 5 ms
Free SCC test removed 263 places
Drop transitions removed 7759 transitions
Ensure Unique test removed 14046 transitions
Reduce isomorphic transitions removed 21805 transitions.
Graph (complete) has 4472 edges and 237 vertex of which 231 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 11 place count 231 transition count 5464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 230 transition count 5464
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 229 transition count 5439
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 229 transition count 5439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 229 transition count 5438
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 228 transition count 5437
Drop transitions removed 3120 transitions
Redundant transition composition rules discarded 3120 transitions
Iterating global reduction 3 with 3120 rules applied. Total rules applied 3137 place count 228 transition count 2317
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 2865 edges and 222 vertex of which 218 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 20 rules applied. Total rules applied 3157 place count 218 transition count 2304
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 3167 place count 218 transition count 2294
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 3170 place count 215 transition count 2291
Iterating global reduction 5 with 3 rules applied. Total rules applied 3173 place count 215 transition count 2291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 3178 place count 215 transition count 2286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3180 place count 214 transition count 2285
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 3190 place count 214 transition count 2275
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 3196 place count 214 transition count 2269
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 3204 place count 208 transition count 2267
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 7 with 27 rules applied. Total rules applied 3231 place count 208 transition count 2240
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3232 place count 208 transition count 2239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3233 place count 207 transition count 2239
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 3250 place count 207 transition count 2222
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 3262 place count 207 transition count 2222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 3266 place count 207 transition count 2218
Applied a total of 3266 rules in 745 ms. Remains 207 /500 variables (removed 293) and now considering 2218/27278 (removed 25060) transitions.
Running SMT prover for 27 properties.
[2023-03-17 21:30:09] [INFO ] Flow matrix only has 2206 transitions (discarded 12 similar events)
// Phase 1: matrix 2206 rows 207 cols
[2023-03-17 21:30:09] [INFO ] Computed 0 place invariants in 33 ms
[2023-03-17 21:30:11] [INFO ] After 2298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-03-17 21:30:13] [INFO ] After 1634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-17 21:30:13] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-17 21:30:14] [INFO ] After 1357ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2023-03-17 21:30:15] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 5 ms to minimize.
[2023-03-17 21:30:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-17 21:30:17] [INFO ] After 3810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 1284 ms.
[2023-03-17 21:30:18] [INFO ] After 6923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 121 stabilizing places and 10286 stable transitions
FORMULA RERS2020-PT-pb103-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 30 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:30:18] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:30:18] [INFO ] Computed 8 place invariants in 126 ms
[2023-03-17 21:30:19] [INFO ] Implicit Places using invariants in 986 ms returned []
Implicit Place search using SMT only with invariants took 998 ms to find 0 implicit places.
[2023-03-17 21:30:19] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:30:19] [INFO ] Invariant cache hit.
[2023-03-17 21:30:28] [INFO ] Dead Transitions using invariants and state equation in 8700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9747 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s88 1) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 8 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-00 finished in 10231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X(p1))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 30 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:30:29] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:30:29] [INFO ] Invariant cache hit.
[2023-03-17 21:30:29] [INFO ] Implicit Places using invariants in 738 ms returned []
Implicit Place search using SMT only with invariants took 738 ms to find 0 implicit places.
[2023-03-17 21:30:29] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:30:29] [INFO ] Invariant cache hit.
[2023-03-17 21:30:38] [INFO ] Dead Transitions using invariants and state equation in 8414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9184 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s8 1) (EQ s308 1)) (AND (EQ s22 1) (EQ s366 1))), p1:(OR (EQ s265 0) (EQ s457 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 70 steps with 2 reset in 5 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-01 finished in 9408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((p1 U G(p2))||p0)&&((p1 U G(p2))||G(F(p3)))))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 547 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-17 21:30:38] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-17 21:30:39] [INFO ] Computed 8 place invariants in 121 ms
[2023-03-17 21:30:39] [INFO ] Implicit Places using invariants in 913 ms returned []
Implicit Place search using SMT only with invariants took 914 ms to find 0 implicit places.
[2023-03-17 21:30:39] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:30:39] [INFO ] Invariant cache hit.
[2023-03-17 21:30:48] [INFO ] Dead Transitions using invariants and state equation in 8617 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10093 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 4}, { cond=(AND p2 p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 4}, { cond=(AND p2 p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p3)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={1} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p2 p1 (NOT p3)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={1} source=3 dest: 5}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND p2 p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p2 p1 (NOT p3)), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s212 1) (EQ s408 1)), p0:(OR (EQ s35 0) (EQ s297 0)), p1:(AND (EQ s35 1) (EQ s297 1)), p3:(OR (EQ s231 0) (EQ s483 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 17147 steps with 0 reset in 474 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-04 finished in 10912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 31 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:30:49] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:30:49] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-17 21:30:50] [INFO ] Implicit Places using invariants in 800 ms returned []
Implicit Place search using SMT only with invariants took 802 ms to find 0 implicit places.
[2023-03-17 21:30:50] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:30:50] [INFO ] Invariant cache hit.
[2023-03-17 21:30:58] [INFO ] Dead Transitions using invariants and state equation in 8569 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9420 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s116 1) (EQ s496 1)) (AND (EQ s11 1) (EQ s62 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-05 finished in 9537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(p2)||p1)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 512 transition count 28428
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 511 transition count 28439
Applied a total of 4 rules in 235 ms. Remains 511 /513 variables (removed 2) and now considering 28439/28429 (removed -10) transitions.
[2023-03-17 21:30:59] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
// Phase 1: matrix 18683 rows 511 cols
[2023-03-17 21:30:59] [INFO ] Computed 8 place invariants in 64 ms
[2023-03-17 21:30:59] [INFO ] Implicit Places using invariants in 842 ms returned []
Implicit Place search using SMT only with invariants took 843 ms to find 0 implicit places.
[2023-03-17 21:30:59] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-17 21:30:59] [INFO ] Invariant cache hit.
[2023-03-17 21:31:08] [INFO ] Dead Transitions using invariants and state equation in 8600 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 511/513 places, 28439/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9694 ms. Remains : 511/513 places, 28439/28429 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s171 1) (NEQ s340 1)), p2:(OR (NEQ s171 1) (NEQ s340 1)), p0:(OR (NEQ s305 1) (NEQ s375 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 2194 ms.
Product exploration explored 100000 steps with 0 reset in 1885 ms.
Computed a total of 119 stabilizing places and 10296 stable transitions
Computed a total of 119 stabilizing places and 10296 stable transitions
Detected a total of 119/511 stabilizing places and 10296/28439 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 528 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 35214 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35214 steps, saw 24141 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 21:31:17] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-17 21:31:17] [INFO ] Invariant cache hit.
[2023-03-17 21:31:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:31:21] [INFO ] After 4018ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-17 21:31:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:31:25] [INFO ] After 3765ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-17 21:31:25] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-17 21:31:33] [INFO ] After 7780ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-17 21:31:35] [INFO ] Deduced a trap composed of 96 places in 1831 ms of which 3 ms to minimize.
[2023-03-17 21:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 2110 ms
[2023-03-17 21:31:35] [INFO ] After 10460ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :0
[2023-03-17 21:31:35] [INFO ] After 14464ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) p0 (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) p0 (NOT p2))))
Knowledge based reduction with 15 factoid took 501 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLFireability-06 finished in 37638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 231 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-17 21:31:36] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-17 21:31:36] [INFO ] Computed 8 place invariants in 49 ms
[2023-03-17 21:31:37] [INFO ] Implicit Places using invariants in 856 ms returned []
Implicit Place search using SMT only with invariants took 866 ms to find 0 implicit places.
[2023-03-17 21:31:37] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:31:37] [INFO ] Invariant cache hit.
[2023-03-17 21:31:46] [INFO ] Dead Transitions using invariants and state equation in 8622 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9729 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s32 0) (EQ s148 0)) (OR (EQ s388 0) (EQ s469 0)) (OR (EQ s32 0) (EQ s92 0)))], 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 0 reset in 1796 ms.
Product exploration explored 100000 steps with 0 reset in 2389 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 37701 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37701 steps, saw 25704 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 21:31:53] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:31:53] [INFO ] Invariant cache hit.
[2023-03-17 21:31:54] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:31:54] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:31:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:31:57] [INFO ] After 3420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:31:57] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-17 21:32:04] [INFO ] After 6781ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:32:07] [INFO ] Deduced a trap composed of 72 places in 1517 ms of which 4 ms to minimize.
[2023-03-17 21:32:09] [INFO ] Deduced a trap composed of 117 places in 1432 ms of which 1 ms to minimize.
[2023-03-17 21:32:11] [INFO ] Deduced a trap composed of 84 places in 1604 ms of which 1 ms to minimize.
[2023-03-17 21:32:12] [INFO ] Deduced a trap composed of 30 places in 1582 ms of which 0 ms to minimize.
[2023-03-17 21:32:15] [INFO ] Deduced a trap composed of 119 places in 1610 ms of which 1 ms to minimize.
[2023-03-17 21:32:17] [INFO ] Deduced a trap composed of 84 places in 1715 ms of which 2 ms to minimize.
[2023-03-17 21:32:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 12252 ms
[2023-03-17 21:32:17] [INFO ] After 20151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 920 ms.
[2023-03-17 21:32:18] [INFO ] After 24705ms 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 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 357 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 37674 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37674 steps, saw 26666 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 21:32:22] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-17 21:32:22] [INFO ] Computed 8 place invariants in 49 ms
[2023-03-17 21:32:22] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:32:22] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:32:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:32:26] [INFO ] After 3280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:32:26] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-17 21:32:33] [INFO ] After 7741ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:32:36] [INFO ] Deduced a trap composed of 13 places in 1560 ms of which 8 ms to minimize.
[2023-03-17 21:32:38] [INFO ] Deduced a trap composed of 12 places in 1632 ms of which 0 ms to minimize.
[2023-03-17 21:32:40] [INFO ] Deduced a trap composed of 72 places in 1522 ms of which 0 ms to minimize.
[2023-03-17 21:32:44] [INFO ] Deduced a trap composed of 60 places in 1374 ms of which 0 ms to minimize.
[2023-03-17 21:32:45] [INFO ] Deduced a trap composed of 139 places in 1539 ms of which 1 ms to minimize.
[2023-03-17 21:32:47] [INFO ] Deduced a trap composed of 76 places in 1465 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:32:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:32:47] [INFO ] After 25317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 107 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 100 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-17 21:32:48] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:32:48] [INFO ] Invariant cache hit.
[2023-03-17 21:32:49] [INFO ] Implicit Places using invariants in 879 ms returned []
Implicit Place search using SMT only with invariants took 880 ms to find 0 implicit places.
[2023-03-17 21:32:49] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:32:49] [INFO ] Invariant cache hit.
[2023-03-17 21:32:57] [INFO ] Dead Transitions using invariants and state equation in 8325 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9330 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10153 edges and 497 vertex of which 376 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 314 places
Drop transitions removed 10777 transitions
Ensure Unique test removed 14072 transitions
Reduce isomorphic transitions removed 24849 transitions.
Graph (complete) has 2519 edges and 183 vertex of which 175 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 175 transition count 2593
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 173 transition count 2593
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 171 transition count 2591
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 171 transition count 2558
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 170 transition count 2568
Drop transitions removed 1384 transitions
Redundant transition composition rules discarded 1384 transitions
Iterating global reduction 3 with 1384 rules applied. Total rules applied 1441 place count 170 transition count 1184
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1384 edges and 168 vertex of which 150 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1452 place count 150 transition count 1174
Drop transitions removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 4 with 109 rules applied. Total rules applied 1561 place count 150 transition count 1065
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1563 place count 148 transition count 1055
Iterating global reduction 5 with 2 rules applied. Total rules applied 1565 place count 148 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1566 place count 148 transition count 1054
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1569 place count 148 transition count 1051
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1576 place count 148 transition count 1044
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1588 place count 141 transition count 1039
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 7 with 55 rules applied. Total rules applied 1643 place count 141 transition count 984
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1645 place count 141 transition count 982
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1647 place count 139 transition count 982
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 1660 place count 139 transition count 969
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1661 place count 139 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1662 place count 138 transition count 968
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1666 place count 138 transition count 1033
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1687 place count 134 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1688 place count 133 transition count 1012
Iterating global reduction 10 with 1 rules applied. Total rules applied 1689 place count 133 transition count 1012
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1698 place count 133 transition count 1003
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 1711 place count 133 transition count 990
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1713 place count 133 transition count 990
Applied a total of 1713 rules in 243 ms. Remains 133 /497 variables (removed 364) and now considering 990/27456 (removed 26466) transitions.
Running SMT prover for 1 properties.
[2023-03-17 21:32:57] [INFO ] Flow matrix only has 952 transitions (discarded 38 similar events)
// Phase 1: matrix 952 rows 133 cols
[2023-03-17 21:32:57] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-17 21:32:58] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:32:58] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:32:58] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-17 21:32:58] [INFO ] After 37ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:32:58] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-17 21:32:58] [INFO ] After 332ms 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 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 110 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-17 21:32:58] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-17 21:32:58] [INFO ] Computed 8 place invariants in 57 ms
[2023-03-17 21:32:59] [INFO ] Implicit Places using invariants in 947 ms returned []
Implicit Place search using SMT only with invariants took 948 ms to find 0 implicit places.
[2023-03-17 21:32:59] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:32:59] [INFO ] Invariant cache hit.
[2023-03-17 21:33:08] [INFO ] Dead Transitions using invariants and state equation in 8661 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9735 ms. Remains : 510/510 places, 28438/28438 transitions.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 37693 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37693 steps, saw 25697 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 21:33:11] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:33:11] [INFO ] Invariant cache hit.
[2023-03-17 21:33:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:33:12] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:33:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:33:15] [INFO ] After 3433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:33:15] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-17 21:33:22] [INFO ] After 6804ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:33:25] [INFO ] Deduced a trap composed of 72 places in 1512 ms of which 1 ms to minimize.
[2023-03-17 21:33:27] [INFO ] Deduced a trap composed of 117 places in 1431 ms of which 1 ms to minimize.
[2023-03-17 21:33:29] [INFO ] Deduced a trap composed of 84 places in 1620 ms of which 0 ms to minimize.
[2023-03-17 21:33:31] [INFO ] Deduced a trap composed of 30 places in 1590 ms of which 1 ms to minimize.
[2023-03-17 21:33:33] [INFO ] Deduced a trap composed of 119 places in 1599 ms of which 3 ms to minimize.
[2023-03-17 21:33:35] [INFO ] Deduced a trap composed of 84 places in 1712 ms of which 1 ms to minimize.
[2023-03-17 21:33:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 12334 ms
[2023-03-17 21:33:36] [INFO ] After 20290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 946 ms.
[2023-03-17 21:33:37] [INFO ] After 24916ms 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 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 510 transition count 27376
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 510 transition count 27364
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 497 transition count 27456
Applied a total of 1176 rules in 396 ms. Remains 497 /510 variables (removed 13) and now considering 27456/28438 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 497/510 places, 27456/28438 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 37453 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37453 steps, saw 26512 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 21:33:40] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-17 21:33:40] [INFO ] Computed 8 place invariants in 57 ms
[2023-03-17 21:33:40] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-17 21:33:40] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:33:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:33:44] [INFO ] After 3336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:33:44] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-17 21:33:52] [INFO ] After 7865ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:33:54] [INFO ] Deduced a trap composed of 13 places in 1582 ms of which 1 ms to minimize.
[2023-03-17 21:33:56] [INFO ] Deduced a trap composed of 12 places in 1523 ms of which 0 ms to minimize.
[2023-03-17 21:33:59] [INFO ] Deduced a trap composed of 72 places in 1515 ms of which 1 ms to minimize.
[2023-03-17 21:34:02] [INFO ] Deduced a trap composed of 60 places in 1358 ms of which 1 ms to minimize.
[2023-03-17 21:34:04] [INFO ] Deduced a trap composed of 139 places in 1622 ms of which 0 ms to minimize.
[2023-03-17 21:34:06] [INFO ] Deduced a trap composed of 76 places in 1377 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:34:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:34:06] [INFO ] After 25397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 94 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 92 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-17 21:34:06] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:34:06] [INFO ] Invariant cache hit.
[2023-03-17 21:34:07] [INFO ] Implicit Places using invariants in 932 ms returned []
Implicit Place search using SMT only with invariants took 946 ms to find 0 implicit places.
[2023-03-17 21:34:07] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-17 21:34:07] [INFO ] Invariant cache hit.
[2023-03-17 21:34:15] [INFO ] Dead Transitions using invariants and state equation in 8223 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9265 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10153 edges and 497 vertex of which 376 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 314 places
Drop transitions removed 10777 transitions
Ensure Unique test removed 14072 transitions
Reduce isomorphic transitions removed 24849 transitions.
Graph (complete) has 2519 edges and 183 vertex of which 175 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 175 transition count 2593
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 173 transition count 2593
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 171 transition count 2591
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 55 place count 171 transition count 2558
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 170 transition count 2568
Drop transitions removed 1384 transitions
Redundant transition composition rules discarded 1384 transitions
Iterating global reduction 3 with 1384 rules applied. Total rules applied 1441 place count 170 transition count 1184
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1384 edges and 168 vertex of which 150 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1452 place count 150 transition count 1174
Drop transitions removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 4 with 109 rules applied. Total rules applied 1561 place count 150 transition count 1065
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1563 place count 148 transition count 1055
Iterating global reduction 5 with 2 rules applied. Total rules applied 1565 place count 148 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1566 place count 148 transition count 1054
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1569 place count 148 transition count 1051
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1576 place count 148 transition count 1044
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1588 place count 141 transition count 1039
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 7 with 55 rules applied. Total rules applied 1643 place count 141 transition count 984
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1645 place count 141 transition count 982
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1647 place count 139 transition count 982
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 1660 place count 139 transition count 969
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1661 place count 139 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1662 place count 138 transition count 968
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1666 place count 138 transition count 1033
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1687 place count 134 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1688 place count 133 transition count 1012
Iterating global reduction 10 with 1 rules applied. Total rules applied 1689 place count 133 transition count 1012
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1698 place count 133 transition count 1003
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 1711 place count 133 transition count 990
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1713 place count 133 transition count 990
Applied a total of 1713 rules in 204 ms. Remains 133 /497 variables (removed 364) and now considering 990/27456 (removed 26466) transitions.
Running SMT prover for 1 properties.
[2023-03-17 21:34:15] [INFO ] Flow matrix only has 952 transitions (discarded 38 similar events)
// Phase 1: matrix 952 rows 133 cols
[2023-03-17 21:34:15] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-17 21:34:16] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:34:16] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:34:16] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-17 21:34:16] [INFO ] After 36ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:34:16] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-17 21:34:16] [INFO ] After 316ms 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 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 2194 ms.
Product exploration explored 100000 steps with 0 reset in 2294 ms.
Support contains 5 out of 510 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 510/510 places, 28438/28438 transitions.
Applied a total of 0 rules in 100 ms. Remains 510 /510 variables (removed 0) and now considering 28438/28438 (removed 0) transitions.
[2023-03-17 21:34:21] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-17 21:34:21] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-17 21:34:22] [INFO ] Implicit Places using invariants in 818 ms returned []
Implicit Place search using SMT only with invariants took 823 ms to find 0 implicit places.
[2023-03-17 21:34:22] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:34:22] [INFO ] Invariant cache hit.
[2023-03-17 21:34:30] [INFO ] Dead Transitions using invariants and state equation in 8565 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9500 ms. Remains : 510/510 places, 28438/28438 transitions.
Treatment of property RERS2020-PT-pb103-LTLFireability-07 finished in 175658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)||(G(p2)&&p1))))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 160 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:34:32] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:34:32] [INFO ] Computed 8 place invariants in 177 ms
[2023-03-17 21:34:33] [INFO ] Implicit Places using invariants in 920 ms returned []
Implicit Place search using SMT only with invariants took 930 ms to find 0 implicit places.
[2023-03-17 21:34:33] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:34:33] [INFO ] Invariant cache hit.
[2023-03-17 21:34:41] [INFO ] Dead Transitions using invariants and state equation in 8624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9717 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (EQ s438 1) (EQ s446 1)), p1:(AND (EQ s158 1) (EQ s252 1)), p2:(OR (NEQ s7 1) (NEQ s377 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 3 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-08 finished in 10001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 29 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:34:42] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:34:42] [INFO ] Invariant cache hit.
[2023-03-17 21:34:42] [INFO ] Implicit Places using invariants in 728 ms returned []
Implicit Place search using SMT only with invariants took 753 ms to find 0 implicit places.
[2023-03-17 21:34:42] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:34:42] [INFO ] Invariant cache hit.
[2023-03-17 21:34:51] [INFO ] Dead Transitions using invariants and state equation in 8605 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9406 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s34 1) (EQ s331 1)), p1:(AND (EQ s65 1) (EQ s418 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-09 finished in 9547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(p1||G(p2)))))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 248 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-17 21:34:51] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
// Phase 1: matrix 18682 rows 510 cols
[2023-03-17 21:34:51] [INFO ] Computed 8 place invariants in 51 ms
[2023-03-17 21:34:52] [INFO ] Implicit Places using invariants in 779 ms returned []
Implicit Place search using SMT only with invariants took 790 ms to find 0 implicit places.
[2023-03-17 21:34:52] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:34:52] [INFO ] Invariant cache hit.
[2023-03-17 21:35:01] [INFO ] Dead Transitions using invariants and state equation in 8666 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9707 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s109 1) (EQ s450 1)), p2:(AND (EQ s22 1) (EQ s473 1)), p0:(AND (OR (EQ s231 0) (EQ s454 0)) (OR (EQ s22 0) (EQ s473 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 2 ms.
FORMULA RERS2020-PT-pb103-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb103-LTLFireability-10 finished in 9906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 511 transition count 28427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 28438
Applied a total of 4 rules in 226 ms. Remains 510 /513 variables (removed 3) and now considering 28438/28429 (removed -9) transitions.
[2023-03-17 21:35:01] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:35:01] [INFO ] Invariant cache hit.
[2023-03-17 21:35:02] [INFO ] Implicit Places using invariants in 754 ms returned []
Implicit Place search using SMT only with invariants took 763 ms to find 0 implicit places.
[2023-03-17 21:35:02] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:35:02] [INFO ] Invariant cache hit.
[2023-03-17 21:35:11] [INFO ] Dead Transitions using invariants and state equation in 8487 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 510/513 places, 28438/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9504 ms. Remains : 510/513 places, 28438/28429 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-12 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}]], initial=1, aps=[p0:(OR (EQ s212 0) (EQ s487 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 2202 ms.
Product exploration explored 100000 steps with 0 reset in 1781 ms.
Computed a total of 118 stabilizing places and 10295 stable transitions
Computed a total of 118 stabilizing places and 10295 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 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 34 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 37677 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 37677 steps, saw 25687 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 21:35:18] [INFO ] Flow matrix only has 18682 transitions (discarded 9756 similar events)
[2023-03-17 21:35:18] [INFO ] Invariant cache hit.
[2023-03-17 21:35:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:35:22] [INFO ] After 3481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:35:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:35:25] [INFO ] After 3495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:35:25] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-17 21:35:31] [INFO ] After 5498ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:35:33] [INFO ] Deduced a trap composed of 72 places in 1568 ms of which 0 ms to minimize.
[2023-03-17 21:35:35] [INFO ] Deduced a trap composed of 49 places in 1321 ms of which 0 ms to minimize.
[2023-03-17 21:35:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 3458 ms
[2023-03-17 21:35:35] [INFO ] After 9268ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-17 21:35:35] [INFO ] After 12988ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLFireability-12 finished in 33709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||(X(p3)&&p2)||p0)))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 30 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:35:35] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:35:35] [INFO ] Computed 8 place invariants in 48 ms
[2023-03-17 21:35:36] [INFO ] Implicit Places using invariants in 809 ms returned []
Implicit Place search using SMT only with invariants took 827 ms to find 0 implicit places.
[2023-03-17 21:35:36] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:35:36] [INFO ] Invariant cache hit.
[2023-03-17 21:35:44] [INFO ] Dead Transitions using invariants and state equation in 8591 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9451 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2 p1) (AND (NOT p0) p2 p3)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(AND (EQ s48 1) (EQ s149 1)), p0:(OR (EQ s48 0) (EQ s149 0)), p2:(AND (EQ s48 1) (EQ s149 1)), p3:(AND (EQ s147 1) (EQ s344 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1726 ms.
Product exploration explored 100000 steps with 1 reset in 1784 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 824 ms. (steps per millisecond=12 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 33749 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33749 steps, saw 23161 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-17 21:35:54] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:35:54] [INFO ] Invariant cache hit.
[2023-03-17 21:35:54] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:35:58] [INFO ] After 4079ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:7
[2023-03-17 21:35:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:36:03] [INFO ] After 5360ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2023-03-17 21:36:03] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-17 21:36:11] [INFO ] After 7276ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :4 sat :7
[2023-03-17 21:36:13] [INFO ] Deduced a trap composed of 49 places in 1811 ms of which 1 ms to minimize.
[2023-03-17 21:36:15] [INFO ] Deduced a trap composed of 59 places in 1500 ms of which 1 ms to minimize.
[2023-03-17 21:36:17] [INFO ] Deduced a trap composed of 53 places in 1662 ms of which 1 ms to minimize.
[2023-03-17 21:36:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 6221 ms
[2023-03-17 21:36:20] [INFO ] Deduced a trap composed of 50 places in 1928 ms of which 0 ms to minimize.
[2023-03-17 21:36:22] [INFO ] Deduced a trap composed of 22 places in 1788 ms of which 1 ms to minimize.
[2023-03-17 21:36:24] [INFO ] Deduced a trap composed of 128 places in 1446 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:36:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:36:24] [INFO ] After 25967ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0 real:7
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 513 transition count 27367
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1064 place count 512 transition count 27366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1066 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1078 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1178 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1179 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1180 place count 498 transition count 27457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1181 place count 497 transition count 27456
Applied a total of 1181 rules in 555 ms. Remains 497 /513 variables (removed 16) and now considering 27456/28429 (removed 973) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 555 ms. Remains : 497/513 places, 27456/28429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 34197 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34197 steps, saw 24372 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-17 21:36:28] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-17 21:36:28] [INFO ] Computed 8 place invariants in 43 ms
[2023-03-17 21:36:29] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:36:29] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-17 21:36:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:36:34] [INFO ] After 4638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-17 21:36:34] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-17 21:36:41] [INFO ] After 7204ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-17 21:36:43] [INFO ] Deduced a trap composed of 51 places in 1860 ms of which 1 ms to minimize.
[2023-03-17 21:36:45] [INFO ] Deduced a trap composed of 39 places in 1629 ms of which 1 ms to minimize.
[2023-03-17 21:36:47] [INFO ] Deduced a trap composed of 155 places in 1526 ms of which 1 ms to minimize.
[2023-03-17 21:36:49] [INFO ] Deduced a trap composed of 150 places in 1692 ms of which 0 ms to minimize.
[2023-03-17 21:36:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 7990 ms
[2023-03-17 21:36:49] [INFO ] After 15698ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :0
[2023-03-17 21:36:49] [INFO ] After 20608ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 11 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (AND (NOT p1) (NOT p3))), (G (NOT (AND p1 p0))), (G (NOT (OR (AND p1 (NOT p0) p2) (AND p3 (NOT p0) p2)))), (G (NOT (OR (AND p1 (NOT p0) (NOT p2)) (AND p3 (NOT p0) (NOT p2))))), (G (NOT p1)), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G p0), (G (NOT (OR (AND p1 p0) (AND p3 p0)))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 15 factoid took 447 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLFireability-13 finished in 75018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 6 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Applied a total of 0 rules in 32 ms. Remains 513 /513 variables (removed 0) and now considering 28429/28429 (removed 0) transitions.
[2023-03-17 21:36:50] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 513 cols
[2023-03-17 21:36:50] [INFO ] Computed 8 place invariants in 45 ms
[2023-03-17 21:36:51] [INFO ] Implicit Places using invariants in 806 ms returned []
Implicit Place search using SMT only with invariants took 820 ms to find 0 implicit places.
[2023-03-17 21:36:51] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:36:51] [INFO ] Invariant cache hit.
[2023-03-17 21:36:59] [INFO ] Dead Transitions using invariants and state equation in 8656 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9509 ms. Remains : 513/513 places, 28429/28429 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s358 0) (EQ s444 0)), p0:(AND (OR (EQ s358 0) (EQ s444 0)) (OR (EQ s46 0) (EQ s90 0)) (OR (EQ s481 0) (EQ s498 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2163 ms.
Product exploration explored 100000 steps with 0 reset in 1793 ms.
Computed a total of 121 stabilizing places and 10286 stable transitions
Computed a total of 121 stabilizing places and 10286 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 36680 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 36680 steps, saw 25055 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 21:37:07] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
[2023-03-17 21:37:07] [INFO ] Invariant cache hit.
[2023-03-17 21:37:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:37:11] [INFO ] After 3596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 21:37:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:37:14] [INFO ] After 3466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 21:37:14] [INFO ] State equation strengthened by 1379 read => feed constraints.
[2023-03-17 21:37:19] [INFO ] After 4901ms SMT Verify possible using 1379 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 21:37:21] [INFO ] Deduced a trap composed of 96 places in 1513 ms of which 1 ms to minimize.
[2023-03-17 21:37:23] [INFO ] Deduced a trap composed of 61 places in 1706 ms of which 1 ms to minimize.
[2023-03-17 21:37:25] [INFO ] Deduced a trap composed of 50 places in 1582 ms of which 1 ms to minimize.
[2023-03-17 21:37:27] [INFO ] Deduced a trap composed of 155 places in 1651 ms of which 1 ms to minimize.
[2023-03-17 21:37:30] [INFO ] Deduced a trap composed of 22 places in 1912 ms of which 1 ms to minimize.
[2023-03-17 21:37:32] [INFO ] Deduced a trap composed of 135 places in 1916 ms of which 1 ms to minimize.
[2023-03-17 21:37:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 12210 ms
[2023-03-17 21:37:32] [INFO ] After 17485ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-17 21:37:32] [INFO ] After 21157ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X p1)), (G p1)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p1)
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb103-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb103-LTLFireability-14 finished in 42273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 28429/28429 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 512 transition count 28428
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 511 transition count 28439
Applied a total of 4 rules in 243 ms. Remains 511 /513 variables (removed 2) and now considering 28439/28429 (removed -10) transitions.
[2023-03-17 21:37:32] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
// Phase 1: matrix 18683 rows 511 cols
[2023-03-17 21:37:32] [INFO ] Computed 8 place invariants in 55 ms
[2023-03-17 21:37:33] [INFO ] Implicit Places using invariants in 780 ms returned []
Implicit Place search using SMT only with invariants took 789 ms to find 0 implicit places.
[2023-03-17 21:37:33] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-17 21:37:33] [INFO ] Invariant cache hit.
[2023-03-17 21:37:42] [INFO ] Dead Transitions using invariants and state equation in 8741 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 511/513 places, 28439/28429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9790 ms. Remains : 511/513 places, 28439/28429 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb103-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s349 1) (EQ s426 1)), p1:(OR (EQ s150 0) (EQ s322 0))], nbAcceptance=2, 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 0 reset in 2074 ms.
Product exploration explored 100000 steps with 0 reset in 1865 ms.
Computed a total of 119 stabilizing places and 10296 stable transitions
Computed a total of 119 stabilizing places and 10296 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 366 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 35683 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35683 steps, saw 24451 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 21:37:50] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-17 21:37:50] [INFO ] Invariant cache hit.
[2023-03-17 21:37:50] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:37:54] [INFO ] After 4288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 21:37:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:37:59] [INFO ] After 4922ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 21:38:00] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-17 21:38:05] [INFO ] After 5926ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 21:38:08] [INFO ] Deduced a trap composed of 44 places in 1742 ms of which 1 ms to minimize.
[2023-03-17 21:38:10] [INFO ] Deduced a trap composed of 73 places in 1594 ms of which 1 ms to minimize.
[2023-03-17 21:38:12] [INFO ] Deduced a trap composed of 61 places in 1586 ms of which 1 ms to minimize.
[2023-03-17 21:38:14] [INFO ] Deduced a trap composed of 31 places in 1511 ms of which 1 ms to minimize.
[2023-03-17 21:38:16] [INFO ] Deduced a trap composed of 84 places in 1706 ms of which 1 ms to minimize.
[2023-03-17 21:38:17] [INFO ] Deduced a trap composed of 96 places in 1281 ms of which 0 ms to minimize.
[2023-03-17 21:38:19] [INFO ] Deduced a trap composed of 69 places in 1689 ms of which 1 ms to minimize.
[2023-03-17 21:38:19] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 13665 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:38:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:38:19] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 28439/28439 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 498 transition count 27457
Applied a total of 1176 rules in 368 ms. Remains 498 /511 variables (removed 13) and now considering 27457/28439 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 369 ms. Remains : 498/511 places, 27457/28439 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 35408 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35408 steps, saw 25177 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 21:38:23] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
// Phase 1: matrix 18728 rows 498 cols
[2023-03-17 21:38:24] [INFO ] Computed 8 place invariants in 48 ms
[2023-03-17 21:38:24] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:38:28] [INFO ] After 4068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 21:38:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:38:32] [INFO ] After 4656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 21:38:33] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-17 21:38:40] [INFO ] After 7639ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 21:38:42] [INFO ] Deduced a trap composed of 48 places in 1653 ms of which 7 ms to minimize.
[2023-03-17 21:38:44] [INFO ] Deduced a trap composed of 20 places in 1412 ms of which 1 ms to minimize.
[2023-03-17 21:38:46] [INFO ] Deduced a trap composed of 50 places in 1402 ms of which 0 ms to minimize.
[2023-03-17 21:38:47] [INFO ] Deduced a trap composed of 73 places in 958 ms of which 1 ms to minimize.
[2023-03-17 21:38:49] [INFO ] Deduced a trap composed of 93 places in 1149 ms of which 0 ms to minimize.
[2023-03-17 21:38:51] [INFO ] Deduced a trap composed of 102 places in 1716 ms of which 1 ms to minimize.
[2023-03-17 21:38:53] [INFO ] Deduced a trap composed of 148 places in 1673 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:38:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:38:53] [INFO ] After 25283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 104 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 498/498 places, 27457/27457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 132 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
[2023-03-17 21:38:53] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
[2023-03-17 21:38:53] [INFO ] Invariant cache hit.
[2023-03-17 21:38:54] [INFO ] Implicit Places using invariants in 858 ms returned []
Implicit Place search using SMT only with invariants took 874 ms to find 0 implicit places.
[2023-03-17 21:38:54] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
[2023-03-17 21:38:54] [INFO ] Invariant cache hit.
[2023-03-17 21:39:02] [INFO ] Dead Transitions using invariants and state equation in 8232 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9250 ms. Remains : 498/498 places, 27457/27457 transitions.
Graph (trivial) has 10049 edges and 498 vertex of which 377 / 498 are part of one of the 61 SCC in 1 ms
Free SCC test removed 316 places
Drop transitions removed 11111 transitions
Ensure Unique test removed 13707 transitions
Reduce isomorphic transitions removed 24818 transitions.
Graph (complete) has 2436 edges and 182 vertex of which 174 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 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 13 rules applied. Total rules applied 15 place count 174 transition count 2626
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 172 transition count 2626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 170 transition count 2606
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 170 transition count 2606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 170 transition count 2605
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 169 transition count 2604
Drop transitions removed 1442 transitions
Redundant transition composition rules discarded 1442 transitions
Iterating global reduction 3 with 1442 rules applied. Total rules applied 1466 place count 169 transition count 1162
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1430 edges and 168 vertex of which 153 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 4 rules applied. Total rules applied 1470 place count 153 transition count 1158
Drop transitions removed 52 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 1523 place count 153 transition count 1105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1524 place count 152 transition count 1100
Iterating global reduction 5 with 1 rules applied. Total rules applied 1525 place count 152 transition count 1100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1529 place count 150 transition count 1098
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 1540 place count 150 transition count 1087
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1552 place count 150 transition count 1068
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1574 place count 138 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1575 place count 137 transition count 1053
Iterating global reduction 6 with 1 rules applied. Total rules applied 1576 place count 137 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1577 place count 137 transition count 1052
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 7 with 57 rules applied. Total rules applied 1634 place count 137 transition count 995
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1640 place count 137 transition count 989
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1650 place count 131 transition count 985
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1656 place count 131 transition count 979
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1658 place count 131 transition count 977
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1662 place count 129 transition count 975
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1666 place count 129 transition count 971
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1668 place count 129 transition count 969
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1672 place count 127 transition count 967
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1674 place count 127 transition count 965
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1677 place count 127 transition count 1047
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1691 place count 124 transition count 1036
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 1710 place count 124 transition count 1017
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1715 place count 124 transition count 1017
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1718 place count 124 transition count 1014
Applied a total of 1718 rules in 307 ms. Remains 124 /498 variables (removed 374) and now considering 1014/27457 (removed 26443) transitions.
Running SMT prover for 4 properties.
[2023-03-17 21:39:03] [INFO ] Flow matrix only has 979 transitions (discarded 35 similar events)
// Phase 1: matrix 979 rows 124 cols
[2023-03-17 21:39:03] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-17 21:39:03] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 21:39:03] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 21:39:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-17 21:39:03] [INFO ] After 182ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 21:39:04] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-03-17 21:39:04] [INFO ] After 965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 28439/28439 transitions.
Applied a total of 0 rules in 102 ms. Remains 511 /511 variables (removed 0) and now considering 28439/28439 (removed 0) transitions.
[2023-03-17 21:39:04] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
// Phase 1: matrix 18683 rows 511 cols
[2023-03-17 21:39:05] [INFO ] Computed 8 place invariants in 55 ms
[2023-03-17 21:39:05] [INFO ] Implicit Places using invariants in 793 ms returned []
Implicit Place search using SMT only with invariants took 804 ms to find 0 implicit places.
[2023-03-17 21:39:05] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-17 21:39:05] [INFO ] Invariant cache hit.
[2023-03-17 21:39:14] [INFO ] Dead Transitions using invariants and state equation in 8652 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9571 ms. Remains : 511/511 places, 28439/28439 transitions.
Computed a total of 119 stabilizing places and 10296 stable transitions
Computed a total of 119 stabilizing places and 10296 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 308 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 35813 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35813 steps, saw 24518 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 21:39:18] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-17 21:39:18] [INFO ] Invariant cache hit.
[2023-03-17 21:39:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:39:22] [INFO ] After 4130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 21:39:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:39:27] [INFO ] After 4807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 21:39:27] [INFO ] State equation strengthened by 1380 read => feed constraints.
[2023-03-17 21:39:33] [INFO ] After 5640ms SMT Verify possible using 1380 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 21:39:35] [INFO ] Deduced a trap composed of 44 places in 1678 ms of which 2 ms to minimize.
[2023-03-17 21:39:37] [INFO ] Deduced a trap composed of 73 places in 1532 ms of which 0 ms to minimize.
[2023-03-17 21:39:39] [INFO ] Deduced a trap composed of 61 places in 1550 ms of which 10 ms to minimize.
[2023-03-17 21:39:41] [INFO ] Deduced a trap composed of 31 places in 1451 ms of which 10 ms to minimize.
[2023-03-17 21:39:43] [INFO ] Deduced a trap composed of 84 places in 1660 ms of which 14 ms to minimize.
[2023-03-17 21:39:44] [INFO ] Deduced a trap composed of 96 places in 1271 ms of which 0 ms to minimize.
[2023-03-17 21:39:46] [INFO ] Deduced a trap composed of 69 places in 1651 ms of which 1 ms to minimize.
[2023-03-17 21:39:48] [INFO ] Deduced a trap composed of 50 places in 1310 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:39:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:39:48] [INFO ] After 25866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 28439/28439 transitions.
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1062 rules applied. Total rules applied 1062 place count 511 transition count 27377
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 1074 place count 511 transition count 27365
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1174 place count 499 transition count 27277
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1175 place count 499 transition count 27457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 498 transition count 27457
Applied a total of 1176 rules in 379 ms. Remains 498 /511 variables (removed 13) and now considering 27457/28439 (removed 982) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 498/511 places, 27457/28439 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 34188 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34188 steps, saw 24364 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-17 21:39:52] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
// Phase 1: matrix 18728 rows 498 cols
[2023-03-17 21:39:52] [INFO ] Computed 8 place invariants in 43 ms
[2023-03-17 21:39:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-17 21:39:56] [INFO ] After 4023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 21:39:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 21:40:01] [INFO ] After 4708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 21:40:01] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-17 21:40:09] [INFO ] After 7986ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 21:40:12] [INFO ] Deduced a trap composed of 48 places in 1637 ms of which 1 ms to minimize.
[2023-03-17 21:40:13] [INFO ] Deduced a trap composed of 20 places in 1394 ms of which 0 ms to minimize.
[2023-03-17 21:40:15] [INFO ] Deduced a trap composed of 50 places in 1442 ms of which 0 ms to minimize.
[2023-03-17 21:40:16] [INFO ] Deduced a trap composed of 73 places in 969 ms of which 1 ms to minimize.
[2023-03-17 21:40:18] [INFO ] Deduced a trap composed of 93 places in 1150 ms of which 0 ms to minimize.
[2023-03-17 21:40:20] [INFO ] Deduced a trap composed of 102 places in 1706 ms of which 1 ms to minimize.
[2023-03-17 21:40:22] [INFO ] Deduced a trap composed of 148 places in 1719 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-17 21:40:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 21:40:22] [INFO ] After 25730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 91 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 498/498 places, 27457/27457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 27457/27457 transitions.
Applied a total of 0 rules in 89 ms. Remains 498 /498 variables (removed 0) and now considering 27457/27457 (removed 0) transitions.
[2023-03-17 21:40:22] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
[2023-03-17 21:40:22] [INFO ] Invariant cache hit.
[2023-03-17 21:40:23] [INFO ] Implicit Places using invariants in 854 ms returned []
Implicit Place search using SMT only with invariants took 880 ms to find 0 implicit places.
[2023-03-17 21:40:23] [INFO ] Flow matrix only has 18728 transitions (discarded 8729 similar events)
[2023-03-17 21:40:23] [INFO ] Invariant cache hit.
[2023-03-17 21:40:32] [INFO ] Dead Transitions using invariants and state equation in 8469 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9455 ms. Remains : 498/498 places, 27457/27457 transitions.
Graph (trivial) has 10049 edges and 498 vertex of which 377 / 498 are part of one of the 61 SCC in 1 ms
Free SCC test removed 316 places
Drop transitions removed 11111 transitions
Ensure Unique test removed 13707 transitions
Reduce isomorphic transitions removed 24818 transitions.
Graph (complete) has 2436 edges and 182 vertex of which 174 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 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 13 rules applied. Total rules applied 15 place count 174 transition count 2626
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 172 transition count 2626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 170 transition count 2606
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 170 transition count 2606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 170 transition count 2605
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 169 transition count 2604
Drop transitions removed 1442 transitions
Redundant transition composition rules discarded 1442 transitions
Iterating global reduction 3 with 1442 rules applied. Total rules applied 1466 place count 169 transition count 1162
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1430 edges and 168 vertex of which 153 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 4 rules applied. Total rules applied 1470 place count 153 transition count 1158
Drop transitions removed 52 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 1523 place count 153 transition count 1105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1524 place count 152 transition count 1100
Iterating global reduction 5 with 1 rules applied. Total rules applied 1525 place count 152 transition count 1100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1529 place count 150 transition count 1098
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 1540 place count 150 transition count 1087
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 1552 place count 150 transition count 1068
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1574 place count 138 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1575 place count 137 transition count 1053
Iterating global reduction 6 with 1 rules applied. Total rules applied 1576 place count 137 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1577 place count 137 transition count 1052
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 7 with 57 rules applied. Total rules applied 1634 place count 137 transition count 995
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1640 place count 137 transition count 989
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1650 place count 131 transition count 985
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1656 place count 131 transition count 979
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1658 place count 131 transition count 977
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1662 place count 129 transition count 975
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1666 place count 129 transition count 971
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1668 place count 129 transition count 969
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1672 place count 127 transition count 967
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1674 place count 127 transition count 965
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1677 place count 127 transition count 1047
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1691 place count 124 transition count 1036
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 1710 place count 124 transition count 1017
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1715 place count 124 transition count 1017
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1718 place count 124 transition count 1014
Applied a total of 1718 rules in 231 ms. Remains 124 /498 variables (removed 374) and now considering 1014/27457 (removed 26443) transitions.
Running SMT prover for 4 properties.
[2023-03-17 21:40:32] [INFO ] Flow matrix only has 979 transitions (discarded 35 similar events)
// Phase 1: matrix 979 rows 124 cols
[2023-03-17 21:40:32] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-17 21:40:32] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 21:40:33] [INFO ] After 319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 21:40:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-17 21:40:33] [INFO ] After 184ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 21:40:33] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-03-17 21:40:33] [INFO ] After 1023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 302 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 2199 ms.
Product exploration explored 100000 steps with 0 reset in 1784 ms.
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 28439/28439 transitions.
Applied a total of 0 rules in 100 ms. Remains 511 /511 variables (removed 0) and now considering 28439/28439 (removed 0) transitions.
[2023-03-17 21:40:38] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
// Phase 1: matrix 18683 rows 511 cols
[2023-03-17 21:40:38] [INFO ] Computed 8 place invariants in 57 ms
[2023-03-17 21:40:39] [INFO ] Implicit Places using invariants in 789 ms returned []
Implicit Place search using SMT only with invariants took 802 ms to find 0 implicit places.
[2023-03-17 21:40:39] [INFO ] Flow matrix only has 18683 transitions (discarded 9756 similar events)
[2023-03-17 21:40:39] [INFO ] Invariant cache hit.
[2023-03-17 21:40:47] [INFO ] Dead Transitions using invariants and state equation in 8656 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9560 ms. Remains : 511/511 places, 28439/28439 transitions.
Treatment of property RERS2020-PT-pb103-LTLFireability-15 finished in 195858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2023-03-17 21:40:49] [INFO ] Flatten gal took : 735 ms
[2023-03-17 21:40:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-17 21:40:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 513 places, 28429 transitions and 113003 arcs took 87 ms.
Total runtime 748957 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1627/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1627/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : RERS2020-PT-pb103-LTLFireability-07
Could not compute solution for formula : RERS2020-PT-pb103-LTLFireability-15

BK_STOP 1679089263217

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name RERS2020-PT-pb103-LTLFireability-07
ltl formula formula --ltl=/tmp/1627/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 513 places, 28429 transitions and 113003 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.700 real 0.720 user 0.860 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1627/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1627/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1627/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1627/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name RERS2020-PT-pb103-LTLFireability-15
ltl formula formula --ltl=/tmp/1627/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 513 places, 28429 transitions and 113003 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.270 real 0.700 user 0.640 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1627/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1627/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1627/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1627/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="RERS2020-PT-pb103"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is RERS2020-PT-pb103, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-167889201800236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb103.tgz
mv RERS2020-PT-pb103 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;