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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.9K Feb 26 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.3K 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 8.2K Feb 26 17:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 17:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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-b10-LTLFireability-00
FORMULA_NAME Szymanski-PT-b10-LTLFireability-01
FORMULA_NAME Szymanski-PT-b10-LTLFireability-02
FORMULA_NAME Szymanski-PT-b10-LTLFireability-03
FORMULA_NAME Szymanski-PT-b10-LTLFireability-04
FORMULA_NAME Szymanski-PT-b10-LTLFireability-05
FORMULA_NAME Szymanski-PT-b10-LTLFireability-06
FORMULA_NAME Szymanski-PT-b10-LTLFireability-07
FORMULA_NAME Szymanski-PT-b10-LTLFireability-08
FORMULA_NAME Szymanski-PT-b10-LTLFireability-09
FORMULA_NAME Szymanski-PT-b10-LTLFireability-10
FORMULA_NAME Szymanski-PT-b10-LTLFireability-11
FORMULA_NAME Szymanski-PT-b10-LTLFireability-12
FORMULA_NAME Szymanski-PT-b10-LTLFireability-13
FORMULA_NAME Szymanski-PT-b10-LTLFireability-14
FORMULA_NAME Szymanski-PT-b10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679258903428

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-b10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 20:48:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 20:48:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 20:48:25] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2023-03-19 20:48:25] [INFO ] Transformed 568 places.
[2023-03-19 20:48:25] [INFO ] Transformed 8320 transitions.
[2023-03-19 20:48:25] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 429 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 260 places in 20 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Applied a total of 2 rules in 133 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2023-03-19 20:48:25] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2023-03-19 20:48:26] [INFO ] Computed 1 place invariants in 76 ms
[2023-03-19 20:48:26] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-19 20:48:26] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 20:48:26] [INFO ] Invariant cache hit.
[2023-03-19 20:48:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:48:30] [INFO ] Implicit Places using invariants and state equation in 3842 ms returned []
Implicit Place search using SMT with State Equation took 4495 ms to find 0 implicit places.
[2023-03-19 20:48:30] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 20:48:30] [INFO ] Invariant cache hit.
[2023-03-19 20:48:32] [INFO ] Dead Transitions using invariants and state equation in 2253 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 8064/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6886 ms. Remains : 306/308 places, 8064/8064 transitions.
Support contains 48 out of 306 places after structural reductions.
[2023-03-19 20:48:33] [INFO ] Flatten gal took : 488 ms
[2023-03-19 20:48:33] [INFO ] Flatten gal took : 268 ms
[2023-03-19 20:48:34] [INFO ] Input system was already deterministic with 8064 transitions.
Incomplete random walk after 10006 steps, including 4 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) 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 14) 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 14) 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 14) 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 13) 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 13) seen :1
Running SMT prover for 12 properties.
[2023-03-19 20:48:34] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 20:48:34] [INFO ] Invariant cache hit.
[2023-03-19 20:48:35] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 20:48:42] [INFO ] After 8002ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 20:48:43] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:48:52] [INFO ] After 9872ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 20:48:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:49:07] [INFO ] After 14905ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-19 20:49:07] [INFO ] After 14909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-19 20:49:07] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 258 ms.
Support contains 28 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 306 transition count 7952
Applied a total of 112 rules in 423 ms. Remains 306 /306 variables (removed 0) and now considering 7952/8064 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 306/306 places, 7952/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-19 20:49:09] [INFO ] Flow matrix only has 2621 transitions (discarded 5331 similar events)
// Phase 1: matrix 2621 rows 306 cols
[2023-03-19 20:49:09] [INFO ] Computed 1 place invariants in 25 ms
[2023-03-19 20:49:09] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:49:13] [INFO ] After 3925ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 20:49:13] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:49:17] [INFO ] After 3837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 20:49:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:49:25] [INFO ] After 8373ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-19 20:49:26] [INFO ] Deduced a trap composed of 74 places in 280 ms of which 8 ms to minimize.
[2023-03-19 20:49:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2023-03-19 20:49:38] [INFO ] After 21034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 20:49:38] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 276 ms.
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7952/7952 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 306 transition count 7949
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 305 transition count 7821
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 305 transition count 7821
Applied a total of 5 rules in 289 ms. Remains 305 /306 variables (removed 1) and now considering 7821/7952 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 305/306 places, 7821/7952 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 111073 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 111073 steps, saw 86727 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :2
Running SMT prover for 7 properties.
[2023-03-19 20:49:42] [INFO ] Flow matrix only has 2617 transitions (discarded 5204 similar events)
// Phase 1: matrix 2617 rows 305 cols
[2023-03-19 20:49:42] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 20:49:42] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:49:45] [INFO ] After 3120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 20:49:45] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:49:51] [INFO ] After 5784ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 20:49:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:49:57] [INFO ] After 6152ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 20:49:58] [INFO ] After 7732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1797 ms.
[2023-03-19 20:50:00] [INFO ] After 15443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 111 ms.
Support contains 18 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7821/7821 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 7820
Applied a total of 1 rules in 352 ms. Remains 305 /305 variables (removed 0) and now considering 7820/7821 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 353 ms. Remains : 305/305 places, 7820/7821 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) 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 7) 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 7) seen :1
Running SMT prover for 6 properties.
[2023-03-19 20:50:01] [INFO ] Flow matrix only has 2616 transitions (discarded 5204 similar events)
// Phase 1: matrix 2616 rows 305 cols
[2023-03-19 20:50:01] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 20:50:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:50:05] [INFO ] After 3884ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 20:50:05] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:50:08] [INFO ] After 3273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 20:50:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:50:19] [INFO ] After 10634ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 20:50:20] [INFO ] Deduced a trap composed of 103 places in 266 ms of which 1 ms to minimize.
[2023-03-19 20:50:20] [INFO ] Deduced a trap composed of 103 places in 262 ms of which 2 ms to minimize.
[2023-03-19 20:50:21] [INFO ] Deduced a trap composed of 132 places in 218 ms of which 1 ms to minimize.
[2023-03-19 20:50:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1071 ms
[2023-03-19 20:50:22] [INFO ] After 13644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 5644 ms.
[2023-03-19 20:50:28] [INFO ] After 22713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 119 ms.
Support contains 16 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7820/7820 transitions.
Applied a total of 0 rules in 237 ms. Remains 305 /305 variables (removed 0) and now considering 7820/7820 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 305/305 places, 7820/7820 transitions.
Computed a total of 12 stabilizing places and 2432 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 50 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:50:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 20:50:28] [INFO ] Computed 1 place invariants in 17 ms
[2023-03-19 20:50:29] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-19 20:50:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:50:29] [INFO ] Invariant cache hit.
[2023-03-19 20:50:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:50:36] [INFO ] Implicit Places using invariants and state equation in 6879 ms returned []
Implicit Place search using SMT with State Equation took 7332 ms to find 0 implicit places.
[2023-03-19 20:50:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:50:36] [INFO ] Invariant cache hit.
[2023-03-19 20:50:38] [INFO ] Dead Transitions using invariants and state equation in 2165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9550 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s97 1) (GEQ s289 1) (OR (LT s99 1) (LT s260 1)) (OR (LT s14 1) (LT s267 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 3 ms.
FORMULA Szymanski-PT-b10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-00 finished in 9880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 557 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:50:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:50:39] [INFO ] Invariant cache hit.
[2023-03-19 20:50:39] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-19 20:50:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:50:39] [INFO ] Invariant cache hit.
[2023-03-19 20:50:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:50:46] [INFO ] Implicit Places using invariants and state equation in 6679 ms returned []
Implicit Place search using SMT with State Equation took 7136 ms to find 0 implicit places.
[2023-03-19 20:50:47] [INFO ] Redundant transitions in 1035 ms returned []
[2023-03-19 20:50:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:50:47] [INFO ] Invariant cache hit.
[2023-03-19 20:50:49] [INFO ] Dead Transitions using invariants and state equation in 2152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10889 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s52 1) (GEQ s258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 268 steps with 0 reset in 10 ms.
FORMULA Szymanski-PT-b10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-02 finished in 10968 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(((X(p1)||F(p2))&&p0))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 227 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2023-03-19 20:50:49] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2023-03-19 20:50:49] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 20:50:50] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-19 20:50:50] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 20:50:50] [INFO ] Invariant cache hit.
[2023-03-19 20:50:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:50:56] [INFO ] Implicit Places using invariants and state equation in 5859 ms returned []
Implicit Place search using SMT with State Equation took 6331 ms to find 0 implicit places.
[2023-03-19 20:50:56] [INFO ] Redundant transitions in 726 ms returned []
[2023-03-19 20:50:56] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 20:50:56] [INFO ] Invariant cache hit.
[2023-03-19 20:50:59] [INFO ] Dead Transitions using invariants and state equation in 2149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9444 ms. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s268 1)), p2:(OR (LT s91 1) (LT s286 1)), p1:(AND (GEQ s75 1) (GEQ s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 381 steps with 0 reset in 11 ms.
FORMULA Szymanski-PT-b10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-04 finished in 9663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p0||X((!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 62 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:50:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 20:50:59] [INFO ] Computed 1 place invariants in 24 ms
[2023-03-19 20:50:59] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-19 20:50:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:50:59] [INFO ] Invariant cache hit.
[2023-03-19 20:51:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:51:06] [INFO ] Implicit Places using invariants and state equation in 7016 ms returned []
Implicit Place search using SMT with State Equation took 7478 ms to find 0 implicit places.
[2023-03-19 20:51:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:51:06] [INFO ] Invariant cache hit.
[2023-03-19 20:51:08] [INFO ] Dead Transitions using invariants and state equation in 2130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9672 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), false, (AND p0 (NOT p1)), true]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s15 1) (GEQ s282 1)), p1:(AND (NOT (AND (GEQ s81 1) (GEQ s257 1))) (NOT (AND (GEQ s15 1) (GEQ s282 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 277 steps with 0 reset in 5 ms.
FORMULA Szymanski-PT-b10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-05 finished in 9898 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) U G(!p1))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 53 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:51:09] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:51:09] [INFO ] Invariant cache hit.
[2023-03-19 20:51:09] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-19 20:51:09] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:51:09] [INFO ] Invariant cache hit.
[2023-03-19 20:51:10] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:51:16] [INFO ] Implicit Places using invariants and state equation in 6385 ms returned []
Implicit Place search using SMT with State Equation took 6821 ms to find 0 implicit places.
[2023-03-19 20:51:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:51:16] [INFO ] Invariant cache hit.
[2023-03-19 20:51:18] [INFO ] Dead Transitions using invariants and state equation in 1968 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8852 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 205 ms :[p1, p1, true, (AND (NOT p1) (NOT p0)), p1]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s110 1) (GEQ s259 1)), p0:(AND (GEQ s85 1) (GEQ s300 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 27 reset in 523 ms.
Product exploration explored 100000 steps with 3 reset in 497 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 441 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, p1, p1]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished Best-First random walk after 272 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=136 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 410 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 98 ms :[true, p1, p1]
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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 20:51:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:51:20] [INFO ] Invariant cache hit.
[2023-03-19 20:51:20] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-19 20:51:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:51:20] [INFO ] Invariant cache hit.
[2023-03-19 20:51:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:51:27] [INFO ] Implicit Places using invariants and state equation in 6366 ms returned []
Implicit Place search using SMT with State Equation took 6824 ms to find 0 implicit places.
[2023-03-19 20:51:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:51:27] [INFO ] Invariant cache hit.
[2023-03-19 20:51:29] [INFO ] Dead Transitions using invariants and state equation in 2248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9107 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 : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, p1, p1]
Incomplete random walk after 10006 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10061 steps, run visited all 1 properties in 172 ms. (steps per millisecond=58 )
Probabilistic random walk after 10061 steps, saw 7881 distinct states, run finished after 172 ms. (steps per millisecond=58 ) properties seen :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 77 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 106 ms :[true, p1, p1]
Entered a terminal (fully accepting) state of product in 2464 steps with 6 reset in 20 ms.
FORMULA Szymanski-PT-b10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-06 finished in 21500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (G(p1) U p2)))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 225 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:51:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:51:30] [INFO ] Invariant cache hit.
[2023-03-19 20:51:31] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-19 20:51:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:51:31] [INFO ] Invariant cache hit.
[2023-03-19 20:51:31] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:51:38] [INFO ] Implicit Places using invariants and state equation in 6710 ms returned []
Implicit Place search using SMT with State Equation took 7149 ms to find 0 implicit places.
[2023-03-19 20:51:38] [INFO ] Redundant transitions in 961 ms returned []
[2023-03-19 20:51:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:51:38] [INFO ] Invariant cache hit.
[2023-03-19 20:51:41] [INFO ] Dead Transitions using invariants and state equation in 2126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10476 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), true, p0, (NOT p1), (NOT p2), (AND p0 (NOT p1))]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s58 1) (GEQ s295 1)), p0:(AND (OR (AND (GEQ s91 1) (GEQ s269 1)) (AND (GEQ s58 1) (GEQ s295 1))) (GEQ s58 1) (GEQ s295 1)), p1:(AND (GEQ s6 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 17 reset in 454 ms.
Product exploration explored 100000 steps with 17 reset in 502 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 28 factoid took 1453 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), true, p0, (NOT p1), (NOT p2), (AND p0 (NOT p1))]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-19 20:51:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:51:44] [INFO ] Invariant cache hit.
[2023-03-19 20:51:44] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:51:45] [INFO ] After 944ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2023-03-19 20:51:45] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:51:48] [INFO ] After 2899ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-19 20:51:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:51:52] [INFO ] After 4149ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2023-03-19 20:51:59] [INFO ] After 11176ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 2722 ms.
[2023-03-19 20:52:02] [INFO ] After 16904ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 90 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 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 305 transition count 7811
Applied a total of 125 rules in 198 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7936 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 305/305 places, 7811/7936 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) 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 3) seen :0
Finished Best-First random walk after 7218 steps, including 2 resets, run visited all 3 properties in 12 ms. (steps per millisecond=601 )
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (G (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND (NOT p2) (NOT p1) p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p1) p0)), (F (AND (NOT p2) p1 (NOT p0))), (F p1), (F (AND p1 (NOT p0))), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 31 factoid took 1736 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p0)), true, p0]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p0)), true, p0]
[2023-03-19 20:52:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:52:04] [INFO ] Invariant cache hit.
[2023-03-19 20:52:06] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:52:07] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2023-03-19 20:52:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:52:09] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:52:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:52:09] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2023-03-19 20:52:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:52:11] [INFO ] [Nat]Added 147 Read/Feed constraints in 1487 ms returned sat
[2023-03-19 20:52:12] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2721 transitions) in 546 ms.
[2023-03-19 20:52:12] [INFO ] Added : 0 causal constraints over 0 iterations in 724 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p0))
Support contains 4 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:52:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:52:12] [INFO ] Invariant cache hit.
[2023-03-19 20:52:12] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-19 20:52:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:52:12] [INFO ] Invariant cache hit.
[2023-03-19 20:52:13] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:52:19] [INFO ] Implicit Places using invariants and state equation in 6743 ms returned []
Implicit Place search using SMT with State Equation took 7184 ms to find 0 implicit places.
[2023-03-19 20:52:20] [INFO ] Redundant transitions in 886 ms returned []
[2023-03-19 20:52:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:52:20] [INFO ] Invariant cache hit.
[2023-03-19 20:52:22] [INFO ] Dead Transitions using invariants and state equation in 2003 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10282 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), true, (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 219 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p2) (NOT p0)), true, p0]
Incomplete random walk after 10003 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) 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 2) 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 2) seen :0
Finished probabilistic random walk after 10338 steps, run visited all 2 properties in 222 ms. (steps per millisecond=46 )
Probabilistic random walk after 10338 steps, saw 8117 distinct states, run finished after 223 ms. (steps per millisecond=46 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), true, (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p0)), true, p0]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) (NOT p0)), true, p0]
[2023-03-19 20:52:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:52:23] [INFO ] Invariant cache hit.
[2023-03-19 20:52:25] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:52:26] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2023-03-19 20:52:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:52:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 20:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:52:28] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2023-03-19 20:52:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:52:30] [INFO ] [Nat]Added 147 Read/Feed constraints in 1474 ms returned sat
[2023-03-19 20:52:30] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2721 transitions) in 414 ms.
[2023-03-19 20:52:30] [INFO ] Added : 0 causal constraints over 0 iterations in 597 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p0))
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p2) (NOT p0)), true, p0]
Product exploration explored 100000 steps with 8 reset in 572 ms.
Product exploration explored 100000 steps with 75 reset in 649 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 206 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:52:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:52:32] [INFO ] Invariant cache hit.
[2023-03-19 20:52:32] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-19 20:52:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:52:32] [INFO ] Invariant cache hit.
[2023-03-19 20:52:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:52:40] [INFO ] Implicit Places using invariants and state equation in 7543 ms returned []
Implicit Place search using SMT with State Equation took 7988 ms to find 0 implicit places.
[2023-03-19 20:52:41] [INFO ] Redundant transitions in 993 ms returned []
[2023-03-19 20:52:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:52:41] [INFO ] Invariant cache hit.
[2023-03-19 20:52:43] [INFO ] Dead Transitions using invariants and state equation in 2143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11348 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b10-LTLFireability-07 finished in 73468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((G(F(!p1))||G(p0)))) U p1))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 50 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:52:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:52:44] [INFO ] Invariant cache hit.
[2023-03-19 20:52:44] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-19 20:52:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:52:44] [INFO ] Invariant cache hit.
[2023-03-19 20:52:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:52:51] [INFO ] Implicit Places using invariants and state equation in 6398 ms returned []
Implicit Place search using SMT with State Equation took 6827 ms to find 0 implicit places.
[2023-03-19 20:52:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:52:51] [INFO ] Invariant cache hit.
[2023-03-19 20:52:52] [INFO ] Dead Transitions using invariants and state equation in 1976 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8858 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p0) p1), p1, p1]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s104 1) (GEQ s258 1)), p0:(AND (GEQ s99 1) (GEQ s261 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]]
Product exploration explored 100000 steps with 31 reset in 478 ms.
Product exploration explored 100000 steps with 3 reset in 424 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 392 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), p1, p1]
Incomplete random walk after 10003 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Finished Best-First random walk after 43 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 468 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), p1, p1]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), p1, p1]
[2023-03-19 20:52:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:52:55] [INFO ] Invariant cache hit.
[2023-03-19 20:52:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:52:58] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2023-03-19 20:52:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:53:00] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:53:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:53:01] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2023-03-19 20:53:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:53:01] [INFO ] [Nat]Added 147 Read/Feed constraints in 744 ms returned sat
[2023-03-19 20:53:02] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2721 transitions) in 392 ms.
[2023-03-19 20:53:02] [INFO ] Added : 1 causal constraints over 1 iterations in 655 ms. Result :sat
Could not prove EG (NOT p1)
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 196 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:53:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:02] [INFO ] Invariant cache hit.
[2023-03-19 20:53:03] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-19 20:53:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:03] [INFO ] Invariant cache hit.
[2023-03-19 20:53:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:53:09] [INFO ] Implicit Places using invariants and state equation in 6433 ms returned []
Implicit Place search using SMT with State Equation took 6893 ms to find 0 implicit places.
[2023-03-19 20:53:10] [INFO ] Redundant transitions in 973 ms returned []
[2023-03-19 20:53:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:10] [INFO ] Invariant cache hit.
[2023-03-19 20:53:12] [INFO ] Dead Transitions using invariants and state equation in 1966 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10053 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), p1, p1]
Finished random walk after 4097 steps, including 3 resets, run visited all 2 properties in 23 ms. (steps per millisecond=178 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 275 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), p1, p1]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), p1, p1]
[2023-03-19 20:53:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:13] [INFO ] Invariant cache hit.
[2023-03-19 20:53:15] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:53:16] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2023-03-19 20:53:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:53:18] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:53:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:53:19] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2023-03-19 20:53:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:53:19] [INFO ] [Nat]Added 147 Read/Feed constraints in 759 ms returned sat
[2023-03-19 20:53:20] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2721 transitions) in 549 ms.
[2023-03-19 20:53:20] [INFO ] Added : 1 causal constraints over 1 iterations in 802 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), p1, p1]
Product exploration explored 100000 steps with 1 reset in 540 ms.
Product exploration explored 100000 steps with 65 reset in 623 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 209 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:53:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:22] [INFO ] Invariant cache hit.
[2023-03-19 20:53:22] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-19 20:53:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:22] [INFO ] Invariant cache hit.
[2023-03-19 20:53:23] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:53:31] [INFO ] Implicit Places using invariants and state equation in 8416 ms returned []
Implicit Place search using SMT with State Equation took 8859 ms to find 0 implicit places.
[2023-03-19 20:53:32] [INFO ] Redundant transitions in 869 ms returned []
[2023-03-19 20:53:32] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:32] [INFO ] Invariant cache hit.
[2023-03-19 20:53:34] [INFO ] Dead Transitions using invariants and state equation in 2216 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12188 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b10-LTLFireability-08 finished in 50529 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)&&(p1||F(p2)))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 247 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:53:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:34] [INFO ] Invariant cache hit.
[2023-03-19 20:53:35] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-19 20:53:35] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:35] [INFO ] Invariant cache hit.
[2023-03-19 20:53:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:53:41] [INFO ] Implicit Places using invariants and state equation in 6409 ms returned []
Implicit Place search using SMT with State Equation took 6855 ms to find 0 implicit places.
[2023-03-19 20:53:42] [INFO ] Redundant transitions in 984 ms returned []
[2023-03-19 20:53:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:42] [INFO ] Invariant cache hit.
[2023-03-19 20:53:44] [INFO ] Dead Transitions using invariants and state equation in 2217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10315 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s40 1) (LT s280 1)) (OR (LT s37 1) (LT s257 1))), p1:(AND (GEQ s31 1) (GEQ s273 1)), p2:(AND (GEQ s37 1) (GEQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 269 steps with 0 reset in 4 ms.
FORMULA Szymanski-PT-b10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-09 finished in 10464 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(p1)&&p0))))'
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 49 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:53:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:45] [INFO ] Invariant cache hit.
[2023-03-19 20:53:45] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-19 20:53:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:45] [INFO ] Invariant cache hit.
[2023-03-19 20:53:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:53:51] [INFO ] Implicit Places using invariants and state equation in 5444 ms returned []
Implicit Place search using SMT with State Equation took 5883 ms to find 0 implicit places.
[2023-03-19 20:53:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:51] [INFO ] Invariant cache hit.
[2023-03-19 20:53:53] [INFO ] Dead Transitions using invariants and state equation in 2148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8081 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-10 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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s91 1) (GEQ s302 1)), p1:(AND (OR (LT s9 1) (LT s284 1) (LT s63 1) (LT s298 1)) (OR (LT s124 1) (LT s276 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 1 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-10 finished in 8252 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)) U p1)||(X(p0)&&G(p2))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 53 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:53:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:53] [INFO ] Invariant cache hit.
[2023-03-19 20:53:53] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-19 20:53:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:53] [INFO ] Invariant cache hit.
[2023-03-19 20:53:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:53:59] [INFO ] Implicit Places using invariants and state equation in 5928 ms returned []
Implicit Place search using SMT with State Equation took 6346 ms to find 0 implicit places.
[2023-03-19 20:53:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:53:59] [INFO ] Invariant cache hit.
[2023-03-19 20:54:01] [INFO ] Dead Transitions using invariants and state equation in 2111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8511 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-11 automaton TGBA Formula[mat=[[{ 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) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s29 1) (GEQ s270 1)), p2:(AND (GEQ s114 1) (GEQ s261 1)), p0:(AND (GEQ s102 1) (GEQ s256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 231 steps with 0 reset in 4 ms.
FORMULA Szymanski-PT-b10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-11 finished in 8819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 28 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2023-03-19 20:54:02] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2023-03-19 20:54:02] [INFO ] Computed 1 place invariants in 24 ms
[2023-03-19 20:54:02] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-19 20:54:02] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 20:54:02] [INFO ] Invariant cache hit.
[2023-03-19 20:54:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:54:08] [INFO ] Implicit Places using invariants and state equation in 5964 ms returned []
Implicit Place search using SMT with State Equation took 6449 ms to find 0 implicit places.
[2023-03-19 20:54:08] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 20:54:08] [INFO ] Invariant cache hit.
[2023-03-19 20:54:10] [INFO ] Dead Transitions using invariants and state equation in 2169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8646 ms. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s286 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 175 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-b10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b10-LTLFireability-13 finished in 8758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 241 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:54:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 20:54:11] [INFO ] Computed 1 place invariants in 26 ms
[2023-03-19 20:54:11] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-19 20:54:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:54:11] [INFO ] Invariant cache hit.
[2023-03-19 20:54:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:54:18] [INFO ] Implicit Places using invariants and state equation in 7040 ms returned []
Implicit Place search using SMT with State Equation took 7520 ms to find 0 implicit places.
[2023-03-19 20:54:19] [INFO ] Redundant transitions in 672 ms returned []
[2023-03-19 20:54:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:54:19] [INFO ] Invariant cache hit.
[2023-03-19 20:54:21] [INFO ] Dead Transitions using invariants and state equation in 2108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10555 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s110 1) (LT s289 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 15 reset in 475 ms.
Product exploration explored 100000 steps with 10 reset in 421 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 119 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 30 ms :[(NOT p0)]
Incomplete random walk after 10007 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 244580 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244580 steps, saw 193742 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 20:54:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:54:25] [INFO ] Invariant cache hit.
[2023-03-19 20:54:25] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:54:26] [INFO ] After 1101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:54:26] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:54:28] [INFO ] After 1718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:54:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:54:32] [INFO ] After 3753ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:54:32] [INFO ] After 4099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-19 20:54:32] [INFO ] After 6106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 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 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 305/305 places, 7808/7936 transitions.
Incomplete random walk after 10003 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 230518 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230518 steps, saw 180279 distinct states, run finished after 3004 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 20:54:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 20:54:36] [INFO ] Computed 3 place invariants in 20 ms
[2023-03-19 20:54:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 20:54:37] [INFO ] After 1007ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:54:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 20:54:38] [INFO ] After 824ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:54:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:54:41] [INFO ] After 3836ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:54:42] [INFO ] After 4401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 688 ms.
[2023-03-19 20:54:43] [INFO ] After 5988ms 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, 7808/7808 transitions.
Applied a total of 0 rules in 202 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 20:54:43] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:54:43] [INFO ] Invariant cache hit.
[2023-03-19 20:54:44] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-19 20:54:44] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:54:44] [INFO ] Invariant cache hit.
[2023-03-19 20:54:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:54:45] [INFO ] Implicit Places using invariants and state equation in 1934 ms returned []
Implicit Place search using SMT with State Equation took 2456 ms to find 0 implicit places.
[2023-03-19 20:54:46] [INFO ] Redundant transitions in 696 ms returned []
[2023-03-19 20:54:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 20:54:46] [INFO ] Invariant cache hit.
[2023-03-19 20:54:49] [INFO ] Dead Transitions using invariants and state equation in 2422 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5790 ms. Remains : 305/305 places, 7808/7808 transitions.
Graph (trivial) has 4944 edges and 305 vertex of which 26 / 305 are part of one of the 4 SCC in 10 ms
Free SCC test removed 22 places
Drop transitions removed 2888 transitions
Ensure Unique test removed 2349 transitions
Reduce isomorphic transitions removed 5237 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 283 transition count 2569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 281 transition count 2569
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 281 transition count 2566
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 278 transition count 2566
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 277 transition count 2565
Drop transitions removed 417 transitions
Redundant transition composition rules discarded 417 transitions
Iterating global reduction 2 with 417 rules applied. Total rules applied 430 place count 277 transition count 2148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 430 place count 277 transition count 2147
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 432 place count 276 transition count 2147
Applied a total of 432 rules in 466 ms. Remains 276 /305 variables (removed 29) and now considering 2147/7808 (removed 5661) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2147 rows 276 cols
[2023-03-19 20:54:49] [INFO ] Computed 3 place invariants in 38 ms
[2023-03-19 20:54:49] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2023-03-19 20:54:50] [INFO ] After 721ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:54:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 20:54:51] [INFO ] After 645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:54:51] [INFO ] State equation strengthened by 280 read => feed constraints.
[2023-03-19 20:54:51] [INFO ] After 452ms SMT Verify possible using 280 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:54:51] [INFO ] After 583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-19 20:54:51] [INFO ] After 1550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 221 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:54:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 20:54:52] [INFO ] Computed 1 place invariants in 14 ms
[2023-03-19 20:54:52] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-19 20:54:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:54:52] [INFO ] Invariant cache hit.
[2023-03-19 20:54:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:54:59] [INFO ] Implicit Places using invariants and state equation in 6833 ms returned []
Implicit Place search using SMT with State Equation took 7305 ms to find 0 implicit places.
[2023-03-19 20:55:00] [INFO ] Redundant transitions in 674 ms returned []
[2023-03-19 20:55:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:00] [INFO ] Invariant cache hit.
[2023-03-19 20:55:02] [INFO ] Dead Transitions using invariants and state equation in 2235 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10468 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 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 243990 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243990 steps, saw 193290 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 20:55:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:05] [INFO ] Invariant cache hit.
[2023-03-19 20:55:05] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:55:06] [INFO ] After 1071ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 20:55:06] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:55:08] [INFO ] After 1645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 20:55:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:55:12] [INFO ] After 3625ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 20:55:12] [INFO ] After 3967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-19 20:55:12] [INFO ] After 5886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 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 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 213 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 305/305 places, 7808/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished Best-First random walk after 797 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=398 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 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)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 70 reset in 502 ms.
Product exploration explored 100000 steps with 23 reset in 583 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 216 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:55:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:14] [INFO ] Invariant cache hit.
[2023-03-19 20:55:15] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-03-19 20:55:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:15] [INFO ] Invariant cache hit.
[2023-03-19 20:55:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:55:22] [INFO ] Implicit Places using invariants and state equation in 7017 ms returned []
Implicit Place search using SMT with State Equation took 7496 ms to find 0 implicit places.
[2023-03-19 20:55:22] [INFO ] Redundant transitions in 669 ms returned []
[2023-03-19 20:55:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:22] [INFO ] Invariant cache hit.
[2023-03-19 20:55:24] [INFO ] Dead Transitions using invariants and state equation in 2145 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10538 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b10-LTLFireability-14 finished in 74133 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)||F(p1))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 53 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:55:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:25] [INFO ] Invariant cache hit.
[2023-03-19 20:55:25] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-19 20:55:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:25] [INFO ] Invariant cache hit.
[2023-03-19 20:55:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:55:31] [INFO ] Implicit Places using invariants and state equation in 5832 ms returned []
Implicit Place search using SMT with State Equation took 6268 ms to find 0 implicit places.
[2023-03-19 20:55:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:31] [INFO ] Invariant cache hit.
[2023-03-19 20:55:33] [INFO ] Dead Transitions using invariants and state equation in 2128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8450 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s37 1) (LT s261 1) (AND (GEQ s108 1) (GEQ s274 1))), p0:(OR (LT s105 1) (LT s256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 648 ms.
Product exploration explored 100000 steps with 50000 reset in 713 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 p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b10-LTLFireability-15 finished in 10069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (G(p1) U p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((G(F(!p1))||G(p0)))) U p1))'
Found a Lengthening insensitive property : Szymanski-PT-b10-LTLFireability-08
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p0) p1), p1, p1]
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 75 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 20:55:35] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:35] [INFO ] Invariant cache hit.
[2023-03-19 20:55:36] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-19 20:55:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:36] [INFO ] Invariant cache hit.
[2023-03-19 20:55:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:55:42] [INFO ] Implicit Places using invariants and state equation in 5885 ms returned []
Implicit Place search using SMT with State Equation took 6432 ms to find 0 implicit places.
[2023-03-19 20:55:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:42] [INFO ] Invariant cache hit.
[2023-03-19 20:55:44] [INFO ] Dead Transitions using invariants and state equation in 1988 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8513 ms. Remains : 305/306 places, 7936/8064 transitions.
Running random walk in product with property : Szymanski-PT-b10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s104 1) (GEQ s258 1)), p0:(AND (GEQ s99 1) (GEQ s261 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 40 reset in 390 ms.
Product exploration explored 100000 steps with 63 reset in 439 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 429 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Finished Best-First random walk after 39 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 417 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), p1, p1]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), p1, p1]
[2023-03-19 20:55:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:46] [INFO ] Invariant cache hit.
[2023-03-19 20:55:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:55:48] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2023-03-19 20:55:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:55:51] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:55:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:55:51] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2023-03-19 20:55:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:55:52] [INFO ] [Nat]Added 147 Read/Feed constraints in 740 ms returned sat
[2023-03-19 20:55:52] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2721 transitions) in 380 ms.
[2023-03-19 20:55:53] [INFO ] Added : 1 causal constraints over 1 iterations in 635 ms. Result :sat
Could not prove EG (NOT p1)
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 189 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:55:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:53] [INFO ] Invariant cache hit.
[2023-03-19 20:55:53] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-19 20:55:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:55:53] [INFO ] Invariant cache hit.
[2023-03-19 20:55:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:55:59] [INFO ] Implicit Places using invariants and state equation in 6015 ms returned []
Implicit Place search using SMT with State Equation took 6464 ms to find 0 implicit places.
[2023-03-19 20:56:00] [INFO ] Redundant transitions in 679 ms returned []
[2023-03-19 20:56:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:56:00] [INFO ] Invariant cache hit.
[2023-03-19 20:56:02] [INFO ] Dead Transitions using invariants and state equation in 2034 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9389 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 216 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), p1, p1]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Finished Best-First random walk after 254 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=127 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 261 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), p1, p1]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), p1, p1]
[2023-03-19 20:56:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:56:03] [INFO ] Invariant cache hit.
[2023-03-19 20:56:05] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 20:56:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 20:56:06] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2023-03-19 20:56:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 20:56:08] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 20:56:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 20:56:09] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2023-03-19 20:56:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:56:09] [INFO ] [Nat]Added 147 Read/Feed constraints in 736 ms returned sat
[2023-03-19 20:56:10] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2721 transitions) in 445 ms.
[2023-03-19 20:56:10] [INFO ] Added : 1 causal constraints over 1 iterations in 694 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), p1, p1]
Product exploration explored 100000 steps with 24 reset in 440 ms.
Product exploration explored 100000 steps with 4 reset in 386 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 20:56:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:56:11] [INFO ] Invariant cache hit.
[2023-03-19 20:56:12] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-19 20:56:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:56:12] [INFO ] Invariant cache hit.
[2023-03-19 20:56:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 20:56:20] [INFO ] Implicit Places using invariants and state equation in 7973 ms returned []
Implicit Place search using SMT with State Equation took 8380 ms to find 0 implicit places.
[2023-03-19 20:56:20] [INFO ] Redundant transitions in 670 ms returned []
[2023-03-19 20:56:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 20:56:20] [INFO ] Invariant cache hit.
[2023-03-19 20:56:23] [INFO ] Dead Transitions using invariants and state equation in 2118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11373 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b10-LTLFireability-08 finished in 47934 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 20:56:23] [INFO ] Flatten gal took : 208 ms
[2023-03-19 20:56:23] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 20:56:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 8064 transitions and 32128 arcs took 48 ms.
Total runtime 478513 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2105/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2105/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2105/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Szymanski-PT-b10-LTLFireability-07
Could not compute solution for formula : Szymanski-PT-b10-LTLFireability-08
Could not compute solution for formula : Szymanski-PT-b10-LTLFireability-14

BK_STOP 1679259388293

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Szymanski-PT-b10-LTLFireability-07
ltl formula formula --ltl=/tmp/2105/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 8064 transitions and 32128 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.820 real 0.300 user 0.260 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2105/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2105/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2105/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2105/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Szymanski-PT-b10-LTLFireability-08
ltl formula formula --ltl=/tmp/2105/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 8064 transitions and 32128 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.260 user 0.280 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2105/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2105/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2105/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2105/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Sequence of Actions to be Executed by the VM

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

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

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