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.r517-tall-167987243600236.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 itstools
Input is EisenbergMcGuire-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243600236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 460K Mar 31 16:48 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 EisenbergMcGuire-PT-05-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680822868821

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-06 23:14:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-06 23:14:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:14:30] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-04-06 23:14:30] [INFO ] Transformed 295 places.
[2023-04-06 23:14:30] [INFO ] Transformed 800 transitions.
[2023-04-06 23:14:30] [INFO ] Found NUPN structural information;
[2023-04-06 23:14:30] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 282 transition count 735
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 282 transition count 735
Applied a total of 26 rules in 48 ms. Remains 282 /295 variables (removed 13) and now considering 735/800 (removed 65) transitions.
[2023-04-06 23:14:30] [INFO ] Flow matrix only has 400 transitions (discarded 335 similar events)
// Phase 1: matrix 400 rows 282 cols
[2023-04-06 23:14:30] [INFO ] Computed 16 invariants in 17 ms
[2023-04-06 23:14:31] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-04-06 23:14:31] [INFO ] Flow matrix only has 400 transitions (discarded 335 similar events)
[2023-04-06 23:14:31] [INFO ] Invariant cache hit.
[2023-04-06 23:14:31] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-04-06 23:14:31] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2023-04-06 23:14:31] [INFO ] Flow matrix only has 400 transitions (discarded 335 similar events)
[2023-04-06 23:14:31] [INFO ] Invariant cache hit.
[2023-04-06 23:14:31] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 282/295 places, 735/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1176 ms. Remains : 282/295 places, 735/800 transitions.
Support contains 49 out of 282 places after structural reductions.
[2023-04-06 23:14:32] [INFO ] Flatten gal took : 71 ms
[2023-04-06 23:14:32] [INFO ] Flatten gal took : 37 ms
[2023-04-06 23:14:32] [INFO ] Input system was already deterministic with 735 transitions.
Support contains 48 out of 282 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 35) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-04-06 23:14:32] [INFO ] Flow matrix only has 400 transitions (discarded 335 similar events)
[2023-04-06 23:14:32] [INFO ] Invariant cache hit.
[2023-04-06 23:14:33] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-06 23:14:33] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2023-04-06 23:14:33] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-04-06 23:14:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-06 23:14:33] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2023-04-06 23:14:34] [INFO ] After 576ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :23
[2023-04-06 23:14:34] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-04-06 23:14:34] [INFO ] After 486ms SMT Verify possible using 144 Read/Feed constraints in natural domain returned unsat :1 sat :23
[2023-04-06 23:14:34] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 6 ms to minimize.
[2023-04-06 23:14:35] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-06 23:14:35] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2023-04-06 23:14:35] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
[2023-04-06 23:14:35] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 1 ms to minimize.
[2023-04-06 23:14:35] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2023-04-06 23:14:35] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2023-04-06 23:14:36] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 2 ms to minimize.
[2023-04-06 23:14:36] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2023-04-06 23:14:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1409 ms
[2023-04-06 23:14:36] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2023-04-06 23:14:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 23:14:36] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 1 ms to minimize.
[2023-04-06 23:14:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-04-06 23:14:36] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 1 ms to minimize.
[2023-04-06 23:14:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-04-06 23:14:36] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2023-04-06 23:14:36] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:14:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2023-04-06 23:14:36] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2023-04-06 23:14:37] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2023-04-06 23:14:37] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 1 ms to minimize.
[2023-04-06 23:14:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 374 ms
[2023-04-06 23:14:37] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 1 ms to minimize.
[2023-04-06 23:14:37] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2023-04-06 23:14:37] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 0 ms to minimize.
[2023-04-06 23:14:37] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2023-04-06 23:14:38] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2023-04-06 23:14:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 495 ms
[2023-04-06 23:14:38] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 1 ms to minimize.
[2023-04-06 23:14:38] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2023-04-06 23:14:38] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 1 ms to minimize.
[2023-04-06 23:14:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 355 ms
[2023-04-06 23:14:38] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2023-04-06 23:14:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-06 23:14:38] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 0 ms to minimize.
[2023-04-06 23:14:38] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 0 ms to minimize.
[2023-04-06 23:14:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2023-04-06 23:14:39] [INFO ] After 4787ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :23
Attempting to minimize the solution found.
Minimization took 665 ms.
[2023-04-06 23:14:39] [INFO ] After 6384ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :23
Fused 24 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 464 ms.
Support contains 32 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 735/735 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 282 transition count 731
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 278 transition count 731
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 8 place count 278 transition count 652
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 166 place count 199 transition count 652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 198 transition count 647
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 198 transition count 647
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 178 transition count 627
Applied a total of 208 rules in 77 ms. Remains 178 /282 variables (removed 104) and now considering 627/735 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 178/282 places, 627/735 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-04-06 23:14:40] [INFO ] Flow matrix only has 292 transitions (discarded 335 similar events)
// Phase 1: matrix 292 rows 178 cols
[2023-04-06 23:14:40] [INFO ] Computed 16 invariants in 7 ms
[2023-04-06 23:14:40] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:14:40] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2023-04-06 23:14:40] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-06 23:14:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:14:40] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:14:41] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-06 23:14:41] [INFO ] State equation strengthened by 140 read => feed constraints.
[2023-04-06 23:14:41] [INFO ] After 275ms SMT Verify possible using 140 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-06 23:14:41] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2023-04-06 23:14:41] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-06 23:14:41] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:14:41] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-04-06 23:14:41] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-04-06 23:14:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 363 ms
[2023-04-06 23:14:42] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 3 ms to minimize.
[2023-04-06 23:14:42] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:14:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-04-06 23:14:42] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:14:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-04-06 23:14:42] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2023-04-06 23:14:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-04-06 23:14:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-04-06 23:14:42] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2023-04-06 23:14:42] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2023-04-06 23:14:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2023-04-06 23:14:42] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2023-04-06 23:14:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-04-06 23:14:42] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-04-06 23:14:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 23:14:43] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2023-04-06 23:14:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-04-06 23:14:43] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 1 ms to minimize.
[2023-04-06 23:14:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-06 23:14:43] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2023-04-06 23:14:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-04-06 23:14:43] [INFO ] After 1961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-04-06 23:14:43] [INFO ] After 2709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 86 ms.
Support contains 27 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 627/627 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 178 transition count 626
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 177 transition count 626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 176 transition count 621
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 176 transition count 621
Applied a total of 4 rules in 54 ms. Remains 176 /178 variables (removed 2) and now considering 621/627 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 176/178 places, 621/627 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 413226 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{0=1, 2=1, 5=1, 6=1, 7=1, 18=1}
Probabilistic random walk after 413226 steps, saw 94994 distinct states, run finished after 3002 ms. (steps per millisecond=137 ) properties seen :6
Running SMT prover for 14 properties.
[2023-04-06 23:14:47] [INFO ] Flow matrix only has 286 transitions (discarded 335 similar events)
// Phase 1: matrix 286 rows 176 cols
[2023-04-06 23:14:47] [INFO ] Computed 16 invariants in 6 ms
[2023-04-06 23:14:47] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-04-06 23:14:47] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:14:47] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-06 23:14:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:14:47] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2023-04-06 23:14:47] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-04-06 23:14:47] [INFO ] State equation strengthened by 136 read => feed constraints.
[2023-04-06 23:14:47] [INFO ] After 207ms SMT Verify possible using 136 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-04-06 23:14:47] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:14:47] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 23:14:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-04-06 23:14:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 178 ms
[2023-04-06 23:14:48] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:14:48] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-04-06 23:14:48] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-04-06 23:14:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-04-06 23:14:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 220 ms
[2023-04-06 23:14:48] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 23:14:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-06 23:14:48] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 5 ms to minimize.
[2023-04-06 23:14:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-04-06 23:14:48] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2023-04-06 23:14:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-04-06 23:14:48] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2023-04-06 23:14:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-04-06 23:14:48] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2023-04-06 23:14:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 23:14:48] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2023-04-06 23:14:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-04-06 23:14:48] [INFO ] After 1288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-04-06 23:14:49] [INFO ] After 1850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 21 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 621/621 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 172 transition count 601
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 172 transition count 601
Applied a total of 8 rules in 18 ms. Remains 172 /176 variables (removed 4) and now considering 601/621 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 172/176 places, 601/621 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 320718 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{4=1}
Probabilistic random walk after 320718 steps, saw 70305 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :1
Running SMT prover for 13 properties.
[2023-04-06 23:14:52] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
// Phase 1: matrix 266 rows 172 cols
[2023-04-06 23:14:52] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 23:14:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:14:52] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:14:53] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-06 23:14:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:14:53] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:14:53] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-04-06 23:14:53] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:14:53] [INFO ] After 184ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-04-06 23:14:53] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2023-04-06 23:14:53] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-06 23:14:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-04-06 23:14:53] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2023-04-06 23:14:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 4 ms to minimize.
[2023-04-06 23:14:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 253 ms
[2023-04-06 23:14:53] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-06 23:14:53] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2023-04-06 23:14:53] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-04-06 23:14:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 188 ms
[2023-04-06 23:14:54] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:14:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-04-06 23:14:54] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-04-06 23:14:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-04-06 23:14:54] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2023-04-06 23:14:54] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2023-04-06 23:14:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-04-06 23:14:54] [INFO ] After 1156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-04-06 23:14:54] [INFO ] After 1644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 20 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 601/601 transitions.
Applied a total of 0 rules in 36 ms. Remains 172 /172 variables (removed 0) and now considering 601/601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 172/172 places, 601/601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) 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 13) 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 13) 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 13) 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 13) 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 13) 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 13) seen :0
Interrupted probabilistic random walk after 475122 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 475122 steps, saw 97258 distinct states, run finished after 3002 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 13 properties.
[2023-04-06 23:14:58] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 23:14:58] [INFO ] Invariant cache hit.
[2023-04-06 23:14:58] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:14:58] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:14:58] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-06 23:14:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:14:58] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:14:58] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-04-06 23:14:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:14:59] [INFO ] After 163ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-04-06 23:14:59] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2023-04-06 23:14:59] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2023-04-06 23:14:59] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:14:59] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2023-04-06 23:14:59] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-04-06 23:14:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-04-06 23:14:59] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2023-04-06 23:14:59] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2023-04-06 23:14:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 536 ms
[2023-04-06 23:14:59] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2023-04-06 23:14:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-06 23:14:59] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-04-06 23:14:59] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 23:14:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2023-04-06 23:15:00] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2023-04-06 23:15:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-06 23:15:00] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2023-04-06 23:15:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-04-06 23:15:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-04-06 23:15:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-04-06 23:15:00] [INFO ] After 1352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-04-06 23:15:00] [INFO ] After 1850ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 81 ms.
Support contains 20 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 601/601 transitions.
Applied a total of 0 rules in 13 ms. Remains 172 /172 variables (removed 0) and now considering 601/601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 172/172 places, 601/601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 601/601 transitions.
Applied a total of 0 rules in 21 ms. Remains 172 /172 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2023-04-06 23:15:00] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 23:15:00] [INFO ] Invariant cache hit.
[2023-04-06 23:15:00] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-04-06 23:15:00] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 23:15:00] [INFO ] Invariant cache hit.
[2023-04-06 23:15:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:15:01] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-04-06 23:15:01] [INFO ] Redundant transitions in 35 ms returned []
[2023-04-06 23:15:01] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 23:15:01] [INFO ] Invariant cache hit.
[2023-04-06 23:15:01] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 749 ms. Remains : 172/172 places, 601/601 transitions.
Graph (trivial) has 428 edges and 172 vertex of which 24 / 172 are part of one of the 5 SCC in 3 ms
Free SCC test removed 19 places
Drop transitions removed 71 transitions
Ensure Unique test removed 323 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 153 transition count 180
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 126 transition count 180
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 55 place count 126 transition count 170
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 79 place count 112 transition count 170
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 143 place count 80 transition count 138
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 153 place count 80 transition count 128
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -76
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 167 place count 73 transition count 204
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 170 place count 73 transition count 201
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 178 place count 73 transition count 193
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 185 place count 73 transition count 186
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 192 place count 66 transition count 186
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 212 place count 66 transition count 186
Applied a total of 212 rules in 23 ms. Remains 66 /172 variables (removed 106) and now considering 186/601 (removed 415) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 186 rows 66 cols
[2023-04-06 23:15:01] [INFO ] Computed 12 invariants in 2 ms
[2023-04-06 23:15:01] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 23:15:01] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 23:15:01] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-06 23:15:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 23:15:01] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 23:15:01] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-04-06 23:15:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-06 23:15:01] [INFO ] After 113ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-04-06 23:15:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-04-06 23:15:01] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-04-06 23:15:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2023-04-06 23:15:01] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-04-06 23:15:02] [INFO ] After 619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X((F(p2)&&p1)) U G(!p3))))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 705
Applied a total of 12 rules in 24 ms. Remains 276 /282 variables (removed 6) and now considering 705/735 (removed 30) transitions.
[2023-04-06 23:15:02] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2023-04-06 23:15:02] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 23:15:02] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-04-06 23:15:02] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:15:02] [INFO ] Invariant cache hit.
[2023-04-06 23:15:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:15:03] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-04-06 23:15:03] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:15:03] [INFO ] Invariant cache hit.
[2023-04-06 23:15:03] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/282 places, 705/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1297 ms. Remains : 276/282 places, 705/735 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p0) p3), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) p3) (AND (NOT p2) p3)), p3, true, (NOT p2), (AND p3 p1), (AND (NOT p2) p3 (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p3 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=p3, acceptance={} source=4 dest: 2}, { cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=(NOT p3), acceptance={} source=4 dest: 4}, { cond=p3, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND p3 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s37 1), p3:(AND (EQ s3 1) (EQ s75 1)), p1:(AND (EQ s3 1) (EQ s75 1)), p2:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1241 reset in 334 ms.
Stack based approach found an accepted trace after 100 steps with 6 reset with depth 78 and stack size 78 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-00 finished in 2112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(X(p1))||F(p2))&&p0))))'
Support contains 6 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 282 transition count 731
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 278 transition count 731
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 8 place count 278 transition count 651
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 168 place count 198 transition count 651
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 174 place count 192 transition count 621
Iterating global reduction 2 with 6 rules applied. Total rules applied 180 place count 192 transition count 621
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 220 place count 172 transition count 601
Applied a total of 220 rules in 41 ms. Remains 172 /282 variables (removed 110) and now considering 601/735 (removed 134) transitions.
[2023-04-06 23:15:04] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
// Phase 1: matrix 266 rows 172 cols
[2023-04-06 23:15:04] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 23:15:04] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-04-06 23:15:04] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 23:15:04] [INFO ] Invariant cache hit.
[2023-04-06 23:15:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:15:05] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2023-04-06 23:15:05] [INFO ] Redundant transitions in 5 ms returned []
[2023-04-06 23:15:05] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 23:15:05] [INFO ] Invariant cache hit.
[2023-04-06 23:15:05] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/282 places, 601/735 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 975 ms. Remains : 172/282 places, 601/735 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (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 : EisenbergMcGuire-PT-05-LTLFireability-01 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)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s29 1)), p2:(AND (EQ s4 1) (EQ s18 1) (EQ s122 1)), p1:(AND (EQ s4 1) (EQ s17 1) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 175 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-01 finished in 1378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1)&&F(p2))))'
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 705
Applied a total of 12 rules in 5 ms. Remains 276 /282 variables (removed 6) and now considering 705/735 (removed 30) transitions.
[2023-04-06 23:15:05] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2023-04-06 23:15:05] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 23:15:06] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-04-06 23:15:06] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:15:06] [INFO ] Invariant cache hit.
[2023-04-06 23:15:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:15:06] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2023-04-06 23:15:06] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:15:06] [INFO ] Invariant cache hit.
[2023-04-06 23:15:06] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/282 places, 705/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1068 ms. Remains : 276/282 places, 705/735 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (AND p1 (NOT p0)), (NOT p1), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s26 1)), p2:(AND (EQ s6 1) (EQ s63 1)), p0:(AND (EQ s3 1) (EQ s16 1) (EQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-02 finished in 1300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 705
Applied a total of 12 rules in 7 ms. Remains 276 /282 variables (removed 6) and now considering 705/735 (removed 30) transitions.
[2023-04-06 23:15:07] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2023-04-06 23:15:07] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 23:15:07] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-04-06 23:15:07] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:15:07] [INFO ] Invariant cache hit.
[2023-04-06 23:15:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:15:07] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-04-06 23:15:07] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:15:07] [INFO ] Invariant cache hit.
[2023-04-06 23:15:08] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/282 places, 705/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 994 ms. Remains : 276/282 places, 705/735 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s3 1) (NEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Product exploration explored 100000 steps with 0 reset in 235 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1063224 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :{}
Probabilistic random walk after 1063224 steps, saw 336015 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:15:11] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:15:11] [INFO ] Invariant cache hit.
[2023-04-06 23:15:11] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-06 23:15:11] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:15:12] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:15:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:15:12] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:15:12] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:15:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:15:12] [INFO ] After 29ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:15:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-04-06 23:15:12] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2023-04-06 23:15:12] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-04-06 23:15:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-04-06 23:15:12] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2023-04-06 23:15:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 313 ms
[2023-04-06 23:15:12] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-06 23:15:12] [INFO ] After 545ms 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 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 705/705 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 276 transition count 700
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 271 transition count 700
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 271 transition count 620
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 191 transition count 620
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 171 transition count 600
Applied a total of 210 rules in 33 ms. Remains 171 /276 variables (removed 105) and now considering 600/705 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 171/276 places, 600/705 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 326782 steps, run visited all 1 properties in 804 ms. (steps per millisecond=406 )
Probabilistic random walk after 326782 steps, saw 71640 distinct states, run finished after 805 ms. (steps per millisecond=405 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-03 finished in 6567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 705
Applied a total of 12 rules in 8 ms. Remains 276 /282 variables (removed 6) and now considering 705/735 (removed 30) transitions.
[2023-04-06 23:15:13] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2023-04-06 23:15:13] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 23:15:13] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-04-06 23:15:13] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:15:13] [INFO ] Invariant cache hit.
[2023-04-06 23:15:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:15:14] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-04-06 23:15:14] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:15:14] [INFO ] Invariant cache hit.
[2023-04-06 23:15:14] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/282 places, 705/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 931 ms. Remains : 276/282 places, 705/735 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s0 1) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-04 finished in 1040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 282 transition count 730
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 277 transition count 730
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 277 transition count 652
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 199 transition count 652
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 172 place count 193 transition count 622
Iterating global reduction 2 with 6 rules applied. Total rules applied 178 place count 193 transition count 622
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 173 transition count 602
Applied a total of 218 rules in 43 ms. Remains 173 /282 variables (removed 109) and now considering 602/735 (removed 133) transitions.
[2023-04-06 23:15:14] [INFO ] Flow matrix only has 267 transitions (discarded 335 similar events)
// Phase 1: matrix 267 rows 173 cols
[2023-04-06 23:15:14] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 23:15:15] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-04-06 23:15:15] [INFO ] Flow matrix only has 267 transitions (discarded 335 similar events)
[2023-04-06 23:15:15] [INFO ] Invariant cache hit.
[2023-04-06 23:15:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:15:15] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2023-04-06 23:15:15] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-06 23:15:15] [INFO ] Flow matrix only has 267 transitions (discarded 335 similar events)
[2023-04-06 23:15:15] [INFO ] Invariant cache hit.
[2023-04-06 23:15:15] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 173/282 places, 602/735 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 830 ms. Remains : 173/282 places, 602/735 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s55 1)), p2:(AND (NEQ s56 1) (NOT (AND (EQ s9 1) (EQ s76 1)))), p1:(AND (EQ s9 1) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 137 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-05 finished in 1120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p1&&G(p2)))&&p0)))'
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 275 transition count 700
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 275 transition count 700
Applied a total of 14 rules in 8 ms. Remains 275 /282 variables (removed 7) and now considering 700/735 (removed 35) transitions.
[2023-04-06 23:15:15] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2023-04-06 23:15:15] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 23:15:16] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-04-06 23:15:16] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:15:16] [INFO ] Invariant cache hit.
[2023-04-06 23:15:16] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:15:16] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2023-04-06 23:15:16] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:15:16] [INFO ] Invariant cache hit.
[2023-04-06 23:15:16] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/282 places, 700/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 886 ms. Remains : 275/282 places, 700/735 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (EQ s14 0) (EQ s134 0)) (OR (EQ s0 0) (EQ s7 0) (EQ s201 0))), p1:(OR (EQ s14 0) (EQ s134 0)), p2:(OR (EQ s2 0) (EQ s250 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 158 ms.
Product exploration explored 100000 steps with 0 reset in 205 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1 p2)), (X p0), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), true, (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 98 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-06 23:15:17] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:15:17] [INFO ] Invariant cache hit.
[2023-04-06 23:15:17] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:15:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:15:17] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:15:17] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:15:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:15:17] [INFO ] After 37ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:15:18] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-04-06 23:15:18] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2023-04-06 23:15:18] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-04-06 23:15:18] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2023-04-06 23:15:18] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-04-06 23:15:18] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2023-04-06 23:15:18] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2023-04-06 23:15:18] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:15:18] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:15:18] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 23:15:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 782 ms
[2023-04-06 23:15:18] [INFO ] After 832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-06 23:15:18] [INFO ] After 1008ms 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 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 700/700 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 270 transition count 615
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 190 transition count 615
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 170 transition count 595
Applied a total of 210 rules in 25 ms. Remains 170 /275 variables (removed 105) and now considering 595/700 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 170/275 places, 595/700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17290 steps, run visited all 1 properties in 52 ms. (steps per millisecond=332 )
Probabilistic random walk after 17290 steps, saw 8407 distinct states, run finished after 52 ms. (steps per millisecond=332 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1 p2)), (X p0), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), true, (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (OR (NOT p1) (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 8 factoid took 150 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 4 out of 275 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 : 275/275 places, 700/700 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 270 transition count 616
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 171 transition count 596
Applied a total of 208 rules in 28 ms. Remains 171 /275 variables (removed 104) and now considering 596/700 (removed 104) transitions.
[2023-04-06 23:15:19] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2023-04-06 23:15:19] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 23:15:19] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-04-06 23:15:19] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 23:15:19] [INFO ] Invariant cache hit.
[2023-04-06 23:15:19] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:15:19] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-04-06 23:15:19] [INFO ] Redundant transitions in 8 ms returned []
[2023-04-06 23:15:19] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 23:15:19] [INFO ] Invariant cache hit.
[2023-04-06 23:15:19] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/275 places, 596/700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 688 ms. Remains : 171/275 places, 596/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1), (X p2), (X (AND p1 p2)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 71 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-06 23:15:20] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 23:15:20] [INFO ] Invariant cache hit.
[2023-04-06 23:15:20] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:15:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:15:20] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:15:20] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:15:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:15:20] [INFO ] After 25ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:15:20] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-06 23:15:20] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-04-06 23:15:20] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2023-04-06 23:15:20] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-06 23:15:20] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2023-04-06 23:15:20] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:15:21] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2023-04-06 23:15:21] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:15:21] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2023-04-06 23:15:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 651 ms
[2023-04-06 23:15:21] [INFO ] After 687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-06 23:15:21] [INFO ] After 818ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 16 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 170/171 places, 595/596 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17290 steps, run visited all 1 properties in 53 ms. (steps per millisecond=326 )
Probabilistic random walk after 17290 steps, saw 8407 distinct states, run finished after 55 ms. (steps per millisecond=314 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1), (X p2), (X (AND p1 p2)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2)), (F (OR (NOT p1) (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 7 factoid took 211 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 162 ms.
Product exploration explored 100000 steps with 0 reset in 159 ms.
Built C files in :
/tmp/ltsmin7569684290392382678
[2023-04-06 23:15:22] [INFO ] Computing symmetric may disable matrix : 596 transitions.
[2023-04-06 23:15:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:15:22] [INFO ] Computing symmetric may enable matrix : 596 transitions.
[2023-04-06 23:15:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:15:22] [INFO ] Computing Do-Not-Accords matrix : 596 transitions.
[2023-04-06 23:15:22] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:15:22] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7569684290392382678
Running compilation step : cd /tmp/ltsmin7569684290392382678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1417 ms.
Running link step : cd /tmp/ltsmin7569684290392382678;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin7569684290392382678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10521346337876132523.hoa' '--buchi-type=spotba'
LTSmin run took 11405 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-07 finished in 19198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 275 transition count 700
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 275 transition count 700
Applied a total of 14 rules in 13 ms. Remains 275 /282 variables (removed 7) and now considering 700/735 (removed 35) transitions.
[2023-04-06 23:15:35] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2023-04-06 23:15:35] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 23:15:35] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-04-06 23:15:35] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:15:35] [INFO ] Invariant cache hit.
[2023-04-06 23:15:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:15:35] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2023-04-06 23:15:35] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:15:35] [INFO ] Invariant cache hit.
[2023-04-06 23:15:36] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/282 places, 700/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 948 ms. Remains : 275/282 places, 700/735 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s36 0), p1:(OR (EQ s3 0) (EQ s15 0) (EQ s190 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 215 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 110 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-06 23:15:37] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:15:37] [INFO ] Invariant cache hit.
[2023-04-06 23:15:37] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:15:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:15:37] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:15:37] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:15:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:15:37] [INFO ] After 64ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:15:37] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-06 23:15:37] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2023-04-06 23:15:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-04-06 23:15:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 189 ms
[2023-04-06 23:15:37] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
[2023-04-06 23:15:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-04-06 23:15:37] [INFO ] After 384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-06 23:15:37] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 700/700 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 270 transition count 616
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 191 transition count 616
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 206 place count 172 transition count 597
Applied a total of 206 rules in 20 ms. Remains 172 /275 variables (removed 103) and now considering 597/700 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 172/275 places, 597/700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 720588 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :{}
Probabilistic random walk after 720588 steps, saw 140707 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 23:15:40] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:15:40] [INFO ] Computed 16 invariants in 8 ms
[2023-04-06 23:15:40] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:15:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 23:15:40] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:15:41] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:15:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:15:41] [INFO ] After 44ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:15:41] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:15:41] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-04-06 23:15:41] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2023-04-06 23:15:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-06 23:15:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 234 ms
[2023-04-06 23:15:41] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2023-04-06 23:15:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-04-06 23:15:41] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-06 23:15:41] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 10 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 172/172 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 8 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 23:15:41] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:15:41] [INFO ] Invariant cache hit.
[2023-04-06 23:15:41] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-04-06 23:15:41] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:15:41] [INFO ] Invariant cache hit.
[2023-04-06 23:15:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:15:42] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2023-04-06 23:15:42] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-06 23:15:42] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:15:42] [INFO ] Invariant cache hit.
[2023-04-06 23:15:42] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 697 ms. Remains : 172/172 places, 597/597 transitions.
Graph (trivial) has 521 edges and 172 vertex of which 25 / 172 are part of one of the 5 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 319 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 152 transition count 170
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 119 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 67 place count 119 transition count 160
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 105 transition count 160
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 171 place count 65 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 190 place count 65 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 204 place count 58 transition count 176
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 58 transition count 174
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 58 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 210 place count 58 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 57 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 57 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 214 place count 56 transition count 168
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 239 place count 56 transition count 168
Applied a total of 239 rules in 15 ms. Remains 56 /172 variables (removed 116) and now considering 168/597 (removed 429) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 168 rows 56 cols
[2023-04-06 23:15:42] [INFO ] Computed 12 invariants in 1 ms
[2023-04-06 23:15:42] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:15:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 23:15:42] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 23:15:42] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:15:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 23:15:42] [INFO ] After 25ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:15:42] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2023-04-06 23:15:42] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2023-04-06 23:15:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2023-04-06 23:15:42] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-06 23:15:42] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 13 factoid took 211 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 270 transition count 616
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 191 transition count 616
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 206 place count 172 transition count 597
Applied a total of 206 rules in 24 ms. Remains 172 /275 variables (removed 103) and now considering 597/700 (removed 103) transitions.
[2023-04-06 23:15:43] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:15:43] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 23:15:43] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-04-06 23:15:43] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:15:43] [INFO ] Invariant cache hit.
[2023-04-06 23:15:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:15:43] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-04-06 23:15:43] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-06 23:15:43] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:15:43] [INFO ] Invariant cache hit.
[2023-04-06 23:15:43] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/275 places, 597/700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 797 ms. Remains : 172/275 places, 597/700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 106 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-04-06 23:15:44] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:15:44] [INFO ] Invariant cache hit.
[2023-04-06 23:15:44] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:15:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 23:15:44] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:15:44] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:15:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:15:44] [INFO ] After 46ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:15:44] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:15:44] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-04-06 23:15:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2023-04-06 23:15:44] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-06 23:15:44] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 172/172 places, 597/597 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 869442 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :{}
Probabilistic random walk after 869442 steps, saw 165544 distinct states, run finished after 3001 ms. (steps per millisecond=289 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 23:15:47] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:15:47] [INFO ] Invariant cache hit.
[2023-04-06 23:15:47] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:15:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 23:15:47] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:15:47] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:15:47] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:15:47] [INFO ] After 46ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:15:47] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2023-04-06 23:15:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-04-06 23:15:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2023-04-06 23:15:48] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-06 23:15:48] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 9 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 172/172 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 8 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 23:15:48] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:15:48] [INFO ] Invariant cache hit.
[2023-04-06 23:15:48] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-04-06 23:15:48] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:15:48] [INFO ] Invariant cache hit.
[2023-04-06 23:15:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:15:48] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-04-06 23:15:48] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-06 23:15:48] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:15:48] [INFO ] Invariant cache hit.
[2023-04-06 23:15:48] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 683 ms. Remains : 172/172 places, 597/597 transitions.
Graph (trivial) has 521 edges and 172 vertex of which 25 / 172 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 319 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 152 transition count 170
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 119 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 67 place count 119 transition count 160
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 105 transition count 160
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 171 place count 65 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 190 place count 65 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 204 place count 58 transition count 176
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 58 transition count 174
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 58 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 210 place count 58 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 57 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 57 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 214 place count 56 transition count 168
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 239 place count 56 transition count 168
Applied a total of 239 rules in 12 ms. Remains 56 /172 variables (removed 116) and now considering 168/597 (removed 429) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 168 rows 56 cols
[2023-04-06 23:15:48] [INFO ] Computed 12 invariants in 0 ms
[2023-04-06 23:15:48] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:15:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-04-06 23:15:48] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 23:15:48] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:15:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 23:15:48] [INFO ] After 23ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:15:48] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2023-04-06 23:15:48] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2023-04-06 23:15:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 48 ms
[2023-04-06 23:15:49] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 23:15:49] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 14 factoid took 208 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 182 ms.
Built C files in :
/tmp/ltsmin15138905708057139014
[2023-04-06 23:15:49] [INFO ] Computing symmetric may disable matrix : 597 transitions.
[2023-04-06 23:15:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:15:50] [INFO ] Computing symmetric may enable matrix : 597 transitions.
[2023-04-06 23:15:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:15:50] [INFO ] Computing Do-Not-Accords matrix : 597 transitions.
[2023-04-06 23:15:50] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:15:50] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15138905708057139014
Running compilation step : cd /tmp/ltsmin15138905708057139014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1315 ms.
Running link step : cd /tmp/ltsmin15138905708057139014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15138905708057139014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4362041110743929161.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 9 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 23:16:05] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:16:05] [INFO ] Computed 16 invariants in 0 ms
[2023-04-06 23:16:05] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-04-06 23:16:05] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:16:05] [INFO ] Invariant cache hit.
[2023-04-06 23:16:05] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:16:05] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2023-04-06 23:16:05] [INFO ] Redundant transitions in 10 ms returned []
[2023-04-06 23:16:05] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:16:05] [INFO ] Invariant cache hit.
[2023-04-06 23:16:05] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 955 ms. Remains : 172/172 places, 597/597 transitions.
Built C files in :
/tmp/ltsmin11272468646690886472
[2023-04-06 23:16:06] [INFO ] Computing symmetric may disable matrix : 597 transitions.
[2023-04-06 23:16:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:16:06] [INFO ] Computing symmetric may enable matrix : 597 transitions.
[2023-04-06 23:16:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:16:06] [INFO ] Computing Do-Not-Accords matrix : 597 transitions.
[2023-04-06 23:16:06] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:16:06] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11272468646690886472
Running compilation step : cd /tmp/ltsmin11272468646690886472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1289 ms.
Running link step : cd /tmp/ltsmin11272468646690886472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11272468646690886472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16991841812445220448.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-06 23:16:21] [INFO ] Flatten gal took : 48 ms
[2023-04-06 23:16:21] [INFO ] Flatten gal took : 56 ms
[2023-04-06 23:16:21] [INFO ] Time to serialize gal into /tmp/LTL11818546748876458270.gal : 4 ms
[2023-04-06 23:16:21] [INFO ] Time to serialize properties into /tmp/LTL10724828699019913328.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11818546748876458270.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7453187529267987930.hoa' '-atoms' '/tmp/LTL10724828699019913328.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10724828699019913328.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7453187529267987930.hoa
Detected timeout of ITS tools.
[2023-04-06 23:16:36] [INFO ] Flatten gal took : 39 ms
[2023-04-06 23:16:36] [INFO ] Flatten gal took : 39 ms
[2023-04-06 23:16:36] [INFO ] Time to serialize gal into /tmp/LTL9808467770095046164.gal : 4 ms
[2023-04-06 23:16:36] [INFO ] Time to serialize properties into /tmp/LTL17491064360112303544.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9808467770095046164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17491064360112303544.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((G("(p08_1_1==0)"))||(X("(((turn_3==0)||(flag_3_waiting==0))||(p25_2_0==0))")))))
Formula 0 simplified : F(F!"(p08_1_1==0)" & X!"(((turn_3==0)||(flag_3_waiting==0))||(p25_2_0==0))")
Detected timeout of ITS tools.
[2023-04-06 23:16:51] [INFO ] Flatten gal took : 26 ms
[2023-04-06 23:16:51] [INFO ] Applying decomposition
[2023-04-06 23:16:51] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9580795987513066138.txt' '-o' '/tmp/graph9580795987513066138.bin' '-w' '/tmp/graph9580795987513066138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9580795987513066138.bin' '-l' '-1' '-v' '-w' '/tmp/graph9580795987513066138.weights' '-q' '0' '-e' '0.001'
[2023-04-06 23:16:51] [INFO ] Decomposing Gal with order
[2023-04-06 23:16:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-06 23:16:51] [INFO ] Removed a total of 945 redundant transitions.
[2023-04-06 23:16:51] [INFO ] Flatten gal took : 141 ms
[2023-04-06 23:16:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 39 ms.
[2023-04-06 23:16:52] [INFO ] Time to serialize gal into /tmp/LTL561536821173965747.gal : 26 ms
[2023-04-06 23:16:52] [INFO ] Time to serialize properties into /tmp/LTL17253080758788926398.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL561536821173965747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17253080758788926398.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((G("(i3.u17.p08_1_1==0)"))||(X("(((i7.u26.turn_3==0)||(i7.u26.flag_3_waiting==0))||(i4.u27.p25_2_0==0))")))))
Formula 0 simplified : F(F!"(i3.u17.p08_1_1==0)" & X!"(((i7.u26.turn_3==0)||(i7.u26.flag_3_waiting==0))||(i4.u27.p25_2_0==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17512865282746900972
[2023-04-06 23:17:07] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17512865282746900972
Running compilation step : cd /tmp/ltsmin17512865282746900972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 846 ms.
Running link step : cd /tmp/ltsmin17512865282746900972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17512865282746900972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([]((LTLAPp0==true))||X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-08 finished in 107101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(p1)&&p0))||G(p2))))'
Support contains 9 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 282 transition count 730
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 277 transition count 730
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 277 transition count 652
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 199 transition count 652
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 173 place count 192 transition count 617
Iterating global reduction 2 with 7 rules applied. Total rules applied 180 place count 192 transition count 617
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 220 place count 172 transition count 597
Applied a total of 220 rules in 22 ms. Remains 172 /282 variables (removed 110) and now considering 597/735 (removed 138) transitions.
[2023-04-06 23:17:22] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:17:22] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 23:17:22] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-04-06 23:17:22] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:22] [INFO ] Invariant cache hit.
[2023-04-06 23:17:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:17:22] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2023-04-06 23:17:22] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-06 23:17:22] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:22] [INFO ] Invariant cache hit.
[2023-04-06 23:17:22] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/282 places, 597/735 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 717 ms. Remains : 172/282 places, 597/735 transitions.
Stuttering acceptance computed with spot in 43 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s13 0) (EQ s81 0) (EQ s2 0) (EQ s11 0) (EQ s123 0)) (OR (EQ s15 0) (EQ s80 0))), p1:(AND (EQ s1 1) (EQ s130 1)), p2:(AND (EQ s15 1) (EQ s8...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 217 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-12 finished in 1003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&(F(p2)||p1)))||X(p3)))'
Support contains 9 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 275 transition count 700
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 275 transition count 700
Applied a total of 14 rules in 5 ms. Remains 275 /282 variables (removed 7) and now considering 700/735 (removed 35) transitions.
[2023-04-06 23:17:23] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2023-04-06 23:17:23] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 23:17:23] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-04-06 23:17:23] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:17:23] [INFO ] Invariant cache hit.
[2023-04-06 23:17:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:17:23] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2023-04-06 23:17:23] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:17:23] [INFO ] Invariant cache hit.
[2023-04-06 23:17:24] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/282 places, 700/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 882 ms. Remains : 275/282 places, 700/735 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND p1 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s4 0) (EQ s18 0) (EQ s195 0)), p2:(OR (EQ s4 0) (EQ s18 0) (EQ s195 0)), p3:(OR (EQ s2 0) (EQ s13 0) (EQ s183 0)), p0:(OR (EQ s3 0) (EQ s16 0) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 330 ms.
Product exploration explored 100000 steps with 50000 reset in 330 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p3 p0), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p3), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-13 finished in 1845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(!p1) U (!p2&&G(!p1))))||p0)))'
Support contains 5 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 275 transition count 700
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 275 transition count 700
Applied a total of 14 rules in 8 ms. Remains 275 /282 variables (removed 7) and now considering 700/735 (removed 35) transitions.
[2023-04-06 23:17:25] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:17:25] [INFO ] Invariant cache hit.
[2023-04-06 23:17:25] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-04-06 23:17:25] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:17:25] [INFO ] Invariant cache hit.
[2023-04-06 23:17:25] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:17:25] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-04-06 23:17:25] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:17:25] [INFO ] Invariant cache hit.
[2023-04-06 23:17:25] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/282 places, 700/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 882 ms. Remains : 275/282 places, 700/735 transitions.
Stuttering acceptance computed with spot in 175 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p2 p1)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=p1, acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s4 1) (EQ s19 1) (EQ s204 1)), p0:(OR (NEQ s4 1) (NEQ s17 1) (NEQ s191 1)), p2:(AND (EQ s4 1) (EQ s17 1) (EQ s191 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 309 ms.
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X p0), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-14 finished in 1724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U ((p0 U (p1 U p2)) U p2)))'
Support contains 3 out of 282 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 : 282/282 places, 735/735 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 282 transition count 731
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 278 transition count 731
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 8 place count 278 transition count 651
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 168 place count 198 transition count 651
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 174 place count 192 transition count 621
Iterating global reduction 2 with 6 rules applied. Total rules applied 180 place count 192 transition count 621
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 220 place count 172 transition count 601
Applied a total of 220 rules in 28 ms. Remains 172 /282 variables (removed 110) and now considering 601/735 (removed 134) transitions.
[2023-04-06 23:17:26] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
// Phase 1: matrix 266 rows 172 cols
[2023-04-06 23:17:26] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 23:17:26] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-04-06 23:17:26] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 23:17:26] [INFO ] Invariant cache hit.
[2023-04-06 23:17:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:17:27] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-04-06 23:17:27] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-06 23:17:27] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 23:17:27] [INFO ] Invariant cache hit.
[2023-04-06 23:17:27] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/282 places, 601/735 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 802 ms. Remains : 172/282 places, 601/735 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (EQ s2 1) (EQ s12 1) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 154 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-15 finished in 999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-05-LTLFireability-08
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 282 transition count 730
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 277 transition count 730
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 277 transition count 651
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 198 transition count 651
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 175 place count 191 transition count 616
Iterating global reduction 2 with 7 rules applied. Total rules applied 182 place count 191 transition count 616
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 220 place count 172 transition count 597
Applied a total of 220 rules in 22 ms. Remains 172 /282 variables (removed 110) and now considering 597/735 (removed 138) transitions.
[2023-04-06 23:17:28] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:17:28] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 23:17:28] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-04-06 23:17:28] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:28] [INFO ] Invariant cache hit.
[2023-04-06 23:17:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:17:28] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-04-06 23:17:28] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:28] [INFO ] Invariant cache hit.
[2023-04-06 23:17:28] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 172/282 places, 597/735 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 708 ms. Remains : 172/282 places, 597/735 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s36 0), p1:(OR (EQ s3 0) (EQ s15 0) (EQ s115 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 153 ms.
Product exploration explored 100000 steps with 0 reset in 168 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 144 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-06 23:17:29] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:29] [INFO ] Invariant cache hit.
[2023-04-06 23:17:29] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:17:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:17:29] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:17:29] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:17:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:17:29] [INFO ] After 44ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:17:29] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-04-06 23:17:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-04-06 23:17:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2023-04-06 23:17:29] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2023-04-06 23:17:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-04-06 23:17:30] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-06 23:17:30] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 8 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 172/172 places, 597/597 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 786438 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :{}
Probabilistic random walk after 786438 steps, saw 151804 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 23:17:33] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:33] [INFO ] Invariant cache hit.
[2023-04-06 23:17:33] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:17:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:17:33] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:17:33] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:17:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:17:33] [INFO ] After 47ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:17:33] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-04-06 23:17:33] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 23:17:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2023-04-06 23:17:33] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-04-06 23:17:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-04-06 23:17:33] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-06 23:17:33] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 10 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 172/172 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 18 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 23:17:33] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:33] [INFO ] Invariant cache hit.
[2023-04-06 23:17:33] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-04-06 23:17:33] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:33] [INFO ] Invariant cache hit.
[2023-04-06 23:17:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:17:34] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-04-06 23:17:34] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-06 23:17:34] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:34] [INFO ] Invariant cache hit.
[2023-04-06 23:17:34] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 680 ms. Remains : 172/172 places, 597/597 transitions.
Graph (trivial) has 521 edges and 172 vertex of which 25 / 172 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 319 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 152 transition count 170
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 119 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 67 place count 119 transition count 160
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 105 transition count 160
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 171 place count 65 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 190 place count 65 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 204 place count 58 transition count 176
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 58 transition count 174
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 58 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 210 place count 58 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 57 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 57 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 214 place count 56 transition count 168
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 239 place count 56 transition count 168
Applied a total of 239 rules in 16 ms. Remains 56 /172 variables (removed 116) and now considering 168/597 (removed 429) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 168 rows 56 cols
[2023-04-06 23:17:34] [INFO ] Computed 12 invariants in 1 ms
[2023-04-06 23:17:34] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:17:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-04-06 23:17:34] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 23:17:34] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:17:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 23:17:34] [INFO ] After 24ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:17:34] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
[2023-04-06 23:17:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-04-06 23:17:34] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-06 23:17:34] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 13 factoid took 184 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 12 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 23:17:35] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:17:35] [INFO ] Computed 16 invariants in 0 ms
[2023-04-06 23:17:35] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-04-06 23:17:35] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:35] [INFO ] Invariant cache hit.
[2023-04-06 23:17:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:17:35] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-04-06 23:17:35] [INFO ] Redundant transitions in 10 ms returned []
[2023-04-06 23:17:35] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:35] [INFO ] Invariant cache hit.
[2023-04-06 23:17:35] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 662 ms. Remains : 172/172 places, 597/597 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 128 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-06 23:17:36] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:36] [INFO ] Invariant cache hit.
[2023-04-06 23:17:36] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:17:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:17:36] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:17:36] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:17:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:17:36] [INFO ] After 47ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:17:36] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:17:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-04-06 23:17:36] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-06 23:17:36] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 172/172 places, 597/597 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 709716 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{}
Probabilistic random walk after 709716 steps, saw 138738 distinct states, run finished after 3004 ms. (steps per millisecond=236 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 23:17:39] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:39] [INFO ] Invariant cache hit.
[2023-04-06 23:17:39] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:17:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 23:17:39] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 23:17:39] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:17:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:17:39] [INFO ] After 46ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:17:39] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-04-06 23:17:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-04-06 23:17:39] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-06 23:17:39] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 172/172 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 6 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 23:17:40] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:40] [INFO ] Invariant cache hit.
[2023-04-06 23:17:40] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-04-06 23:17:40] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:40] [INFO ] Invariant cache hit.
[2023-04-06 23:17:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:17:40] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-04-06 23:17:40] [INFO ] Redundant transitions in 5 ms returned []
[2023-04-06 23:17:40] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:40] [INFO ] Invariant cache hit.
[2023-04-06 23:17:40] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 699 ms. Remains : 172/172 places, 597/597 transitions.
Graph (trivial) has 521 edges and 172 vertex of which 25 / 172 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 319 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 152 transition count 170
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 119 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 67 place count 119 transition count 160
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 105 transition count 160
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 171 place count 65 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 190 place count 65 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 204 place count 58 transition count 176
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 58 transition count 174
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 58 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 210 place count 58 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 57 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 57 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 214 place count 56 transition count 168
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 239 place count 56 transition count 168
Applied a total of 239 rules in 9 ms. Remains 56 /172 variables (removed 116) and now considering 168/597 (removed 429) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 168 rows 56 cols
[2023-04-06 23:17:40] [INFO ] Computed 12 invariants in 1 ms
[2023-04-06 23:17:40] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 23:17:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-04-06 23:17:40] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 23:17:40] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 23:17:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 23:17:40] [INFO ] After 26ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 23:17:40] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-04-06 23:17:40] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2023-04-06 23:17:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2023-04-06 23:17:40] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-04-06 23:17:40] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 14 factoid took 195 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 202 ms.
Built C files in :
/tmp/ltsmin11947174312497546060
[2023-04-06 23:17:41] [INFO ] Computing symmetric may disable matrix : 597 transitions.
[2023-04-06 23:17:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:17:41] [INFO ] Computing symmetric may enable matrix : 597 transitions.
[2023-04-06 23:17:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:17:41] [INFO ] Computing Do-Not-Accords matrix : 597 transitions.
[2023-04-06 23:17:41] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:17:41] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11947174312497546060
Running compilation step : cd /tmp/ltsmin11947174312497546060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1320 ms.
Running link step : cd /tmp/ltsmin11947174312497546060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11947174312497546060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13236143897403497961.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 8 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 23:17:56] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 23:17:56] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 23:17:57] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-04-06 23:17:57] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:57] [INFO ] Invariant cache hit.
[2023-04-06 23:17:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:17:57] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-04-06 23:17:57] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-06 23:17:57] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 23:17:57] [INFO ] Invariant cache hit.
[2023-04-06 23:17:57] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 742 ms. Remains : 172/172 places, 597/597 transitions.
Built C files in :
/tmp/ltsmin7369102035563680675
[2023-04-06 23:17:57] [INFO ] Computing symmetric may disable matrix : 597 transitions.
[2023-04-06 23:17:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:17:57] [INFO ] Computing symmetric may enable matrix : 597 transitions.
[2023-04-06 23:17:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:17:57] [INFO ] Computing Do-Not-Accords matrix : 597 transitions.
[2023-04-06 23:17:57] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:17:57] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7369102035563680675
Running compilation step : cd /tmp/ltsmin7369102035563680675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1239 ms.
Running link step : cd /tmp/ltsmin7369102035563680675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7369102035563680675;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7014275585875880238.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-06 23:18:12] [INFO ] Flatten gal took : 50 ms
[2023-04-06 23:18:12] [INFO ] Flatten gal took : 34 ms
[2023-04-06 23:18:12] [INFO ] Time to serialize gal into /tmp/LTL5032751216341563668.gal : 13 ms
[2023-04-06 23:18:12] [INFO ] Time to serialize properties into /tmp/LTL5739510940038337492.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5032751216341563668.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16931344848688897229.hoa' '-atoms' '/tmp/LTL5739510940038337492.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5739510940038337492.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16931344848688897229.hoa
Detected timeout of ITS tools.
[2023-04-06 23:18:27] [INFO ] Flatten gal took : 29 ms
[2023-04-06 23:18:27] [INFO ] Flatten gal took : 16 ms
[2023-04-06 23:18:27] [INFO ] Time to serialize gal into /tmp/LTL16176587303462884416.gal : 2 ms
[2023-04-06 23:18:27] [INFO ] Time to serialize properties into /tmp/LTL11161896423955175761.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16176587303462884416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11161896423955175761.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((G("(p08_1_1==0)"))||(X("(((turn_3==0)||(flag_3_waiting==0))||(p25_2_0==0))")))))
Formula 0 simplified : F(F!"(p08_1_1==0)" & X!"(((turn_3==0)||(flag_3_waiting==0))||(p25_2_0==0))")
Detected timeout of ITS tools.
[2023-04-06 23:18:43] [INFO ] Flatten gal took : 22 ms
[2023-04-06 23:18:43] [INFO ] Applying decomposition
[2023-04-06 23:18:43] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18028585368584979230.txt' '-o' '/tmp/graph18028585368584979230.bin' '-w' '/tmp/graph18028585368584979230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18028585368584979230.bin' '-l' '-1' '-v' '-w' '/tmp/graph18028585368584979230.weights' '-q' '0' '-e' '0.001'
[2023-04-06 23:18:43] [INFO ] Decomposing Gal with order
[2023-04-06 23:18:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-06 23:18:43] [INFO ] Removed a total of 935 redundant transitions.
[2023-04-06 23:18:43] [INFO ] Flatten gal took : 118 ms
[2023-04-06 23:18:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 32 ms.
[2023-04-06 23:18:43] [INFO ] Time to serialize gal into /tmp/LTL10066196665852349892.gal : 31 ms
[2023-04-06 23:18:43] [INFO ] Time to serialize properties into /tmp/LTL3498021683249829772.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10066196665852349892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3498021683249829772.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((G("(i3.u8.p08_1_1==0)"))||(X("(((i6.i1.u1.turn_3==0)||(i6.i1.u1.flag_3_waiting==0))||(i5.i1.u2.p25_2_0==0))")))))
Formula 0 simplified : F(F!"(i3.u8.p08_1_1==0)" & X!"(((i6.i1.u1.turn_3==0)||(i6.i1.u1.flag_3_waiting==0))||(i5.i1.u2.p25_2_0==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18122909311394124184
[2023-04-06 23:18:58] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18122909311394124184
Running compilation step : cd /tmp/ltsmin18122909311394124184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 836 ms.
Running link step : cd /tmp/ltsmin18122909311394124184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin18122909311394124184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([]((LTLAPp0==true))||X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-08 finished in 105853 ms.
[2023-04-06 23:19:13] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
[2023-04-06 23:19:13] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin14528296118206347910
[2023-04-06 23:19:13] [INFO ] Computing symmetric may disable matrix : 735 transitions.
[2023-04-06 23:19:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:19:13] [INFO ] Computing symmetric may enable matrix : 735 transitions.
[2023-04-06 23:19:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:19:13] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7796375395459565983.txt' '-o' '/tmp/graph7796375395459565983.bin' '-w' '/tmp/graph7796375395459565983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7796375395459565983.bin' '-l' '-1' '-v' '-w' '/tmp/graph7796375395459565983.weights' '-q' '0' '-e' '0.001'
[2023-04-06 23:19:13] [INFO ] Decomposing Gal with order
[2023-04-06 23:19:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-06 23:19:13] [INFO ] Removed a total of 1173 redundant transitions.
[2023-04-06 23:19:13] [INFO ] Computing Do-Not-Accords matrix : 735 transitions.
[2023-04-06 23:19:13] [INFO ] Flatten gal took : 71 ms
[2023-04-06 23:19:13] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:19:13] [INFO ] Built C files in 236ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14528296118206347910
Running compilation step : cd /tmp/ltsmin14528296118206347910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-04-06 23:19:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 257 labels/synchronizations in 20 ms.
[2023-04-06 23:19:13] [INFO ] Time to serialize gal into /tmp/LTLFireability4981426354149030618.gal : 6 ms
[2023-04-06 23:19:13] [INFO ] Time to serialize properties into /tmp/LTLFireability11201590171970482957.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4981426354149030618.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11201590171970482957.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((G("(i3.i0.u1.p08_1_1==0)"))||(X("(((i3.i0.u1.turn_3==0)||(i11.i1.u67.flag_3_waiting==0))||(i11.i1.u67.p25_2_0==0))")))))
Formula 0 simplified : F(F!"(i3.i0.u1.p08_1_1==0)" & X!"(((i3.i0.u1.turn_3==0)||(i11.i1.u67.flag_3_waiting==0))||(i11.i1.u67.p25_2_0==0))")
Compilation finished in 1884 ms.
Running link step : cd /tmp/ltsmin14528296118206347910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14528296118206347910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([]((LTLAPp0==true))||X((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 416061 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 701658 ms.

BK_STOP 1680823572951

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is EisenbergMcGuire-PT-05, 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 r517-tall-167987243600236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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