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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.7K Feb 26 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 17:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 17:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 17:02 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-b12-LTLFireability-00
FORMULA_NAME Szymanski-PT-b12-LTLFireability-01
FORMULA_NAME Szymanski-PT-b12-LTLFireability-02
FORMULA_NAME Szymanski-PT-b12-LTLFireability-03
FORMULA_NAME Szymanski-PT-b12-LTLFireability-04
FORMULA_NAME Szymanski-PT-b12-LTLFireability-05
FORMULA_NAME Szymanski-PT-b12-LTLFireability-06
FORMULA_NAME Szymanski-PT-b12-LTLFireability-07
FORMULA_NAME Szymanski-PT-b12-LTLFireability-08
FORMULA_NAME Szymanski-PT-b12-LTLFireability-09
FORMULA_NAME Szymanski-PT-b12-LTLFireability-10
FORMULA_NAME Szymanski-PT-b12-LTLFireability-11
FORMULA_NAME Szymanski-PT-b12-LTLFireability-12
FORMULA_NAME Szymanski-PT-b12-LTLFireability-13
FORMULA_NAME Szymanski-PT-b12-LTLFireability-14
FORMULA_NAME Szymanski-PT-b12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679262083841

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-b12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 21:41:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 21:41:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 21:41:25] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2023-03-19 21:41:25] [INFO ] Transformed 568 places.
[2023-03-19 21:41:25] [INFO ] Transformed 8320 transitions.
[2023-03-19 21:41:25] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b12-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 305 transition count 7936
Applied a total of 4 rules in 168 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 21:41:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 21:41:26] [INFO ] Computed 1 place invariants in 62 ms
[2023-03-19 21:41:26] [INFO ] Implicit Places using invariants in 616 ms returned []
[2023-03-19 21:41:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:41:26] [INFO ] Invariant cache hit.
[2023-03-19 21:41:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:41:31] [INFO ] Implicit Places using invariants and state equation in 5072 ms returned []
Implicit Place search using SMT with State Equation took 5719 ms to find 0 implicit places.
[2023-03-19 21:41:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:41:31] [INFO ] Invariant cache hit.
[2023-03-19 21:41:33] [INFO ] Dead Transitions using invariants and state equation in 1958 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7849 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 41 out of 305 places after structural reductions.
[2023-03-19 21:41:34] [INFO ] Flatten gal took : 420 ms
[2023-03-19 21:41:34] [INFO ] Flatten gal took : 253 ms
[2023-03-19 21:41:35] [INFO ] Input system was already deterministic with 7936 transitions.
Incomplete random walk after 10002 steps, including 5 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) 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 15) 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 15) seen :0
Running SMT prover for 15 properties.
[2023-03-19 21:41:35] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:41:35] [INFO ] Invariant cache hit.
[2023-03-19 21:41:36] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:41:36] [INFO ] After 782ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2023-03-19 21:41:36] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 21:41:45] [INFO ] After 8317ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :12
[2023-03-19 21:41:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:42:01] [INFO ] After 16468ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :3 sat :11
[2023-03-19 21:42:01] [INFO ] After 16469ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :11
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-19 21:42:01] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :11
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 411 ms.
Support contains 23 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 305 transition count 7877
Applied a total of 59 rules in 476 ms. Remains 305 /305 variables (removed 0) and now considering 7877/7936 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 305/305 places, 7877/7936 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 21:42:03] [INFO ] Flow matrix only has 2673 transitions (discarded 5204 similar events)
// Phase 1: matrix 2673 rows 305 cols
[2023-03-19 21:42:03] [INFO ] Computed 1 place invariants in 25 ms
[2023-03-19 21:42:03] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:42:05] [INFO ] After 2312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 21:42:05] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:42:09] [INFO ] After 3764ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 21:42:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:42:21] [INFO ] After 11745ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 21:42:22] [INFO ] After 13347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2429 ms.
[2023-03-19 21:42:25] [INFO ] After 19673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 73 ms.
Support contains 16 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7877/7877 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 305 transition count 7876
Applied a total of 1 rules in 219 ms. Remains 305 /305 variables (removed 0) and now considering 7876/7877 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 305/305 places, 7876/7877 transitions.
Incomplete random walk after 10007 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 121733 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{3=1, 6=1}
Probabilistic random walk after 121733 steps, saw 96043 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :2
Running SMT prover for 6 properties.
[2023-03-19 21:42:28] [INFO ] Flow matrix only has 2672 transitions (discarded 5204 similar events)
// Phase 1: matrix 2672 rows 305 cols
[2023-03-19 21:42:28] [INFO ] Computed 1 place invariants in 22 ms
[2023-03-19 21:42:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:42:31] [INFO ] After 2966ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 21:42:31] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:42:36] [INFO ] After 4864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 21:42:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:42:50] [INFO ] After 13298ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 21:42:51] [INFO ] After 14684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 628 ms.
[2023-03-19 21:42:52] [INFO ] After 20295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 92 ms.
Support contains 13 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7876/7876 transitions.
Drop transitions removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 305 transition count 7815
Applied a total of 61 rules in 216 ms. Remains 305 /305 variables (removed 0) and now considering 7815/7876 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 305/305 places, 7815/7876 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 21:42:52] [INFO ] Flow matrix only has 2611 transitions (discarded 5204 similar events)
// Phase 1: matrix 2611 rows 305 cols
[2023-03-19 21:42:52] [INFO ] Computed 1 place invariants in 18 ms
[2023-03-19 21:42:52] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 21:42:55] [INFO ] After 2446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 21:42:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:42:56] [INFO ] After 1798ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 21:42:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:43:04] [INFO ] After 8027ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 21:43:07] [INFO ] Deduced a trap composed of 60 places in 373 ms of which 1 ms to minimize.
[2023-03-19 21:43:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 600 ms
[2023-03-19 21:43:08] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 0 ms to minimize.
[2023-03-19 21:43:09] [INFO ] Deduced a trap composed of 103 places in 238 ms of which 1 ms to minimize.
[2023-03-19 21:43:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 779 ms
[2023-03-19 21:43:09] [INFO ] After 13039ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1715 ms.
[2023-03-19 21:43:11] [INFO ] After 16641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 49 ms.
Support contains 9 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7815/7815 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 305 transition count 7813
Applied a total of 2 rules in 212 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7815 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 305/305 places, 7813/7815 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 134593 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134593 steps, saw 104778 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 21:43:15] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
// Phase 1: matrix 2609 rows 305 cols
[2023-03-19 21:43:15] [INFO ] Computed 1 place invariants in 26 ms
[2023-03-19 21:43:15] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:43:17] [INFO ] After 2430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 21:43:17] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:43:19] [INFO ] After 1899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 21:43:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:43:23] [INFO ] After 3950ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 21:43:28] [INFO ] Deduced a trap composed of 60 places in 328 ms of which 1 ms to minimize.
[2023-03-19 21:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 474 ms
[2023-03-19 21:43:30] [INFO ] Deduced a trap composed of 45 places in 326 ms of which 2 ms to minimize.
[2023-03-19 21:43:30] [INFO ] Deduced a trap composed of 61 places in 299 ms of which 1 ms to minimize.
[2023-03-19 21:43:31] [INFO ] Deduced a trap composed of 61 places in 292 ms of which 0 ms to minimize.
[2023-03-19 21:43:31] [INFO ] Deduced a trap composed of 74 places in 279 ms of which 1 ms to minimize.
[2023-03-19 21:43:31] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 1 ms to minimize.
[2023-03-19 21:43:32] [INFO ] Deduced a trap composed of 44 places in 286 ms of which 1 ms to minimize.
[2023-03-19 21:43:32] [INFO ] Deduced a trap composed of 49 places in 269 ms of which 0 ms to minimize.
[2023-03-19 21:43:32] [INFO ] Deduced a trap composed of 74 places in 277 ms of which 0 ms to minimize.
[2023-03-19 21:43:33] [INFO ] Deduced a trap composed of 74 places in 271 ms of which 0 ms to minimize.
[2023-03-19 21:43:33] [INFO ] Deduced a trap composed of 87 places in 279 ms of which 1 ms to minimize.
[2023-03-19 21:43:35] [INFO ] Deduced a trap composed of 36 places in 271 ms of which 1 ms to minimize.
[2023-03-19 21:43:35] [INFO ] Deduced a trap composed of 49 places in 286 ms of which 0 ms to minimize.
[2023-03-19 21:43:35] [INFO ] Deduced a trap composed of 72 places in 266 ms of which 0 ms to minimize.
[2023-03-19 21:43:36] [INFO ] Deduced a trap composed of 72 places in 259 ms of which 0 ms to minimize.
[2023-03-19 21:43:36] [INFO ] Deduced a trap composed of 72 places in 230 ms of which 1 ms to minimize.
[2023-03-19 21:43:36] [INFO ] Deduced a trap composed of 85 places in 241 ms of which 1 ms to minimize.
[2023-03-19 21:43:36] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6980 ms
[2023-03-19 21:43:37] [INFO ] Deduced a trap composed of 134 places in 197 ms of which 1 ms to minimize.
[2023-03-19 21:43:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 465 ms
[2023-03-19 21:43:38] [INFO ] After 19121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 906 ms.
[2023-03-19 21:43:39] [INFO ] After 22035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 31 ms.
Support contains 9 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Applied a total of 0 rules in 210 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 305/305 places, 7813/7813 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
[2023-03-19 21:43:40] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 21:43:40] [INFO ] Invariant cache hit.
[2023-03-19 21:43:40] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-19 21:43:40] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 21:43:40] [INFO ] Invariant cache hit.
[2023-03-19 21:43:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:43:45] [INFO ] Implicit Places using invariants and state equation in 5042 ms returned []
Implicit Place search using SMT with State Equation took 5465 ms to find 0 implicit places.
[2023-03-19 21:43:46] [INFO ] Redundant transitions in 937 ms returned []
[2023-03-19 21:43:46] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 21:43:46] [INFO ] Invariant cache hit.
[2023-03-19 21:43:48] [INFO ] Dead Transitions using invariants and state equation in 1967 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8571 ms. Remains : 305/305 places, 7813/7813 transitions.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA Szymanski-PT-b12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 2304 stable transitions
FORMULA Szymanski-PT-b12-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((G(p1) U G((p2 U p3))))||p0))))'
Support contains 7 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 63 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 21:43:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 21:43:48] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 21:43:49] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-19 21:43:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:43:49] [INFO ] Invariant cache hit.
[2023-03-19 21:43:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:43:55] [INFO ] Implicit Places using invariants and state equation in 5882 ms returned []
Implicit Place search using SMT with State Equation took 6301 ms to find 0 implicit places.
[2023-03-19 21:43:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:43:55] [INFO ] Invariant cache hit.
[2023-03-19 21:43:57] [INFO ] Dead Transitions using invariants and state equation in 2177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8545 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 484 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=4 dest: 3}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(OR p3 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s277 1)), p3:(AND (GEQ s11 1) (GEQ s257 1)), p1:(OR (AND (GEQ s33 1) (GEQ s260 1)) (AND (GEQ s11 1) (GEQ s257 1))), p2:(AND (GEQ s96 ...], 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]]
Product exploration explored 100000 steps with 4 reset in 511 ms.
Product exploration explored 100000 steps with 15 reset in 428 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 p3) (NOT p1) (NOT p2)), (X p0), (X (X (NOT (OR (AND p3 p1) (AND p2 p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), true, (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X p0)), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 579 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 8 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p2) (AND (NOT p1) p3)), (NOT p3), (NOT p3), (NOT p3)]
Incomplete random walk after 10011 steps, including 4 resets, run finished after 72 ms. (steps per millisecond=139 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 21:43:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:43:59] [INFO ] Invariant cache hit.
[2023-03-19 21:44:00] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:44:01] [INFO ] After 1887ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-19 21:44:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:44:03] [INFO ] After 1798ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-19 21:44:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:44:04] [INFO ] After 1197ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-19 21:44:05] [INFO ] After 1494ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-19 21:44:05] [INFO ] After 3598ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 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 200 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 257277 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257277 steps, saw 202207 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 21:44:08] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 21:44:08] [INFO ] Computed 1 place invariants in 22 ms
[2023-03-19 21:44:08] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:44:09] [INFO ] After 1082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 21:44:09] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:44:11] [INFO ] After 1476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 21:44:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:44:12] [INFO ] After 1132ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 21:44:12] [INFO ] After 1321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 270 ms.
[2023-03-19 21:44:12] [INFO ] After 3151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 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 197 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 198 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 21:44:13] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 21:44:13] [INFO ] Invariant cache hit.
[2023-03-19 21:44:13] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-19 21:44:13] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 21:44:13] [INFO ] Invariant cache hit.
[2023-03-19 21:44:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:44:21] [INFO ] Implicit Places using invariants and state equation in 7731 ms returned []
Implicit Place search using SMT with State Equation took 8146 ms to find 0 implicit places.
[2023-03-19 21:44:22] [INFO ] Redundant transitions in 861 ms returned []
[2023-03-19 21:44:22] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 21:44:22] [INFO ] Invariant cache hit.
[2023-03-19 21:44:24] [INFO ] Dead Transitions using invariants and state equation in 1908 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11118 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5000 edges and 305 vertex of which 26 / 305 are part of one of the 4 SCC in 4 ms
Free SCC test removed 22 places
Drop transitions removed 2912 transitions
Ensure Unique test removed 2517 transitions
Reduce isomorphic transitions removed 5429 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 283 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 282 transition count 2378
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 280 transition count 2378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 278 transition count 2376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 278 transition count 2375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 278 transition count 2374
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 14 place count 277 transition count 2374
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 277 transition count 2373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 276 transition count 2373
Applied a total of 16 rules in 322 ms. Remains 276 /305 variables (removed 29) and now considering 2373/7810 (removed 5437) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2373 rows 276 cols
[2023-03-19 21:44:24] [INFO ] Computed 1 place invariants in 11 ms
[2023-03-19 21:44:24] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:44:25] [INFO ] After 742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 21:44:25] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:44:26] [INFO ] After 709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 21:44:26] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-19 21:44:26] [INFO ] After 232ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 21:44:26] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-19 21:44:26] [INFO ] After 1250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X p0), (X (X (NOT (OR (AND p3 p1) (AND p2 p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), true, (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X p0)), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (G (NOT (AND p1 p2 (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (OR (AND (NOT p1) p2) (AND (NOT p1) p3))), (F (AND p1 (NOT p2) (NOT p3))), (F (OR (AND p1 p2) (AND p1 p3))), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (OR p2 p3))]
Knowledge based reduction with 11 factoid took 827 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Support contains 7 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 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 21:44:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 21:44:28] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 21:44:28] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-19 21:44:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:44:28] [INFO ] Invariant cache hit.
[2023-03-19 21:44:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:44:34] [INFO ] Implicit Places using invariants and state equation in 6300 ms returned []
Implicit Place search using SMT with State Equation took 6758 ms to find 0 implicit places.
[2023-03-19 21:44:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:44:34] [INFO ] Invariant cache hit.
[2023-03-19 21:44:36] [INFO ] Dead Transitions using invariants and state equation in 1971 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8764 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 p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (NOT (OR (AND (NOT p1) p3) (AND p2 (NOT p3)))))), true, (X (X (NOT (AND p1 p3)))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 510 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Incomplete random walk after 10007 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-19 21:44:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:44:37] [INFO ] Invariant cache hit.
[2023-03-19 21:44:37] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:44:38] [INFO ] After 1182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 21:44:38] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:44:40] [INFO ] After 1749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 21:44:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:44:41] [INFO ] After 1207ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 21:44:42] [INFO ] After 1465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-19 21:44:42] [INFO ] After 3495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 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 202 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 203 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 255788 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255788 steps, saw 201049 distinct states, run finished after 3003 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 21:44:45] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 21:44:45] [INFO ] Computed 1 place invariants in 28 ms
[2023-03-19 21:44:45] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:44:46] [INFO ] After 1082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 21:44:46] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:44:48] [INFO ] After 1471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 21:44:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:44:49] [INFO ] After 1127ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 21:44:49] [INFO ] After 1317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 272 ms.
[2023-03-19 21:44:49] [INFO ] After 3124ms 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, 7810/7810 transitions.
Applied a total of 0 rules in 209 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 210 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 190 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2023-03-19 21:44:50] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 21:44:50] [INFO ] Invariant cache hit.
[2023-03-19 21:44:50] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-19 21:44:50] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 21:44:50] [INFO ] Invariant cache hit.
[2023-03-19 21:44:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:44:58] [INFO ] Implicit Places using invariants and state equation in 7858 ms returned []
Implicit Place search using SMT with State Equation took 8273 ms to find 0 implicit places.
[2023-03-19 21:44:59] [INFO ] Redundant transitions in 662 ms returned []
[2023-03-19 21:44:59] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 21:44:59] [INFO ] Invariant cache hit.
[2023-03-19 21:45:01] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11016 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5000 edges and 305 vertex of which 26 / 305 are part of one of the 4 SCC in 2 ms
Free SCC test removed 22 places
Drop transitions removed 2912 transitions
Ensure Unique test removed 2517 transitions
Reduce isomorphic transitions removed 5429 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 283 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 282 transition count 2378
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 280 transition count 2378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 278 transition count 2376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 278 transition count 2375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 278 transition count 2374
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 14 place count 277 transition count 2374
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 277 transition count 2373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 276 transition count 2373
Applied a total of 16 rules in 220 ms. Remains 276 /305 variables (removed 29) and now considering 2373/7810 (removed 5437) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2373 rows 276 cols
[2023-03-19 21:45:01] [INFO ] Computed 1 place invariants in 19 ms
[2023-03-19 21:45:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:45:01] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 21:45:02] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:45:02] [INFO ] After 708ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 21:45:02] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-19 21:45:02] [INFO ] After 228ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 21:45:03] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-19 21:45:03] [INFO ] After 1249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (NOT (OR (AND (NOT p1) p3) (AND p2 (NOT p3)))))), true, (X (X (NOT (AND p1 p3)))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (OR (AND p2 (NOT p3)) (AND (NOT p1) p3))), (F (AND p1 (NOT p3))), (F (AND p1 p3)), (F (OR p2 p3))]
Knowledge based reduction with 9 factoid took 707 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 30 reset in 548 ms.
Product exploration explored 100000 steps with 47 reset in 598 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Support contains 7 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 370 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 21:45:07] [INFO ] Redundant transitions in 685 ms returned []
[2023-03-19 21:45:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 21:45:07] [INFO ] Computed 1 place invariants in 30 ms
[2023-03-19 21:45:09] [INFO ] Dead Transitions using invariants and state equation in 2128 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3193 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 7 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 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 21:45:09] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:09] [INFO ] Invariant cache hit.
[2023-03-19 21:45:10] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-19 21:45:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:10] [INFO ] Invariant cache hit.
[2023-03-19 21:45:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:45:17] [INFO ] Implicit Places using invariants and state equation in 7330 ms returned []
Implicit Place search using SMT with State Equation took 7774 ms to find 0 implicit places.
[2023-03-19 21:45:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:17] [INFO ] Invariant cache hit.
[2023-03-19 21:45:19] [INFO ] Dead Transitions using invariants and state equation in 1917 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9725 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b12-LTLFireability-02 finished in 91044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
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 24 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 21:45:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:19] [INFO ] Invariant cache hit.
[2023-03-19 21:45:20] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-19 21:45:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:20] [INFO ] Invariant cache hit.
[2023-03-19 21:45:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:45:27] [INFO ] Implicit Places using invariants and state equation in 7217 ms returned []
Implicit Place search using SMT with State Equation took 7764 ms to find 0 implicit places.
[2023-03-19 21:45:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:27] [INFO ] Invariant cache hit.
[2023-03-19 21:45:29] [INFO ] Dead Transitions using invariants and state equation in 1896 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9686 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s84 1) (GEQ s290 1)), p1:(AND (GEQ s102 1) (GEQ s266 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 233 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-b12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-03 finished in 9857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 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 25 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 21:45:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:29] [INFO ] Invariant cache hit.
[2023-03-19 21:45:30] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-19 21:45:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:30] [INFO ] Invariant cache hit.
[2023-03-19 21:45:30] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:45:36] [INFO ] Implicit Places using invariants and state equation in 6286 ms returned []
Implicit Place search using SMT with State Equation took 6727 ms to find 0 implicit places.
[2023-03-19 21:45:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:36] [INFO ] Invariant cache hit.
[2023-03-19 21:45:38] [INFO ] Dead Transitions using invariants and state equation in 1873 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8627 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s85 1) (LT 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 922 steps with 4 reset in 11 ms.
FORMULA Szymanski-PT-b12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-04 finished in 8742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(p1))))))'
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 27 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 21:45:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:38] [INFO ] Invariant cache hit.
[2023-03-19 21:45:38] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-19 21:45:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:38] [INFO ] Invariant cache hit.
[2023-03-19 21:45:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:45:44] [INFO ] Implicit Places using invariants and state equation in 5794 ms returned []
Implicit Place search using SMT with State Equation took 6214 ms to find 0 implicit places.
[2023-03-19 21:45:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:44] [INFO ] Invariant cache hit.
[2023-03-19 21:45:46] [INFO ] Dead Transitions using invariants and state equation in 1903 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8145 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-07 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=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s53 1) (GEQ s285 1)), p0:(AND (GEQ s9 1) (GEQ s282 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-b12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-07 finished in 8286 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 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 201 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 21:45:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:46] [INFO ] Invariant cache hit.
[2023-03-19 21:45:47] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-19 21:45:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:47] [INFO ] Invariant cache hit.
[2023-03-19 21:45:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:45:53] [INFO ] Implicit Places using invariants and state equation in 6061 ms returned []
Implicit Place search using SMT with State Equation took 6504 ms to find 0 implicit places.
[2023-03-19 21:45:53] [INFO ] Redundant transitions in 667 ms returned []
[2023-03-19 21:45:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:45:53] [INFO ] Invariant cache hit.
[2023-03-19 21:45:55] [INFO ] Dead Transitions using invariants and state equation in 1879 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9263 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s102 1) (LT s280 1)) (OR (LT s100 1) (LT s268 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 93 reset in 554 ms.
Product exploration explored 100000 steps with 65 reset in 607 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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10005 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 266199 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 266199 steps, saw 211667 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 21:46:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:00] [INFO ] Invariant cache hit.
[2023-03-19 21:46:00] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:46:01] [INFO ] After 1400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 21:46:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:46:03] [INFO ] After 1220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 21:46:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:46:09] [INFO ] After 6597ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 21:46:10] [INFO ] After 7879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1038 ms.
[2023-03-19 21:46:11] [INFO ] After 10201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 305 transition count 7872
Applied a total of 64 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7872/7936 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7872/7936 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished Best-First random walk after 3979 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=568 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(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 21:46:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:12] [INFO ] Invariant cache hit.
[2023-03-19 21:46:13] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-19 21:46:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:13] [INFO ] Invariant cache hit.
[2023-03-19 21:46:13] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:46:19] [INFO ] Implicit Places using invariants and state equation in 6880 ms returned []
Implicit Place search using SMT with State Equation took 7297 ms to find 0 implicit places.
[2023-03-19 21:46:20] [INFO ] Redundant transitions in 663 ms returned []
[2023-03-19 21:46:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:20] [INFO ] Invariant cache hit.
[2023-03-19 21:46:22] [INFO ] Dead Transitions using invariants and state equation in 1890 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10049 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 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10007 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 457 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=228 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 53 reset in 437 ms.
Product exploration explored 100000 steps with 36 reset in 453 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 182 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 21:46:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:24] [INFO ] Invariant cache hit.
[2023-03-19 21:46:24] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-19 21:46:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:24] [INFO ] Invariant cache hit.
[2023-03-19 21:46:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:46:31] [INFO ] Implicit Places using invariants and state equation in 6746 ms returned []
Implicit Place search using SMT with State Equation took 7180 ms to find 0 implicit places.
[2023-03-19 21:46:31] [INFO ] Redundant transitions in 666 ms returned []
[2023-03-19 21:46:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:31] [INFO ] Invariant cache hit.
[2023-03-19 21:46:33] [INFO ] Dead Transitions using invariants and state equation in 1861 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9900 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b12-LTLFireability-09 finished in 47330 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 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 21:46:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:34] [INFO ] Invariant cache hit.
[2023-03-19 21:46:34] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-19 21:46:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:34] [INFO ] Invariant cache hit.
[2023-03-19 21:46:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:46:40] [INFO ] Implicit Places using invariants and state equation in 6439 ms returned []
Implicit Place search using SMT with State Equation took 6867 ms to find 0 implicit places.
[2023-03-19 21:46:41] [INFO ] Redundant transitions in 661 ms returned []
[2023-03-19 21:46:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:41] [INFO ] Invariant cache hit.
[2023-03-19 21:46:43] [INFO ] Dead Transitions using invariants and state equation in 1880 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9597 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s264 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-10 finished in 9697 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(G((p0 U p1))) U (p1||G(p2)))))'
Support contains 6 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 21:46:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:43] [INFO ] Invariant cache hit.
[2023-03-19 21:46:44] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-19 21:46:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:44] [INFO ] Invariant cache hit.
[2023-03-19 21:46:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:46:50] [INFO ] Implicit Places using invariants and state equation in 6666 ms returned []
Implicit Place search using SMT with State Equation took 7082 ms to find 0 implicit places.
[2023-03-19 21:46:51] [INFO ] Redundant transitions in 679 ms returned []
[2023-03-19 21:46:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:51] [INFO ] Invariant cache hit.
[2023-03-19 21:46:53] [INFO ] Dead Transitions using invariants and state equation in 1862 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9824 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s93 1) (GEQ s288 1)), p2:(AND (GEQ s17 1) (GEQ s299 1)), p0:(AND (GEQ s63 1) (GEQ s280 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 397 steps with 0 reset in 5 ms.
FORMULA Szymanski-PT-b12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-11 finished in 10061 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(G(p1))&&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 21:46:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:53] [INFO ] Invariant cache hit.
[2023-03-19 21:46:54] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-19 21:46:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:46:54] [INFO ] Invariant cache hit.
[2023-03-19 21:46:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:47:02] [INFO ] Implicit Places using invariants and state equation in 8015 ms returned []
Implicit Place search using SMT with State Equation took 8427 ms to find 0 implicit places.
[2023-03-19 21:47:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:47:02] [INFO ] Invariant cache hit.
[2023-03-19 21:47:04] [INFO ] Dead Transitions using invariants and state equation in 1910 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10368 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s122 1) (GEQ s293 1)), p1:(AND (GEQ s32 1) (GEQ s304 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b12-LTLFireability-12 finished in 10522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((G(p1) U G((p2 U p3))))||p0))))'
Found a Lengthening insensitive property : Szymanski-PT-b12-LTLFireability-02
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (NOT p3), (NOT p3), (NOT p3)]
Support contains 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 54 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 21:47:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:47:04] [INFO ] Invariant cache hit.
[2023-03-19 21:47:05] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-19 21:47:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:47:05] [INFO ] Invariant cache hit.
[2023-03-19 21:47:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:47:10] [INFO ] Implicit Places using invariants and state equation in 5797 ms returned []
Implicit Place search using SMT with State Equation took 6204 ms to find 0 implicit places.
[2023-03-19 21:47:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:47:10] [INFO ] Invariant cache hit.
[2023-03-19 21:47:12] [INFO ] Dead Transitions using invariants and state equation in 1902 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8163 ms. Remains : 305/305 places, 7936/7936 transitions.
Running random walk in product with property : Szymanski-PT-b12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=4 dest: 3}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(OR p3 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s277 1)), p3:(AND (GEQ s11 1) (GEQ s257 1)), p1:(OR (AND (GEQ s33 1) (GEQ s260 1)) (AND (GEQ s11 1) (GEQ s257 1))), p2:(AND (GEQ s96 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 84 reset in 488 ms.
Product exploration explored 100000 steps with 36 reset in 437 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 p3) (NOT p1) (NOT p2)), (X p0), (X (X (NOT (OR (AND p3 p1) (AND p2 p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), true, (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X p0)), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 504 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 8 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p2) (AND (NOT p1) p3)), (NOT p3), (NOT p3), (NOT p3)]
Incomplete random walk after 10006 steps, including 3 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 21:47:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:47:14] [INFO ] Invariant cache hit.
[2023-03-19 21:47:14] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:47:16] [INFO ] After 1946ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-19 21:47:16] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:47:20] [INFO ] After 3426ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-19 21:47:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:47:31] [INFO ] After 10734ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-19 21:47:33] [INFO ] After 13675ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 286 ms.
[2023-03-19 21:47:34] [INFO ] After 17464ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 305 transition count 7813
Applied a total of 123 rules in 203 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7936 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 305/305 places, 7813/7936 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-19 21:47:34] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
// Phase 1: matrix 2609 rows 305 cols
[2023-03-19 21:47:34] [INFO ] Computed 1 place invariants in 14 ms
[2023-03-19 21:47:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:47:35] [INFO ] After 868ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 21:47:35] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:47:36] [INFO ] After 770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 21:47:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:47:38] [INFO ] After 1791ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 21:47:38] [INFO ] After 2096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-19 21:47:38] [INFO ] After 3031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 305 transition count 7810
Applied a total of 3 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7813 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7810/7813 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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 260022 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 260022 steps, saw 204299 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 21:47:41] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 21:47:41] [INFO ] Computed 1 place invariants in 17 ms
[2023-03-19 21:47:41] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:47:42] [INFO ] After 1069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 21:47:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:47:44] [INFO ] After 1442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 21:47:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:47:45] [INFO ] After 1126ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 21:47:45] [INFO ] After 1311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 263 ms.
[2023-03-19 21:47:45] [INFO ] After 3084ms 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, 7810/7810 transitions.
Applied a total of 0 rules in 184 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 184 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 188 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2023-03-19 21:47:46] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 21:47:46] [INFO ] Invariant cache hit.
[2023-03-19 21:47:46] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-19 21:47:46] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 21:47:46] [INFO ] Invariant cache hit.
[2023-03-19 21:47:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:47:54] [INFO ] Implicit Places using invariants and state equation in 8080 ms returned []
Implicit Place search using SMT with State Equation took 8508 ms to find 0 implicit places.
[2023-03-19 21:47:55] [INFO ] Redundant transitions in 646 ms returned []
[2023-03-19 21:47:55] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 21:47:55] [INFO ] Invariant cache hit.
[2023-03-19 21:47:57] [INFO ] Dead Transitions using invariants and state equation in 1862 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11219 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5000 edges and 305 vertex of which 26 / 305 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 2912 transitions
Ensure Unique test removed 2517 transitions
Reduce isomorphic transitions removed 5429 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 283 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 282 transition count 2378
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 280 transition count 2378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 278 transition count 2376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 278 transition count 2375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 278 transition count 2374
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 14 place count 277 transition count 2374
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 277 transition count 2373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 276 transition count 2373
Applied a total of 16 rules in 189 ms. Remains 276 /305 variables (removed 29) and now considering 2373/7810 (removed 5437) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2373 rows 276 cols
[2023-03-19 21:47:57] [INFO ] Computed 1 place invariants in 19 ms
[2023-03-19 21:47:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:47:58] [INFO ] After 674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 21:47:58] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:47:58] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 21:47:58] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-19 21:47:59] [INFO ] After 224ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 21:47:59] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-19 21:47:59] [INFO ] After 1246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X p0), (X (X (NOT (OR (AND p3 p1) (AND p2 p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), true, (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X p0)), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (G (NOT (AND p1 p2 (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (OR (AND (NOT p1) p2) (AND (NOT p1) p3))), (F (AND p1 (NOT p2) (NOT p3))), (F (OR (AND p1 p2) (AND p1 p3))), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (OR p2 p3))]
Knowledge based reduction with 11 factoid took 749 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Support contains 7 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 21:48:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 21:48:00] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 21:48:01] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-19 21:48:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:48:01] [INFO ] Invariant cache hit.
[2023-03-19 21:48:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:48:07] [INFO ] Implicit Places using invariants and state equation in 6300 ms returned []
Implicit Place search using SMT with State Equation took 6733 ms to find 0 implicit places.
[2023-03-19 21:48:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:48:07] [INFO ] Invariant cache hit.
[2023-03-19 21:48:09] [INFO ] Dead Transitions using invariants and state equation in 1860 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8623 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 p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (NOT (OR (AND (NOT p1) p3) (AND p2 (NOT p3)))))), true, (X (X (NOT (AND p1 p3)))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 463 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-19 21:48:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:48:10] [INFO ] Invariant cache hit.
[2023-03-19 21:48:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:48:11] [INFO ] After 1161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 21:48:11] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 21:48:13] [INFO ] After 1741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 21:48:13] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:48:14] [INFO ] After 1179ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 21:48:14] [INFO ] After 1441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-19 21:48:14] [INFO ] After 3464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 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 203 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 203 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 261301 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 261301 steps, saw 205267 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 21:48:18] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 21:48:18] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 21:48:18] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:48:19] [INFO ] After 1068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 21:48:19] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-19 21:48:20] [INFO ] After 1444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 21:48:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:48:21] [INFO ] After 1131ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 21:48:22] [INFO ] After 1316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 272 ms.
[2023-03-19 21:48:22] [INFO ] After 3114ms 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, 7810/7810 transitions.
Applied a total of 0 rules in 184 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 184 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 195 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2023-03-19 21:48:22] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 21:48:22] [INFO ] Invariant cache hit.
[2023-03-19 21:48:23] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-19 21:48:23] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 21:48:23] [INFO ] Invariant cache hit.
[2023-03-19 21:48:23] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:48:30] [INFO ] Implicit Places using invariants and state equation in 7580 ms returned []
Implicit Place search using SMT with State Equation took 8006 ms to find 0 implicit places.
[2023-03-19 21:48:31] [INFO ] Redundant transitions in 657 ms returned []
[2023-03-19 21:48:31] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 21:48:31] [INFO ] Invariant cache hit.
[2023-03-19 21:48:33] [INFO ] Dead Transitions using invariants and state equation in 1856 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10729 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5000 edges and 305 vertex of which 26 / 305 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 2912 transitions
Ensure Unique test removed 2517 transitions
Reduce isomorphic transitions removed 5429 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 283 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 282 transition count 2378
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 280 transition count 2378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 278 transition count 2376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 278 transition count 2375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 278 transition count 2374
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 14 place count 277 transition count 2374
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 277 transition count 2373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 276 transition count 2373
Applied a total of 16 rules in 195 ms. Remains 276 /305 variables (removed 29) and now considering 2373/7810 (removed 5437) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2373 rows 276 cols
[2023-03-19 21:48:33] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 21:48:33] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:48:34] [INFO ] After 674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 21:48:34] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 21:48:34] [INFO ] After 707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 21:48:34] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-19 21:48:35] [INFO ] After 226ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 21:48:35] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-19 21:48:35] [INFO ] After 1239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (NOT (OR (AND (NOT p1) p3) (AND p2 (NOT p3)))))), true, (X (X (NOT (AND p1 p3)))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (OR (AND p2 (NOT p3)) (AND (NOT p1) p3))), (F (AND p1 (NOT p3))), (F (AND p1 p3)), (F (OR p2 p3))]
Knowledge based reduction with 9 factoid took 533 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 65 reset in 454 ms.
Product exploration explored 100000 steps with 33 reset in 421 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (OR (AND (NOT p1) p3) (AND p2 (NOT p3))), (NOT p3), (NOT p3)]
Support contains 7 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 21:48:38] [INFO ] Redundant transitions in 662 ms returned []
[2023-03-19 21:48:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 21:48:38] [INFO ] Computed 1 place invariants in 22 ms
[2023-03-19 21:48:40] [INFO ] Dead Transitions using invariants and state equation in 1962 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2822 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 7 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 23 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 21:48:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:48:40] [INFO ] Invariant cache hit.
[2023-03-19 21:48:41] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-19 21:48:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:48:41] [INFO ] Invariant cache hit.
[2023-03-19 21:48:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 21:48:47] [INFO ] Implicit Places using invariants and state equation in 6864 ms returned []
Implicit Place search using SMT with State Equation took 7272 ms to find 0 implicit places.
[2023-03-19 21:48:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 21:48:47] [INFO ] Invariant cache hit.
[2023-03-19 21:48:49] [INFO ] Dead Transitions using invariants and state equation in 1920 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9215 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b12-LTLFireability-02 finished in 105848 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)))'
[2023-03-19 21:48:50] [INFO ] Flatten gal took : 234 ms
[2023-03-19 21:48:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 21:48:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7936 transitions and 31616 arcs took 46 ms.
Total runtime 445090 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1917/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1917/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Szymanski-PT-b12-LTLFireability-02
Could not compute solution for formula : Szymanski-PT-b12-LTLFireability-09

BK_STOP 1679262533767

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-b12-LTLFireability-02
ltl formula formula --ltl=/tmp/1917/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 305 places, 7936 transitions and 31616 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.800 real 0.260 user 0.240 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1917/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1917/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1917/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1917/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name Szymanski-PT-b12-LTLFireability-09
ltl formula formula --ltl=/tmp/1917/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 305 places, 7936 transitions and 31616 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.740 real 0.260 user 0.270 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1917/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1917/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1917/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1917/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5607b25b13f4]
1: pnml2lts-mc(+0xa2496) [0x5607b25b1496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f8ff9cbc140]
3: pnml2lts-mc(+0x405be5) [0x5607b2914be5]
4: pnml2lts-mc(+0x16b3f9) [0x5607b267a3f9]
5: pnml2lts-mc(+0x164ac4) [0x5607b2673ac4]
6: pnml2lts-mc(+0x272e0a) [0x5607b2781e0a]
7: pnml2lts-mc(+0xb61f0) [0x5607b25c51f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f8ff9b0f4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f8ff9b0f67a]
10: pnml2lts-mc(+0xa1581) [0x5607b25b0581]
11: pnml2lts-mc(+0xa1910) [0x5607b25b0910]
12: pnml2lts-mc(+0xa32a2) [0x5607b25b22a2]
13: pnml2lts-mc(+0xa50f4) [0x5607b25b40f4]
14: pnml2lts-mc(+0xa516b) [0x5607b25b416b]
15: pnml2lts-mc(+0x3f34b3) [0x5607b29024b3]
16: pnml2lts-mc(+0x7c63d) [0x5607b258b63d]
17: pnml2lts-mc(+0x67d86) [0x5607b2576d86]
18: pnml2lts-mc(+0x60a8a) [0x5607b256fa8a]
19: pnml2lts-mc(+0x5eb15) [0x5607b256db15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f8ff9af7d0a]
21: pnml2lts-mc(+0x6075e) [0x5607b256f75e]

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-b12"
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-b12, 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-167912706800492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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