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.r489-tall-167912706800476.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 Szymanski-PT-b08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706800476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b08-LTLFireability-00
FORMULA_NAME Szymanski-PT-b08-LTLFireability-01
FORMULA_NAME Szymanski-PT-b08-LTLFireability-02
FORMULA_NAME Szymanski-PT-b08-LTLFireability-03
FORMULA_NAME Szymanski-PT-b08-LTLFireability-04
FORMULA_NAME Szymanski-PT-b08-LTLFireability-05
FORMULA_NAME Szymanski-PT-b08-LTLFireability-06
FORMULA_NAME Szymanski-PT-b08-LTLFireability-07
FORMULA_NAME Szymanski-PT-b08-LTLFireability-08
FORMULA_NAME Szymanski-PT-b08-LTLFireability-09
FORMULA_NAME Szymanski-PT-b08-LTLFireability-10
FORMULA_NAME Szymanski-PT-b08-LTLFireability-11
FORMULA_NAME Szymanski-PT-b08-LTLFireability-12
FORMULA_NAME Szymanski-PT-b08-LTLFireability-13
FORMULA_NAME Szymanski-PT-b08-LTLFireability-14
FORMULA_NAME Szymanski-PT-b08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679255797983

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=Szymanski-PT-b08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 19:56:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 19:56:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:56:39] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2023-03-19 19:56:39] [INFO ] Transformed 568 places.
[2023-03-19 19:56:39] [INFO ] Transformed 8320 transitions.
[2023-03-19 19:56:39] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 481 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Applied a total of 2 rules in 129 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2023-03-19 19:56:40] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2023-03-19 19:56:40] [INFO ] Computed 1 place invariants in 67 ms
[2023-03-19 19:56:40] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-19 19:56:40] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 19:56:40] [INFO ] Invariant cache hit.
[2023-03-19 19:56:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:56:44] [INFO ] Implicit Places using invariants and state equation in 3378 ms returned []
Implicit Place search using SMT with State Equation took 3976 ms to find 0 implicit places.
[2023-03-19 19:56:44] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 19:56:44] [INFO ] Invariant cache hit.
[2023-03-19 19:56:46] [INFO ] Dead Transitions using invariants and state equation in 2094 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 8064/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6203 ms. Remains : 306/308 places, 8064/8064 transitions.
Support contains 53 out of 306 places after structural reductions.
[2023-03-19 19:56:46] [INFO ] Flatten gal took : 401 ms
[2023-03-19 19:56:47] [INFO ] Flatten gal took : 315 ms
[2023-03-19 19:56:47] [INFO ] Input system was already deterministic with 8064 transitions.
Incomplete random walk after 10002 steps, including 4 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 34) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :3
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 :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-19 19:56:48] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 19:56:48] [INFO ] Invariant cache hit.
[2023-03-19 19:56:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 19:56:51] [INFO ] After 3046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-19 19:56:51] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 19:57:04] [INFO ] After 12952ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-19 19:57:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:57:16] [INFO ] After 11763ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-19 19:57:16] [INFO ] After 11765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 19:57:16] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 732 ms.
Support contains 36 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 306 transition count 7953
Applied a total of 111 rules in 443 ms. Remains 306 /306 variables (removed 0) and now considering 7953/8064 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 306/306 places, 7953/8064 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 110291 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{15=1}
Probabilistic random walk after 110291 steps, saw 73180 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :1
Running SMT prover for 20 properties.
[2023-03-19 19:57:20] [INFO ] Flow matrix only has 2622 transitions (discarded 5331 similar events)
// Phase 1: matrix 2622 rows 306 cols
[2023-03-19 19:57:21] [INFO ] Computed 1 place invariants in 25 ms
[2023-03-19 19:57:21] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 19:57:24] [INFO ] After 3248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-19 19:57:24] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 19:57:35] [INFO ] After 11340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-19 19:57:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:57:49] [INFO ] After 13434ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-19 19:57:49] [INFO ] After 13438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 19:57:49] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 219 ms.
Support contains 34 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7953/7953 transitions.
Applied a total of 0 rules in 213 ms. Remains 306 /306 variables (removed 0) and now considering 7953/7953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 306/306 places, 7953/7953 transitions.
Incomplete random walk after 10007 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 110377 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110377 steps, saw 73249 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 19 properties.
[2023-03-19 19:57:52] [INFO ] Flow matrix only has 2622 transitions (discarded 5331 similar events)
[2023-03-19 19:57:52] [INFO ] Invariant cache hit.
[2023-03-19 19:57:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 19:57:55] [INFO ] After 2806ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-19 19:57:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 19:58:03] [INFO ] After 6982ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-19 19:58:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:58:19] [INFO ] After 16547ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-19 19:58:20] [INFO ] After 17803ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 19:58:20] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 153 ms.
Support contains 32 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7953/7953 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 306 transition count 7952
Applied a total of 1 rules in 330 ms. Remains 306 /306 variables (removed 0) and now considering 7952/7953 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 331 ms. Remains : 306/306 places, 7952/7953 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 115186 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115186 steps, saw 76932 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 19 properties.
[2023-03-19 19:58:24] [INFO ] Flow matrix only has 2621 transitions (discarded 5331 similar events)
// Phase 1: matrix 2621 rows 306 cols
[2023-03-19 19:58:24] [INFO ] Computed 1 place invariants in 18 ms
[2023-03-19 19:58:24] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 19:58:29] [INFO ] After 4722ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-19 19:58:29] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 19:58:39] [INFO ] After 10243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-19 19:58:39] [INFO ] State equation strengthened by 147 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
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.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
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-19 19:58:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 19:58:54] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Parikh walk visited 0 properties in 440 ms.
Support contains 32 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7952/7952 transitions.
Applied a total of 0 rules in 213 ms. Remains 306 /306 variables (removed 0) and now considering 7952/7952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 306/306 places, 7952/7952 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7952/7952 transitions.
Applied a total of 0 rules in 211 ms. Remains 306 /306 variables (removed 0) and now considering 7952/7952 (removed 0) transitions.
[2023-03-19 19:58:55] [INFO ] Flow matrix only has 2621 transitions (discarded 5331 similar events)
[2023-03-19 19:58:55] [INFO ] Invariant cache hit.
[2023-03-19 19:58:55] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-19 19:58:55] [INFO ] Flow matrix only has 2621 transitions (discarded 5331 similar events)
[2023-03-19 19:58:55] [INFO ] Invariant cache hit.
[2023-03-19 19:58:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:59:03] [INFO ] Implicit Places using invariants and state equation in 8285 ms returned []
Implicit Place search using SMT with State Equation took 8663 ms to find 0 implicit places.
[2023-03-19 19:59:04] [INFO ] Redundant transitions in 1014 ms returned []
[2023-03-19 19:59:04] [INFO ] Flow matrix only has 2621 transitions (discarded 5331 similar events)
[2023-03-19 19:59:04] [INFO ] Invariant cache hit.
[2023-03-19 19:59:06] [INFO ] Dead Transitions using invariants and state equation in 1932 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11837 ms. Remains : 306/306 places, 7952/7952 transitions.
Computed a total of 12 stabilizing places and 2432 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 109 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 19:59:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 19:59:07] [INFO ] Computed 1 place invariants in 24 ms
[2023-03-19 19:59:07] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-19 19:59:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:07] [INFO ] Invariant cache hit.
[2023-03-19 19:59:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:59:15] [INFO ] Implicit Places using invariants and state equation in 7436 ms returned []
Implicit Place search using SMT with State Equation took 7883 ms to find 0 implicit places.
[2023-03-19 19:59:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:15] [INFO ] Invariant cache hit.
[2023-03-19 19:59:17] [INFO ] Dead Transitions using invariants and state equation in 1996 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9991 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s115 1) (LT s266 1)), p1:(AND (GEQ s63 1) (GEQ s271 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 937 ms.
Product exploration explored 100000 steps with 50000 reset in 864 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b08-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b08-LTLFireability-00 finished in 12197 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(p0)))&&(X(p1) U (p2 U p3))))'
Support contains 7 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 58 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 19:59:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:19] [INFO ] Invariant cache hit.
[2023-03-19 19:59:19] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-19 19:59:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:19] [INFO ] Invariant cache hit.
[2023-03-19 19:59:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:59:27] [INFO ] Implicit Places using invariants and state equation in 7637 ms returned []
Implicit Place search using SMT with State Equation took 8068 ms to find 0 implicit places.
[2023-03-19 19:59:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:27] [INFO ] Invariant cache hit.
[2023-03-19 19:59:29] [INFO ] Dead Transitions using invariants and state equation in 1976 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10103 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p3) (NOT p0)), (NOT p0), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p0), true, (NOT p3)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(AND (GEQ s68 1) (GEQ s257 1)), p2:(AND (GEQ s9 1) (GEQ s263 1)), p1:(AND (GEQ s101 1) (GEQ s297 1)), p0:(OR (AND (GEQ s12 1) (GEQ s297 1)) (LT s9 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 259 steps with 1 reset in 3 ms.
FORMULA Szymanski-PT-b08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-01 finished in 10476 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(F((X(X(p0))&&G(p1))))))'
Support contains 5 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 55 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 19:59:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:29] [INFO ] Invariant cache hit.
[2023-03-19 19:59:30] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-19 19:59:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:30] [INFO ] Invariant cache hit.
[2023-03-19 19:59:30] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:59:36] [INFO ] Implicit Places using invariants and state equation in 6629 ms returned []
Implicit Place search using SMT with State Equation took 7075 ms to find 0 implicit places.
[2023-03-19 19:59:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:36] [INFO ] Invariant cache hit.
[2023-03-19 19:59:38] [INFO ] Dead Transitions using invariants and state equation in 1960 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9092 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 5}, { cond=p1, acceptance={0} source=3 dest: 6}, { cond=p1, acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s101 1) (GEQ s259 1)) (AND (GEQ s54 1) (GEQ s259 1))), p0:(AND (GEQ s126 1) (GEQ s294 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-b08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-03 finished in 9553 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) U G(!p1))&&G(F(p2)))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 713 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 19:59:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:39] [INFO ] Invariant cache hit.
[2023-03-19 19:59:40] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-19 19:59:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:40] [INFO ] Invariant cache hit.
[2023-03-19 19:59:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 19:59:47] [INFO ] Implicit Places using invariants and state equation in 7193 ms returned []
Implicit Place search using SMT with State Equation took 7616 ms to find 0 implicit places.
[2023-03-19 19:59:48] [INFO ] Redundant transitions in 957 ms returned []
[2023-03-19 19:59:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:48] [INFO ] Invariant cache hit.
[2023-03-19 19:59:50] [INFO ] Dead Transitions using invariants and state equation in 1977 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11274 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p2) p1), (NOT p2), p1]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LT s116 1) (LT s258 1)), p1:(AND (GEQ s32 1) (GEQ s256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5 reset in 422 ms.
Product exploration explored 100000 steps with 11 reset in 485 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p2) p1), (NOT p2), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Finished Best-First random walk after 893 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=297 )
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p2) p1), (NOT p2), p1]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) p1), (NOT p2), p1]
Support contains 4 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 196 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 19:59:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:52] [INFO ] Invariant cache hit.
[2023-03-19 19:59:53] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-19 19:59:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 19:59:53] [INFO ] Invariant cache hit.
[2023-03-19 19:59:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:00:00] [INFO ] Implicit Places using invariants and state equation in 7542 ms returned []
Implicit Place search using SMT with State Equation took 7959 ms to find 0 implicit places.
[2023-03-19 20:00:01] [INFO ] Redundant transitions in 653 ms returned []
[2023-03-19 20:00:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:01] [INFO ] Invariant cache hit.
[2023-03-19 20:00:03] [INFO ] Dead Transitions using invariants and state equation in 1993 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10813 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p2) p1), (NOT p2), p1]
Incomplete random walk after 10001 steps, including 6 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Finished Best-First random walk after 6868 steps, including 2 resets, run visited all 2 properties in 10 ms. (steps per millisecond=686 )
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p2) p1), (NOT p2), p1]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p2) p1), (NOT p2), p1]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p2) p1), (NOT p2), p1]
Product exploration explored 100000 steps with 0 reset in 360 ms.
Product exploration explored 100000 steps with 4 reset in 376 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:00:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:05] [INFO ] Invariant cache hit.
[2023-03-19 20:00:05] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-19 20:00:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:05] [INFO ] Invariant cache hit.
[2023-03-19 20:00:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:00:12] [INFO ] Implicit Places using invariants and state equation in 7252 ms returned []
Implicit Place search using SMT with State Equation took 7666 ms to find 0 implicit places.
[2023-03-19 20:00:13] [INFO ] Redundant transitions in 848 ms returned []
[2023-03-19 20:00:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:13] [INFO ] Invariant cache hit.
[2023-03-19 20:00:15] [INFO ] Dead Transitions using invariants and state equation in 1967 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10684 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b08-LTLFireability-04 finished in 36872 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) U (p1||X(p2))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 51 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:00:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:16] [INFO ] Invariant cache hit.
[2023-03-19 20:00:16] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-19 20:00:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:16] [INFO ] Invariant cache hit.
[2023-03-19 20:00:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:00:23] [INFO ] Implicit Places using invariants and state equation in 6757 ms returned []
Implicit Place search using SMT with State Equation took 7184 ms to find 0 implicit places.
[2023-03-19 20:00:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:23] [INFO ] Invariant cache hit.
[2023-03-19 20:00:25] [INFO ] Dead Transitions using invariants and state equation in 2008 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9244 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p0)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s47 1) (GEQ s269 1)), p0:(OR (AND (GEQ s67 1) (GEQ s282 1)) (AND (GEQ s47 1) (GEQ s269 1))), p2:(AND (GEQ s124 1) (GEQ s262 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-05 finished in 9455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(p0)||G(p1)) U !p2)&&(!p3 U p1)))'
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 54 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:00:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:25] [INFO ] Invariant cache hit.
[2023-03-19 20:00:26] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-19 20:00:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:26] [INFO ] Invariant cache hit.
[2023-03-19 20:00:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:00:32] [INFO ] Implicit Places using invariants and state equation in 6777 ms returned []
Implicit Place search using SMT with State Equation took 7188 ms to find 0 implicit places.
[2023-03-19 20:00:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:32] [INFO ] Invariant cache hit.
[2023-03-19 20:00:34] [INFO ] Dead Transitions using invariants and state equation in 1942 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9184 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) p2), true, (NOT p0), p2, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 p1) (AND p2 (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p2 p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s33 1) (GEQ s260 1)), p3:(AND (GEQ s2 1) (GEQ s293 1)), p2:(OR (AND (GEQ s62 1) (GEQ s282 1)) (AND (GEQ s88 1) (GEQ s292 1))), p0:(AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 233 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-b08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-06 finished in 9459 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((p0||X(((p2 U p3)&&p1)))))))'
Support contains 7 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 56 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:00:35] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:35] [INFO ] Invariant cache hit.
[2023-03-19 20:00:35] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-19 20:00:35] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:35] [INFO ] Invariant cache hit.
[2023-03-19 20:00:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:00:42] [INFO ] Implicit Places using invariants and state equation in 6721 ms returned []
Implicit Place search using SMT with State Equation took 7129 ms to find 0 implicit places.
[2023-03-19 20:00:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:42] [INFO ] Invariant cache hit.
[2023-03-19 20:00:44] [INFO ] Dead Transitions using invariants and state equation in 1923 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9109 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s98 1) (GEQ s293 1)), p1:(AND (GEQ s110 1) (GEQ s259 1)), p3:(AND (GEQ s92 1) (GEQ s293 1)), p2:(AND (GEQ s36 1) (GEQ s287 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-07 finished in 9357 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(G(p0)))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 50 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:00:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:44] [INFO ] Invariant cache hit.
[2023-03-19 20:00:44] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-19 20:00:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:44] [INFO ] Invariant cache hit.
[2023-03-19 20:00:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:00:51] [INFO ] Implicit Places using invariants and state equation in 6494 ms returned []
Implicit Place search using SMT with State Equation took 6920 ms to find 0 implicit places.
[2023-03-19 20:00:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:51] [INFO ] Invariant cache hit.
[2023-03-19 20:00:53] [INFO ] Dead Transitions using invariants and state equation in 1936 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8908 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s75 1) (GEQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-08 finished in 9078 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(G(p1))||p0)))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 54 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:00:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:53] [INFO ] Invariant cache hit.
[2023-03-19 20:00:53] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-19 20:00:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:00:53] [INFO ] Invariant cache hit.
[2023-03-19 20:00:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:01:00] [INFO ] Implicit Places using invariants and state equation in 6916 ms returned []
Implicit Place search using SMT with State Equation took 7324 ms to find 0 implicit places.
[2023-03-19 20:01:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:01:00] [INFO ] Invariant cache hit.
[2023-03-19 20:01:02] [INFO ] Dead Transitions using invariants and state equation in 1955 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9335 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s42 1) (GEQ s290 1)), p0:(OR (LT s25 1) (LT s304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 361 ms.
Product exploration explored 100000 steps with 6 reset in 375 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 20:01:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:01:04] [INFO ] Invariant cache hit.
[2023-03-19 20:01:04] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:01:04] [INFO ] After 987ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:01:05] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:01:06] [INFO ] After 1495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:01:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:01:08] [INFO ] After 2306ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:01:09] [INFO ] After 2474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1109 ms.
[2023-03-19 20:01:10] [INFO ] After 5145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 210867 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 210867 steps, saw 130749 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 20:01:13] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 20:01:13] [INFO ] Computed 1 place invariants in 23 ms
[2023-03-19 20:01:13] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:01:14] [INFO ] After 1487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:01:14] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:01:15] [INFO ] After 959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:01:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:01:18] [INFO ] After 2518ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:01:18] [INFO ] After 2630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-19 20:01:18] [INFO ] After 3738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 200 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2023-03-19 20:01:19] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 20:01:19] [INFO ] Invariant cache hit.
[2023-03-19 20:01:19] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-19 20:01:19] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 20:01:19] [INFO ] Invariant cache hit.
[2023-03-19 20:01:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:01:26] [INFO ] Implicit Places using invariants and state equation in 7373 ms returned []
Implicit Place search using SMT with State Equation took 7789 ms to find 0 implicit places.
[2023-03-19 20:01:27] [INFO ] Redundant transitions in 906 ms returned []
[2023-03-19 20:01:27] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 20:01:27] [INFO ] Invariant cache hit.
[2023-03-19 20:01:29] [INFO ] Dead Transitions using invariants and state equation in 1912 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10802 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 5 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2159 transitions
Reduce isomorphic transitions removed 5239 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 1 rules applied. Total rules applied 2 place count 282 transition count 2570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 281 transition count 2570
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 281 transition count 2567
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 278 transition count 2567
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 2 with 2 rules applied. Total rules applied 11 place count 277 transition count 2566
Drop transitions removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 2 with 417 rules applied. Total rules applied 428 place count 277 transition count 2149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 428 place count 277 transition count 2148
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 276 transition count 2148
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 276 transition count 2147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 432 place count 275 transition count 2147
Applied a total of 432 rules in 284 ms. Remains 275 /305 variables (removed 30) and now considering 2147/7810 (removed 5663) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2147 rows 275 cols
[2023-03-19 20:01:29] [INFO ] Computed 1 place invariants in 14 ms
[2023-03-19 20:01:30] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:01:30] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:01:30] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:01:31] [INFO ] After 698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:01:31] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-19 20:01:31] [INFO ] After 155ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:01:31] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-19 20:01:31] [INFO ] After 1122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 34 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:01:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 20:01:32] [INFO ] Computed 1 place invariants in 14 ms
[2023-03-19 20:01:32] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-19 20:01:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:01:32] [INFO ] Invariant cache hit.
[2023-03-19 20:01:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:01:39] [INFO ] Implicit Places using invariants and state equation in 6393 ms returned []
Implicit Place search using SMT with State Equation took 6834 ms to find 0 implicit places.
[2023-03-19 20:01:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:01:39] [INFO ] Invariant cache hit.
[2023-03-19 20:01:40] [INFO ] Dead Transitions using invariants and state equation in 1930 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8803 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 20:01:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:01:41] [INFO ] Invariant cache hit.
[2023-03-19 20:01:41] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:01:42] [INFO ] After 960ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:01:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:01:43] [INFO ] After 1509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:01:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:01:46] [INFO ] After 2325ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:01:46] [INFO ] After 2497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1128 ms.
[2023-03-19 20:01:47] [INFO ] After 5207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 204 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217317 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217317 steps, saw 131662 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 20:01:50] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 20:01:50] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 20:01:50] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:01:52] [INFO ] After 1464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:01:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:01:53] [INFO ] After 973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:01:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:01:55] [INFO ] After 2552ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:01:55] [INFO ] After 2670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-19 20:01:56] [INFO ] After 3776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 202 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2023-03-19 20:01:56] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 20:01:56] [INFO ] Invariant cache hit.
[2023-03-19 20:01:56] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-19 20:01:56] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 20:01:56] [INFO ] Invariant cache hit.
[2023-03-19 20:01:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:02:04] [INFO ] Implicit Places using invariants and state equation in 8121 ms returned []
Implicit Place search using SMT with State Equation took 8547 ms to find 0 implicit places.
[2023-03-19 20:02:05] [INFO ] Redundant transitions in 907 ms returned []
[2023-03-19 20:02:05] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 20:02:05] [INFO ] Invariant cache hit.
[2023-03-19 20:02:07] [INFO ] Dead Transitions using invariants and state equation in 1915 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11572 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2159 transitions
Reduce isomorphic transitions removed 5239 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 1 rules applied. Total rules applied 2 place count 282 transition count 2570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 281 transition count 2570
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 281 transition count 2567
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 278 transition count 2567
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 2 with 2 rules applied. Total rules applied 11 place count 277 transition count 2566
Drop transitions removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 2 with 417 rules applied. Total rules applied 428 place count 277 transition count 2149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 428 place count 277 transition count 2148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 276 transition count 2148
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 276 transition count 2147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 432 place count 275 transition count 2147
Applied a total of 432 rules in 196 ms. Remains 275 /305 variables (removed 30) and now considering 2147/7810 (removed 5663) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2147 rows 275 cols
[2023-03-19 20:02:08] [INFO ] Computed 1 place invariants in 15 ms
[2023-03-19 20:02:08] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:02:08] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:02:08] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:02:09] [INFO ] After 686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:02:09] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-19 20:02:09] [INFO ] After 149ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:02:09] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-19 20:02:09] [INFO ] After 1109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 17 reset in 370 ms.
Product exploration explored 100000 steps with 24 reset in 411 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 215 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:02:12] [INFO ] Redundant transitions in 838 ms returned []
[2023-03-19 20:02:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 20:02:12] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 20:02:14] [INFO ] Dead Transitions using invariants and state equation in 1928 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2990 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 28 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:02:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:14] [INFO ] Invariant cache hit.
[2023-03-19 20:02:14] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-19 20:02:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:14] [INFO ] Invariant cache hit.
[2023-03-19 20:02:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:02:20] [INFO ] Implicit Places using invariants and state equation in 6220 ms returned []
Implicit Place search using SMT with State Equation took 6630 ms to find 0 implicit places.
[2023-03-19 20:02:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:20] [INFO ] Invariant cache hit.
[2023-03-19 20:02:22] [INFO ] Dead Transitions using invariants and state equation in 1927 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8587 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b08-LTLFireability-09 finished in 89680 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(p0))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 52 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:02:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:23] [INFO ] Invariant cache hit.
[2023-03-19 20:02:23] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-19 20:02:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:23] [INFO ] Invariant cache hit.
[2023-03-19 20:02:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:02:30] [INFO ] Implicit Places using invariants and state equation in 6892 ms returned []
Implicit Place search using SMT with State Equation took 7316 ms to find 0 implicit places.
[2023-03-19 20:02:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:30] [INFO ] Invariant cache hit.
[2023-03-19 20:02:32] [INFO ] Dead Transitions using invariants and state equation in 1938 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9307 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s18 1) (GEQ s302 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-10 finished in 9452 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)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 214 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:02:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:32] [INFO ] Invariant cache hit.
[2023-03-19 20:02:33] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-19 20:02:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:33] [INFO ] Invariant cache hit.
[2023-03-19 20:02:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:02:40] [INFO ] Implicit Places using invariants and state equation in 7398 ms returned []
Implicit Place search using SMT with State Equation took 7821 ms to find 0 implicit places.
[2023-03-19 20:02:41] [INFO ] Redundant transitions in 858 ms returned []
[2023-03-19 20:02:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:41] [INFO ] Invariant cache hit.
[2023-03-19 20:02:43] [INFO ] Dead Transitions using invariants and state equation in 1900 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10808 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s125 1) (LT s256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 409 ms.
Product exploration explored 100000 steps with 0 reset in 364 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 1) seen :0
Finished Best-First random walk after 4429 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=885 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:02:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:44] [INFO ] Invariant cache hit.
[2023-03-19 20:02:45] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-19 20:02:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:45] [INFO ] Invariant cache hit.
[2023-03-19 20:02:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:02:53] [INFO ] Implicit Places using invariants and state equation in 7847 ms returned []
Implicit Place search using SMT with State Equation took 8276 ms to find 0 implicit places.
[2023-03-19 20:02:54] [INFO ] Redundant transitions in 854 ms returned []
[2023-03-19 20:02:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:54] [INFO ] Invariant cache hit.
[2023-03-19 20:02:56] [INFO ] Dead Transitions using invariants and state equation in 1961 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11283 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 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 65 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 358 steps, run visited all 1 properties in 10 ms. (steps per millisecond=35 )
Probabilistic random walk after 358 steps, saw 271 distinct states, run finished after 10 ms. (steps per millisecond=35 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 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 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11 reset in 365 ms.
Product exploration explored 100000 steps with 18 reset in 403 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:02:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:57] [INFO ] Invariant cache hit.
[2023-03-19 20:02:58] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-19 20:02:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:02:58] [INFO ] Invariant cache hit.
[2023-03-19 20:02:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:03:03] [INFO ] Implicit Places using invariants and state equation in 5839 ms returned []
Implicit Place search using SMT with State Equation took 6279 ms to find 0 implicit places.
[2023-03-19 20:03:04] [INFO ] Redundant transitions in 669 ms returned []
[2023-03-19 20:03:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:03:04] [INFO ] Invariant cache hit.
[2023-03-19 20:03:06] [INFO ] Dead Transitions using invariants and state equation in 1967 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9107 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b08-LTLFireability-11 finished in 34129 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 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 219 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:03:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:03:06] [INFO ] Invariant cache hit.
[2023-03-19 20:03:07] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-19 20:03:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:03:07] [INFO ] Invariant cache hit.
[2023-03-19 20:03:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:03:13] [INFO ] Implicit Places using invariants and state equation in 6074 ms returned []
Implicit Place search using SMT with State Equation took 6515 ms to find 0 implicit places.
[2023-03-19 20:03:14] [INFO ] Redundant transitions in 682 ms returned []
[2023-03-19 20:03:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:03:14] [INFO ] Invariant cache hit.
[2023-03-19 20:03:16] [INFO ] Dead Transitions using invariants and state equation in 1963 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9384 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-12 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 (GEQ s12 1) (GEQ s297 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 179 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-b08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-12 finished in 9456 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(F(p0))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 33 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2023-03-19 20:03:16] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2023-03-19 20:03:16] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 20:03:16] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-19 20:03:16] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 20:03:16] [INFO ] Invariant cache hit.
[2023-03-19 20:03:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:03:22] [INFO ] Implicit Places using invariants and state equation in 5605 ms returned []
Implicit Place search using SMT with State Equation took 6066 ms to find 0 implicit places.
[2023-03-19 20:03:22] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 20:03:22] [INFO ] Invariant cache hit.
[2023-03-19 20:03:24] [INFO ] Dead Transitions using invariants and state equation in 1974 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8073 ms. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s126 1) (LT s305 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]]
Product exploration explored 100000 steps with 33333 reset in 577 ms.
Product exploration explored 100000 steps with 33333 reset in 577 ms.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 50 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b08-LTLFireability-13 finished in 9421 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((X(p1)&&p0)))&&(F(p2)||X(!p1))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 27 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2023-03-19 20:03:25] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 20:03:25] [INFO ] Invariant cache hit.
[2023-03-19 20:03:26] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-19 20:03:26] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 20:03:26] [INFO ] Invariant cache hit.
[2023-03-19 20:03:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:03:30] [INFO ] Implicit Places using invariants and state equation in 4091 ms returned []
Implicit Place search using SMT with State Equation took 4512 ms to find 0 implicit places.
[2023-03-19 20:03:30] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 20:03:30] [INFO ] Invariant cache hit.
[2023-03-19 20:03:32] [INFO ] Dead Transitions using invariants and state equation in 1941 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6481 ms. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (AND (NOT p2) p1), (NOT p1), (NOT p2)]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s85 1) (GEQ s268 1)), p0:(AND (GEQ s25 1) (GEQ s291 1)), p1:(AND (GEQ s0 1) (GEQ s286 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 252 steps with 0 reset in 4 ms.
FORMULA Szymanski-PT-b08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-14 finished in 6679 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||G(p1)))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 217 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:03:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 20:03:32] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 20:03:32] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-19 20:03:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:03:32] [INFO ] Invariant cache hit.
[2023-03-19 20:03:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:03:40] [INFO ] Implicit Places using invariants and state equation in 7523 ms returned []
Implicit Place search using SMT with State Equation took 7959 ms to find 0 implicit places.
[2023-03-19 20:03:41] [INFO ] Redundant transitions in 686 ms returned []
[2023-03-19 20:03:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:03:41] [INFO ] Invariant cache hit.
[2023-03-19 20:03:43] [INFO ] Dead Transitions using invariants and state equation in 1925 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10794 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s75 1) (GEQ s262 1)), p0:(AND (GEQ s99 1) (GEQ s296 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 225 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-b08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b08-LTLFireability-15 finished in 10886 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) U G(!p1))&&G(F(p2)))))'
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(G(p1))||p0)))))'
Found a Lengthening insensitive property : Szymanski-PT-b08-LTLFireability-09
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 92 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:03:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:03:43] [INFO ] Invariant cache hit.
[2023-03-19 20:03:43] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-19 20:03:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:03:43] [INFO ] Invariant cache hit.
[2023-03-19 20:03:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:03:50] [INFO ] Implicit Places using invariants and state equation in 6158 ms returned []
Implicit Place search using SMT with State Equation took 6557 ms to find 0 implicit places.
[2023-03-19 20:03:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:03:50] [INFO ] Invariant cache hit.
[2023-03-19 20:03:52] [INFO ] Dead Transitions using invariants and state equation in 2015 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8664 ms. Remains : 305/306 places, 7936/8064 transitions.
Running random walk in product with property : Szymanski-PT-b08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s42 1) (GEQ s290 1)), p0:(OR (LT s25 1) (LT s304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 365 ms.
Product exploration explored 100000 steps with 1 reset in 368 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 20:03:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:03:53] [INFO ] Invariant cache hit.
[2023-03-19 20:03:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:03:54] [INFO ] After 984ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:03:54] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:03:55] [INFO ] After 1510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:03:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:03:58] [INFO ] After 2316ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:03:58] [INFO ] After 2490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1119 ms.
[2023-03-19 20:03:59] [INFO ] After 5176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 214953 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 214953 steps, saw 131407 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 20:04:02] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 20:04:02] [INFO ] Computed 1 place invariants in 18 ms
[2023-03-19 20:04:02] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:04:04] [INFO ] After 1445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:04:04] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:04:05] [INFO ] After 970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:04:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:04:07] [INFO ] After 2527ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:04:07] [INFO ] After 2643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-19 20:04:07] [INFO ] After 3748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 196 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2023-03-19 20:04:08] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 20:04:08] [INFO ] Invariant cache hit.
[2023-03-19 20:04:08] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-19 20:04:08] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 20:04:08] [INFO ] Invariant cache hit.
[2023-03-19 20:04:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:04:16] [INFO ] Implicit Places using invariants and state equation in 7780 ms returned []
Implicit Place search using SMT with State Equation took 8198 ms to find 0 implicit places.
[2023-03-19 20:04:17] [INFO ] Redundant transitions in 646 ms returned []
[2023-03-19 20:04:17] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 20:04:17] [INFO ] Invariant cache hit.
[2023-03-19 20:04:18] [INFO ] Dead Transitions using invariants and state equation in 1894 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10937 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2159 transitions
Reduce isomorphic transitions removed 5239 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 1 rules applied. Total rules applied 2 place count 282 transition count 2570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 281 transition count 2570
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 281 transition count 2567
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 278 transition count 2567
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 2 with 2 rules applied. Total rules applied 11 place count 277 transition count 2566
Drop transitions removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 2 with 417 rules applied. Total rules applied 428 place count 277 transition count 2149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 428 place count 277 transition count 2148
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 276 transition count 2148
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 276 transition count 2147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 432 place count 275 transition count 2147
Applied a total of 432 rules in 196 ms. Remains 275 /305 variables (removed 30) and now considering 2147/7810 (removed 5663) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2147 rows 275 cols
[2023-03-19 20:04:19] [INFO ] Computed 1 place invariants in 18 ms
[2023-03-19 20:04:19] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:04:19] [INFO ] After 563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:04:19] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:04:20] [INFO ] After 708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:04:20] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-19 20:04:20] [INFO ] After 153ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:04:20] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-19 20:04:20] [INFO ] After 1140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 29 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:04:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 20:04:21] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 20:04:21] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-19 20:04:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:04:21] [INFO ] Invariant cache hit.
[2023-03-19 20:04:22] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:04:29] [INFO ] Implicit Places using invariants and state equation in 7179 ms returned []
Implicit Place search using SMT with State Equation took 7637 ms to find 0 implicit places.
[2023-03-19 20:04:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:04:29] [INFO ] Invariant cache hit.
[2023-03-19 20:04:31] [INFO ] Dead Transitions using invariants and state equation in 2007 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9674 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10002 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 20:04:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:04:31] [INFO ] Invariant cache hit.
[2023-03-19 20:04:31] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:04:32] [INFO ] After 995ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:04:32] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:04:33] [INFO ] After 1515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:04:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:04:36] [INFO ] After 2299ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:04:36] [INFO ] After 2473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1121 ms.
[2023-03-19 20:04:37] [INFO ] After 5167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 196 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 212789 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212789 steps, saw 131025 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 20:04:40] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 20:04:40] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 20:04:40] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:04:42] [INFO ] After 1483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:04:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:04:43] [INFO ] After 968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:04:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:04:45] [INFO ] After 2521ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:04:45] [INFO ] After 2632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-19 20:04:46] [INFO ] After 3744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2023-03-19 20:04:46] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 20:04:46] [INFO ] Invariant cache hit.
[2023-03-19 20:04:46] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-19 20:04:46] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 20:04:46] [INFO ] Invariant cache hit.
[2023-03-19 20:04:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:04:55] [INFO ] Implicit Places using invariants and state equation in 8275 ms returned []
Implicit Place search using SMT with State Equation took 8696 ms to find 0 implicit places.
[2023-03-19 20:04:55] [INFO ] Redundant transitions in 646 ms returned []
[2023-03-19 20:04:55] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 20:04:55] [INFO ] Invariant cache hit.
[2023-03-19 20:04:57] [INFO ] Dead Transitions using invariants and state equation in 1928 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11474 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 3080 transitions
Ensure Unique test removed 2159 transitions
Reduce isomorphic transitions removed 5239 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 1 rules applied. Total rules applied 2 place count 282 transition count 2570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 281 transition count 2570
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 281 transition count 2567
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 278 transition count 2567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 277 transition count 2566
Drop transitions removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 2 with 417 rules applied. Total rules applied 428 place count 277 transition count 2149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 428 place count 277 transition count 2148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 276 transition count 2148
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 276 transition count 2147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 432 place count 275 transition count 2147
Applied a total of 432 rules in 191 ms. Remains 275 /305 variables (removed 30) and now considering 2147/7810 (removed 5663) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2147 rows 275 cols
[2023-03-19 20:04:57] [INFO ] Computed 1 place invariants in 13 ms
[2023-03-19 20:04:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:04:58] [INFO ] After 573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:04:58] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 20:04:59] [INFO ] After 735ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:04:59] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-19 20:04:59] [INFO ] After 156ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:04:59] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-19 20:04:59] [INFO ] After 1173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 15 reset in 379 ms.
Product exploration explored 100000 steps with 13 reset in 422 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:05:02] [INFO ] Redundant transitions in 647 ms returned []
[2023-03-19 20:05:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 20:05:02] [INFO ] Computed 1 place invariants in 19 ms
[2023-03-19 20:05:04] [INFO ] Dead Transitions using invariants and state equation in 1975 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2821 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 33 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:05:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:05:04] [INFO ] Invariant cache hit.
[2023-03-19 20:05:04] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-19 20:05:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:05:04] [INFO ] Invariant cache hit.
[2023-03-19 20:05:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:05:11] [INFO ] Implicit Places using invariants and state equation in 7264 ms returned []
Implicit Place search using SMT with State Equation took 7685 ms to find 0 implicit places.
[2023-03-19 20:05:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:05:11] [INFO ] Invariant cache hit.
[2023-03-19 20:05:13] [INFO ] Dead Transitions using invariants and state equation in 1938 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9659 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b08-LTLFireability-09 finished in 90635 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)))'
[2023-03-19 20:05:14] [INFO ] Flatten gal took : 237 ms
[2023-03-19 20:05:14] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 20:05:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 8064 transitions and 32128 arcs took 46 ms.
Total runtime 514847 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1910/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1910/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1910/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Szymanski-PT-b08-LTLFireability-04
Could not compute solution for formula : Szymanski-PT-b08-LTLFireability-09
Could not compute solution for formula : Szymanski-PT-b08-LTLFireability-11

BK_STOP 1679256321545

--------------------
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 Szymanski-PT-b08-LTLFireability-04
ltl formula formula --ltl=/tmp/1910/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 306 places, 8064 transitions and 32128 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1910/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1910/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.620 real 0.270 user 0.350 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1910/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1910/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 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:
corrupted size vs. prev_size in fastbins
ltl formula name Szymanski-PT-b08-LTLFireability-09
ltl formula formula --ltl=/tmp/1910/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 306 places, 8064 transitions and 32128 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1910/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1910/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1910/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.630 real 0.300 user 0.270 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1910/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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:
ltl formula name Szymanski-PT-b08-LTLFireability-11
ltl formula formula --ltl=/tmp/1910/ltl_2_
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 306 places, 8064 transitions and 32128 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1910/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1910/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.710 real 0.260 user 0.320 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1910/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1910/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
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="Szymanski-PT-b08"
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 Szymanski-PT-b08, 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 r489-tall-167912706800476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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