Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636279900108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is EisenbergMcGuire-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636279900108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 753K May 18 16:42 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-06-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716541470821

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 09:04:34] [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]
[2024-05-24 09:04:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:04:34] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2024-05-24 09:04:34] [INFO ] Transformed 414 places.
[2024-05-24 09:04:34] [INFO ] Transformed 1296 transitions.
[2024-05-24 09:04:34] [INFO ] Found NUPN structural information;
[2024-05-24 09:04:34] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 452 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 390 transition count 1152
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 390 transition count 1152
Applied a total of 48 rules in 146 ms. Remains 390 /414 variables (removed 24) and now considering 1152/1296 (removed 144) transitions.
[2024-05-24 09:04:35] [INFO ] Flow matrix only has 558 transitions (discarded 594 similar events)
// Phase 1: matrix 558 rows 390 cols
[2024-05-24 09:04:35] [INFO ] Computed 19 invariants in 32 ms
[2024-05-24 09:04:35] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-05-24 09:04:35] [INFO ] Flow matrix only has 558 transitions (discarded 594 similar events)
[2024-05-24 09:04:35] [INFO ] Invariant cache hit.
[2024-05-24 09:04:36] [INFO ] State equation strengthened by 194 read => feed constraints.
[2024-05-24 09:04:37] [INFO ] Implicit Places using invariants and state equation in 1646 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
[2024-05-24 09:04:37] [INFO ] Flow matrix only has 558 transitions (discarded 594 similar events)
[2024-05-24 09:04:37] [INFO ] Invariant cache hit.
[2024-05-24 09:04:38] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 390/414 places, 1152/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3541 ms. Remains : 390/414 places, 1152/1296 transitions.
Support contains 52 out of 390 places after structural reductions.
[2024-05-24 09:04:39] [INFO ] Flatten gal took : 152 ms
[2024-05-24 09:04:39] [INFO ] Flatten gal took : 92 ms
[2024-05-24 09:04:39] [INFO ] Input system was already deterministic with 1152 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 975 ms. (steps per millisecond=10 ) properties (out of 33) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) 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 25) 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 25) 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 25) seen :0
Running SMT prover for 25 properties.
[2024-05-24 09:04:40] [INFO ] Flow matrix only has 558 transitions (discarded 594 similar events)
[2024-05-24 09:04:40] [INFO ] Invariant cache hit.
[2024-05-24 09:04:41] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2024-05-24 09:04:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-05-24 09:04:41] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:04:42] [INFO ] After 1028ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :23
[2024-05-24 09:04:42] [INFO ] State equation strengthened by 194 read => feed constraints.
[2024-05-24 09:04:44] [INFO ] After 1189ms SMT Verify possible using 194 Read/Feed constraints in natural domain returned unsat :2 sat :23
[2024-05-24 09:04:44] [INFO ] Deduced a trap composed of 3 places in 329 ms of which 10 ms to minimize.
[2024-05-24 09:04:44] [INFO ] Deduced a trap composed of 46 places in 246 ms of which 2 ms to minimize.
[2024-05-24 09:04:44] [INFO ] Deduced a trap composed of 57 places in 279 ms of which 2 ms to minimize.
[2024-05-24 09:04:45] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 2 ms to minimize.
[2024-05-24 09:04:45] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 2 ms to minimize.
[2024-05-24 09:04:45] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 1 ms to minimize.
[2024-05-24 09:04:45] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 1 ms to minimize.
[2024-05-24 09:04:46] [INFO ] Deduced a trap composed of 98 places in 231 ms of which 2 ms to minimize.
[2024-05-24 09:04:46] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-24 09:04:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2310 ms
[2024-05-24 09:04:46] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2024-05-24 09:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2024-05-24 09:04:46] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-05-24 09:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-05-24 09:04:46] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-24 09:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-24 09:04:47] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 1 ms to minimize.
[2024-05-24 09:04:47] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2024-05-24 09:04:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2024-05-24 09:04:47] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2024-05-24 09:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2024-05-24 09:04:47] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 1 ms to minimize.
[2024-05-24 09:04:48] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-24 09:04:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 437 ms
[2024-05-24 09:04:48] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 1 ms to minimize.
[2024-05-24 09:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-05-24 09:04:49] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-05-24 09:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2024-05-24 09:04:49] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 1 ms to minimize.
[2024-05-24 09:04:49] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2024-05-24 09:04:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2024-05-24 09:04:50] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2024-05-24 09:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2024-05-24 09:04:50] [INFO ] Deduced a trap composed of 88 places in 305 ms of which 1 ms to minimize.
[2024-05-24 09:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2024-05-24 09:04:50] [INFO ] After 7912ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :23
Attempting to minimize the solution found.
Minimization took 1631 ms.
[2024-05-24 09:04:52] [INFO ] After 11272ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :23
Fused 25 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 1287 ms.
Support contains 40 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 1152/1152 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 390 transition count 1148
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 386 transition count 1148
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 8 place count 386 transition count 1037
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 230 place count 275 transition count 1037
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 234 place count 271 transition count 1013
Iterating global reduction 2 with 4 rules applied. Total rules applied 238 place count 271 transition count 1013
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 298 place count 241 transition count 983
Applied a total of 298 rules in 147 ms. Remains 241 /390 variables (removed 149) and now considering 983/1152 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 241/390 places, 983/1152 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) 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 23) 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 23) 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 23) seen :0
Interrupted probabilistic random walk after 165270 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{7=1, 9=1, 20=1}
Probabilistic random walk after 165270 steps, saw 63217 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :3
Running SMT prover for 20 properties.
[2024-05-24 09:04:57] [INFO ] Flow matrix only has 389 transitions (discarded 594 similar events)
// Phase 1: matrix 389 rows 241 cols
[2024-05-24 09:04:57] [INFO ] Computed 19 invariants in 6 ms
[2024-05-24 09:04:57] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-24 09:04:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 09:04:57] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:04:58] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2024-05-24 09:04:58] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-05-24 09:04:59] [INFO ] After 589ms SMT Verify possible using 174 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2024-05-24 09:04:59] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2024-05-24 09:04:59] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2024-05-24 09:04:59] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 09:04:59] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 09:04:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 346 ms
[2024-05-24 09:04:59] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2024-05-24 09:04:59] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-05-24 09:04:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2024-05-24 09:04:59] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2024-05-24 09:05:00] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2024-05-24 09:05:00] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 1 ms to minimize.
[2024-05-24 09:05:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 494 ms
[2024-05-24 09:05:00] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-24 09:05:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-24 09:05:00] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 10 ms to minimize.
[2024-05-24 09:05:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-24 09:05:00] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-24 09:05:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2024-05-24 09:05:01] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 2 ms to minimize.
[2024-05-24 09:05:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2024-05-24 09:05:01] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-24 09:05:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-24 09:05:01] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-24 09:05:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-24 09:05:02] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-05-24 09:05:02] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2024-05-24 09:05:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2024-05-24 09:05:02] [INFO ] After 3764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 609 ms.
[2024-05-24 09:05:02] [INFO ] After 5247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 225 ms.
Support contains 37 out of 241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 241/241 places, 983/983 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 241 transition count 981
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 239 transition count 981
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 238 transition count 975
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 238 transition count 975
Applied a total of 6 rules in 93 ms. Remains 238 /241 variables (removed 3) and now considering 975/983 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 238/241 places, 975/983 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 516 ms. (steps per millisecond=19 ) 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 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 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 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 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 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 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 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 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 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 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 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 163912 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163912 steps, saw 57920 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 20 properties.
[2024-05-24 09:05:06] [INFO ] Flow matrix only has 381 transitions (discarded 594 similar events)
// Phase 1: matrix 381 rows 238 cols
[2024-05-24 09:05:06] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 09:05:07] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-24 09:05:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 09:05:07] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:05:08] [INFO ] After 782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2024-05-24 09:05:08] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 09:05:08] [INFO ] After 786ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2024-05-24 09:05:09] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2024-05-24 09:05:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-05-24 09:05:09] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 1 ms to minimize.
[2024-05-24 09:05:09] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 1 ms to minimize.
[2024-05-24 09:05:09] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2024-05-24 09:05:09] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-24 09:05:09] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-24 09:05:09] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-24 09:05:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 890 ms
[2024-05-24 09:05:10] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-05-24 09:05:10] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2024-05-24 09:05:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 388 ms
[2024-05-24 09:05:10] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2024-05-24 09:05:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2024-05-24 09:05:10] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2024-05-24 09:05:10] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 0 ms to minimize.
[2024-05-24 09:05:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2024-05-24 09:05:11] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-24 09:05:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2024-05-24 09:05:11] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-24 09:05:11] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-24 09:05:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2024-05-24 09:05:11] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2024-05-24 09:05:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-05-24 09:05:11] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-24 09:05:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-24 09:05:12] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-24 09:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-24 09:05:12] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-24 09:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-24 09:05:12] [INFO ] After 4425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 867 ms.
[2024-05-24 09:05:13] [INFO ] After 6421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 161 ms.
Support contains 37 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 975/975 transitions.
Applied a total of 0 rules in 64 ms. Remains 238 /238 variables (removed 0) and now considering 975/975 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 238/238 places, 975/975 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 975/975 transitions.
Applied a total of 0 rules in 47 ms. Remains 238 /238 variables (removed 0) and now considering 975/975 (removed 0) transitions.
[2024-05-24 09:05:13] [INFO ] Flow matrix only has 381 transitions (discarded 594 similar events)
[2024-05-24 09:05:13] [INFO ] Invariant cache hit.
[2024-05-24 09:05:14] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-24 09:05:14] [INFO ] Flow matrix only has 381 transitions (discarded 594 similar events)
[2024-05-24 09:05:14] [INFO ] Invariant cache hit.
[2024-05-24 09:05:14] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 09:05:14] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
[2024-05-24 09:05:15] [INFO ] Redundant transitions in 108 ms returned []
[2024-05-24 09:05:15] [INFO ] Flow matrix only has 381 transitions (discarded 594 similar events)
[2024-05-24 09:05:15] [INFO ] Invariant cache hit.
[2024-05-24 09:05:16] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2307 ms. Remains : 238/238 places, 975/975 transitions.
Graph (trivial) has 637 edges and 238 vertex of which 35 / 238 are part of one of the 6 SCC in 7 ms
Free SCC test removed 29 places
Drop transitions removed 110 transitions
Ensure Unique test removed 574 transitions
Reduce isomorphic transitions removed 684 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 209 transition count 258
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 176 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 175 transition count 257
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 69 place count 175 transition count 245
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 98 place count 158 transition count 245
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 186 place count 114 transition count 201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 195 place count 114 transition count 192
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 199 place count 112 transition count 193
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 202 place count 112 transition count 190
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 215 place count 112 transition count 177
Free-agglomeration rule applied 43 times.
Iterating global reduction 5 with 43 rules applied. Total rules applied 258 place count 112 transition count 134
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 5 with 43 rules applied. Total rules applied 301 place count 69 transition count 134
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 307 place count 69 transition count 134
Applied a total of 307 rules in 46 ms. Remains 69 /238 variables (removed 169) and now considering 134/975 (removed 841) transitions.
Running SMT prover for 20 properties.
// Phase 1: matrix 134 rows 69 cols
[2024-05-24 09:05:16] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 09:05:16] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-24 09:05:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 09:05:16] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 09:05:16] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2024-05-24 09:05:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:05:16] [INFO ] After 212ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2024-05-24 09:05:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-24 09:05:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2024-05-24 09:05:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-24 09:05:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 111 ms
[2024-05-24 09:05:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2024-05-24 09:05:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-24 09:05:17] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2024-05-24 09:05:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-24 09:05:17] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-24 09:05:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-24 09:05:17] [INFO ] After 742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 240 ms.
[2024-05-24 09:05:17] [INFO ] After 1443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-07 TRUE 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' '!((X(G(p0))&&F(p1)))'
Support contains 4 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 385 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 385 transition count 1122
Applied a total of 10 rules in 42 ms. Remains 385 /390 variables (removed 5) and now considering 1122/1152 (removed 30) transitions.
[2024-05-24 09:05:18] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-05-24 09:05:18] [INFO ] Computed 19 invariants in 6 ms
[2024-05-24 09:05:18] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-24 09:05:18] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 09:05:18] [INFO ] Invariant cache hit.
[2024-05-24 09:05:18] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 09:05:20] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
[2024-05-24 09:05:20] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 09:05:20] [INFO ] Invariant cache hit.
[2024-05-24 09:05:21] [INFO ] Dead Transitions using invariants and state equation in 946 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 385/390 places, 1122/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2992 ms. Remains : 385/390 places, 1122/1152 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 364 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s5 0) (EQ s102 0)), p1:(AND (EQ s0 1) (EQ s338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 521 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 15 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-00 finished in 4012 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(p0)||G(p1)||(X(X(p0))&&X(p0)))))'
Support contains 4 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 41 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 09:05:22] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 09:05:22] [INFO ] Computed 19 invariants in 6 ms
[2024-05-24 09:05:22] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-24 09:05:22] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:05:22] [INFO ] Invariant cache hit.
[2024-05-24 09:05:22] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:05:24] [INFO ] Implicit Places using invariants and state equation in 1603 ms returned []
Implicit Place search using SMT with State Equation took 1994 ms to find 0 implicit places.
[2024-05-24 09:05:24] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:05:24] [INFO ] Invariant cache hit.
[2024-05-24 09:05:25] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3239 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s23 0) (EQ s277 0)), p0:(AND (EQ s5 1) (EQ s23 1) (EQ s265 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 298 ms.
Product exploration explored 100000 steps with 0 reset in 329 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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 182420 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182420 steps, saw 115159 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 09:05:29] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:05:29] [INFO ] Invariant cache hit.
[2024-05-24 09:05:30] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 09:05:30] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 09:05:30] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 09:05:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 09:05:30] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 09:05:30] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 09:05:30] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:05:30] [INFO ] After 181ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 09:05:31] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2024-05-24 09:05:31] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 1 ms to minimize.
[2024-05-24 09:05:31] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 0 ms to minimize.
[2024-05-24 09:05:31] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2024-05-24 09:05:31] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 1 ms to minimize.
[2024-05-24 09:05:32] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 0 ms to minimize.
[2024-05-24 09:05:32] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 0 ms to minimize.
[2024-05-24 09:05:32] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2024-05-24 09:05:32] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2024-05-24 09:05:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1531 ms
[2024-05-24 09:05:32] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 0 ms to minimize.
[2024-05-24 09:05:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-05-24 09:05:32] [INFO ] After 2111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 175 ms.
[2024-05-24 09:05:33] [INFO ] After 2766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 58 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 315686 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 315686 steps, saw 92925 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 09:05:36] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 09:05:36] [INFO ] Computed 19 invariants in 8 ms
[2024-05-24 09:05:36] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 09:05:36] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:05:36] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 09:05:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 09:05:37] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:05:37] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 09:05:37] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:05:37] [INFO ] After 195ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 09:05:37] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2024-05-24 09:05:37] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 1 ms to minimize.
[2024-05-24 09:05:38] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2024-05-24 09:05:38] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-05-24 09:05:38] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 09:05:38] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-24 09:05:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 737 ms
[2024-05-24 09:05:38] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2024-05-24 09:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-05-24 09:05:38] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-24 09:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-24 09:05:38] [INFO ] After 1284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 115 ms.
[2024-05-24 09:05:38] [INFO ] After 1783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 41 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 40 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 09:05:38] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:05:38] [INFO ] Invariant cache hit.
[2024-05-24 09:05:39] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-05-24 09:05:39] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:05:39] [INFO ] Invariant cache hit.
[2024-05-24 09:05:39] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:05:40] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 1778 ms to find 0 implicit places.
[2024-05-24 09:05:40] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-24 09:05:40] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:05:40] [INFO ] Invariant cache hit.
[2024-05-24 09:05:41] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2561 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 31 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2024-05-24 09:05:41] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 09:05:41] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-24 09:05:41] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 09:05:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-24 09:05:41] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 09:05:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 09:05:41] [INFO ] After 28ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 09:05:41] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-24 09:05:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-24 09:05:41] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-24 09:05:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-05-24 09:05:41] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-24 09:05:41] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 127 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 9 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-24 09:05:42] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 09:05:42] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 09:05:42] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-24 09:05:42] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:05:42] [INFO ] Invariant cache hit.
[2024-05-24 09:05:43] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:05:44] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
[2024-05-24 09:05:44] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:05:44] [INFO ] Invariant cache hit.
[2024-05-24 09:05:45] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2978 ms. Remains : 384/384 places, 1116/1116 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 (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 135 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 191604 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191604 steps, saw 120462 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 09:05:48] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:05:48] [INFO ] Invariant cache hit.
[2024-05-24 09:05:49] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 09:05:49] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:05:49] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 09:05:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2024-05-24 09:05:49] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 8 ms returned sat
[2024-05-24 09:05:50] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 09:05:50] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:05:50] [INFO ] After 257ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 09:05:50] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2024-05-24 09:05:50] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 0 ms to minimize.
[2024-05-24 09:05:51] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 1 ms to minimize.
[2024-05-24 09:05:51] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 1 ms to minimize.
[2024-05-24 09:05:51] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 1 ms to minimize.
[2024-05-24 09:05:51] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 0 ms to minimize.
[2024-05-24 09:05:51] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 1 ms to minimize.
[2024-05-24 09:05:51] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-24 09:05:52] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2024-05-24 09:05:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1742 ms
[2024-05-24 09:05:52] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 1 ms to minimize.
[2024-05-24 09:05:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2024-05-24 09:05:52] [INFO ] After 2492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 194 ms.
[2024-05-24 09:05:52] [INFO ] After 3331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 83 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 321076 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 321076 steps, saw 93742 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 09:05:56] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 09:05:56] [INFO ] Computed 19 invariants in 6 ms
[2024-05-24 09:05:56] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 09:05:56] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:05:56] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 09:05:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-24 09:05:56] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:05:57] [INFO ] After 319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 09:05:57] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:05:57] [INFO ] After 211ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 09:05:57] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2024-05-24 09:05:57] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2024-05-24 09:05:57] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2024-05-24 09:05:57] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2024-05-24 09:05:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 09:05:58] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 09:05:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 586 ms
[2024-05-24 09:05:58] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 09:05:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-24 09:05:58] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-24 09:05:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-24 09:05:58] [INFO ] After 1052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 126 ms.
[2024-05-24 09:05:58] [INFO ] After 1665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 31 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 25 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 09:05:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:05:58] [INFO ] Invariant cache hit.
[2024-05-24 09:05:58] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-24 09:05:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:05:58] [INFO ] Invariant cache hit.
[2024-05-24 09:05:59] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:05:59] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1416 ms to find 0 implicit places.
[2024-05-24 09:05:59] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 09:05:59] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:05:59] [INFO ] Invariant cache hit.
[2024-05-24 09:06:00] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2222 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 31 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2024-05-24 09:06:00] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 09:06:00] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 09:06:00] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 09:06:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-24 09:06:00] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 09:06:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 09:06:00] [INFO ] After 42ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 09:06:01] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 09:06:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-24 09:06:01] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 09:06:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-24 09:06:01] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-24 09:06:01] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 233 ms.
Product exploration explored 100000 steps with 0 reset in 377 ms.
Built C files in :
/tmp/ltsmin17554691219296193038
[2024-05-24 09:06:02] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17554691219296193038
Running compilation step : cd /tmp/ltsmin17554691219296193038;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17554691219296193038;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17554691219296193038;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 6 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-24 09:06:05] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 09:06:05] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 09:06:06] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-24 09:06:06] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:06:06] [INFO ] Invariant cache hit.
[2024-05-24 09:06:06] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:06:08] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
[2024-05-24 09:06:08] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:06:08] [INFO ] Invariant cache hit.
[2024-05-24 09:06:09] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3512 ms. Remains : 384/384 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin16282161784837064749
[2024-05-24 09:06:09] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16282161784837064749
Running compilation step : cd /tmp/ltsmin16282161784837064749;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16282161784837064749;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16282161784837064749;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 09:06:12] [INFO ] Flatten gal took : 108 ms
[2024-05-24 09:06:12] [INFO ] Flatten gal took : 91 ms
[2024-05-24 09:06:12] [INFO ] Time to serialize gal into /tmp/LTL13377911612466629489.gal : 16 ms
[2024-05-24 09:06:12] [INFO ] Time to serialize properties into /tmp/LTL3328008348093586728.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/LTL13377911612466629489.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4871019341095058243.hoa' '-atoms' '/tmp/LTL3328008348093586728.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/LTL3328008348093586728.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4871019341095058243.hoa
Detected timeout of ITS tools.
[2024-05-24 09:06:27] [INFO ] Flatten gal took : 74 ms
[2024-05-24 09:06:27] [INFO ] Flatten gal took : 70 ms
[2024-05-24 09:06:27] [INFO ] Time to serialize gal into /tmp/LTL14131993069780993101.gal : 9 ms
[2024-05-24 09:06:27] [INFO ] Time to serialize properties into /tmp/LTL13516796466217774771.ltl : 3 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/LTL14131993069780993101.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13516796466217774771.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 : !((F(((G("(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))"))||(G("(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))")))||((X(X("(((t...266
Formula 0 simplified : G(F!"(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))" & X(!"(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))" | X!"(((turn_5==1)&...193
Detected timeout of ITS tools.
[2024-05-24 09:06:43] [INFO ] Flatten gal took : 43 ms
[2024-05-24 09:06:43] [INFO ] Applying decomposition
[2024-05-24 09:06:43] [INFO ] Flatten gal took : 43 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/graph7561267742160210713.txt' '-o' '/tmp/graph7561267742160210713.bin' '-w' '/tmp/graph7561267742160210713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7561267742160210713.bin' '-l' '-1' '-v' '-w' '/tmp/graph7561267742160210713.weights' '-q' '0' '-e' '0.001'
[2024-05-24 09:06:43] [INFO ] Decomposing Gal with order
[2024-05-24 09:06:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:06:43] [INFO ] Removed a total of 1887 redundant transitions.
[2024-05-24 09:06:43] [INFO ] Flatten gal took : 382 ms
[2024-05-24 09:06:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 345 labels/synchronizations in 60 ms.
[2024-05-24 09:06:43] [INFO ] Time to serialize gal into /tmp/LTL11675646023104537559.gal : 20 ms
[2024-05-24 09:06:43] [INFO ] Time to serialize properties into /tmp/LTL2234148635449773544.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/LTL11675646023104537559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2234148635449773544.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 : !((F(((G("(((i0.u4.turn_5==1)&&(i12.i0.u0.flag_5_active==1))&&(i15.i2.u2.p25_2_1==1))"))||(G("(((i0.u4.turn_5==0)||(i12.i0.u0.flag_5_a...366
Formula 0 simplified : G(F!"(((i0.u4.turn_5==0)||(i12.i0.u0.flag_5_active==0))||(i0.u4.p25_4_1==0))" & X(!"(((i0.u4.turn_5==1)&&(i12.i0.u0.flag_5_active==1...267
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6836886053228467939
[2024-05-24 09:06:58] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6836886053228467939
Running compilation step : cd /tmp/ltsmin6836886053228467939;'/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 2948 ms.
Running link step : cd /tmp/ltsmin6836886053228467939;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6836886053228467939;'/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))||[]((LTLAPp1==true))||(X(X((LTLAPp0==true)))&&X((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 112091 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)&&p0)))'
Support contains 6 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 12 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 09:07:14] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:07:14] [INFO ] Invariant cache hit.
[2024-05-24 09:07:14] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-24 09:07:14] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:07:14] [INFO ] Invariant cache hit.
[2024-05-24 09:07:14] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:07:16] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 1934 ms to find 0 implicit places.
[2024-05-24 09:07:16] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:07:16] [INFO ] Invariant cache hit.
[2024-05-24 09:07:16] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2787 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s5 1) (EQ s21 1) (EQ s267 1)), p0:(AND (EQ s1 1) (EQ s10 1) (EQ s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-03 finished in 2940 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(((p1||X(F(p2)))&&p0)))'
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 385 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 385 transition count 1122
Applied a total of 10 rules in 11 ms. Remains 385 /390 variables (removed 5) and now considering 1122/1152 (removed 30) transitions.
[2024-05-24 09:07:17] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-05-24 09:07:17] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 09:07:17] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-24 09:07:17] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 09:07:17] [INFO ] Invariant cache hit.
[2024-05-24 09:07:17] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 09:07:19] [INFO ] Implicit Places using invariants and state equation in 1615 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
[2024-05-24 09:07:19] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 09:07:19] [INFO ] Invariant cache hit.
[2024-05-24 09:07:20] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 385/390 places, 1122/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2989 ms. Remains : 385/390 places, 1122/1152 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s0 1) (EQ s7 1) (EQ s287 1)), p1:(AND (EQ s5 1) (EQ s102 1)), p2:(AND (EQ s5 1) (EQ s22 1) (EQ s272 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-04 finished in 3134 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(F(((!p0 U (G(!p0)||!p0)) U (G((!p0 U (p1||G(!p0))))||(G(!p2)&&(!p0 U (p1||G(!p0))))))))))'
Support contains 5 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 12 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 09:07:20] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 09:07:20] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 09:07:20] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-05-24 09:07:20] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:07:20] [INFO ] Invariant cache hit.
[2024-05-24 09:07:21] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:07:22] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
[2024-05-24 09:07:22] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:07:22] [INFO ] Invariant cache hit.
[2024-05-24 09:07:23] [INFO ] Dead Transitions using invariants and state equation in 1291 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3403 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 268 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s3 1) (EQ s358 1)), p2:(AND (EQ s2 1) (EQ s12 1) (EQ s257 1)), p1:(AND (OR (NOT (AND (EQ s3 1) (EQ s358 1))) (AND (EQ s3 1) (EQ s358 1))) (NOT...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 430 ms.
Product exploration explored 100000 steps with 0 reset in 525 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 p0) (NOT p2) p1), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2024-05-24 09:07:25] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:07:25] [INFO ] Invariant cache hit.
[2024-05-24 09:07:25] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 09:07:25] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 09:07:25] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2024-05-24 09:07:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 09:07:25] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:07:26] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2024-05-24 09:07:26] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:07:26] [INFO ] After 90ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2024-05-24 09:07:26] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 1 ms to minimize.
[2024-05-24 09:07:26] [INFO ] Deduced a trap composed of 52 places in 196 ms of which 1 ms to minimize.
[2024-05-24 09:07:27] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 1 ms to minimize.
[2024-05-24 09:07:27] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 1 ms to minimize.
[2024-05-24 09:07:27] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 1 ms to minimize.
[2024-05-24 09:07:27] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 1 ms to minimize.
[2024-05-24 09:07:28] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 1 ms to minimize.
[2024-05-24 09:07:28] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2024-05-24 09:07:28] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 0 ms to minimize.
[2024-05-24 09:07:28] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 1 ms to minimize.
[2024-05-24 09:07:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2185 ms
[2024-05-24 09:07:28] [INFO ] After 2342ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-24 09:07:28] [INFO ] After 2731ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 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 384 transition count 1111
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 379 transition count 1111
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 10 place count 379 transition count 997
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 298 place count 235 transition count 967
Applied a total of 298 rules in 77 ms. Remains 235 /384 variables (removed 149) and now considering 967/1116 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 235/384 places, 967/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 639513 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 639513 steps, saw 157880 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 09:07:31] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 09:07:31] [INFO ] Computed 19 invariants in 7 ms
[2024-05-24 09:07:31] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 09:07:31] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:07:31] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 09:07:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 09:07:31] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:07:32] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 09:07:32] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:07:32] [INFO ] After 50ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 09:07:32] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2024-05-24 09:07:32] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 1 ms to minimize.
[2024-05-24 09:07:32] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2024-05-24 09:07:32] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 1 ms to minimize.
[2024-05-24 09:07:32] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 1 ms to minimize.
[2024-05-24 09:07:33] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 1 ms to minimize.
[2024-05-24 09:07:33] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2024-05-24 09:07:33] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2024-05-24 09:07:33] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2024-05-24 09:07:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1380 ms
[2024-05-24 09:07:33] [INFO ] After 1465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-24 09:07:33] [INFO ] After 1715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 35 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 35 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 09:07:33] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:07:33] [INFO ] Invariant cache hit.
[2024-05-24 09:07:34] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-24 09:07:34] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:07:34] [INFO ] Invariant cache hit.
[2024-05-24 09:07:34] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:07:34] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2024-05-24 09:07:34] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 09:07:34] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:07:34] [INFO ] Invariant cache hit.
[2024-05-24 09:07:35] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2085 ms. Remains : 235/235 places, 967/967 transitions.
Graph (trivial) has 864 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 3 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 205 transition count 236
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 80 transition count 164
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 80 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 74 transition count 135
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 74 transition count 129
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 74 transition count 123
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 327 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 356 place count 45 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 45 transition count 94
Applied a total of 362 rules in 37 ms. Remains 45 /235 variables (removed 190) and now considering 94/967 (removed 873) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 45 cols
[2024-05-24 09:07:35] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 09:07:35] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 09:07:35] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 09:07:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 09:07:35] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 09:07:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 09:07:35] [INFO ] After 18ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 09:07:35] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-24 09:07:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-24 09:07:35] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-24 09:07:35] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (G (NOT (AND p0 p2 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 282 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-24 09:07:36] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 09:07:36] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 09:07:37] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-24 09:07:37] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:07:37] [INFO ] Invariant cache hit.
[2024-05-24 09:07:37] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:07:39] [INFO ] Implicit Places using invariants and state equation in 2241 ms returned []
Implicit Place search using SMT with State Equation took 2655 ms to find 0 implicit places.
[2024-05-24 09:07:39] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:07:39] [INFO ] Invariant cache hit.
[2024-05-24 09:07:40] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3524 ms. Remains : 384/384 places, 1116/1116 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 (NOT p2) p1), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (AND (NOT p2) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 09:07:40] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:07:40] [INFO ] Invariant cache hit.
[2024-05-24 09:07:40] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-05-24 09:07:40] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 7 ms returned sat
[2024-05-24 09:07:40] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:07:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-24 09:07:40] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 7 ms returned sat
[2024-05-24 09:07:41] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 09:07:41] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:07:41] [INFO ] After 158ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 09:07:41] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 0 ms to minimize.
[2024-05-24 09:07:41] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 1 ms to minimize.
[2024-05-24 09:07:42] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-24 09:07:42] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-24 09:07:42] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 1 ms to minimize.
[2024-05-24 09:07:42] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 0 ms to minimize.
[2024-05-24 09:07:43] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 1 ms to minimize.
[2024-05-24 09:07:43] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2024-05-24 09:07:43] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 1 ms to minimize.
[2024-05-24 09:07:43] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-24 09:07:43] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2024-05-24 09:07:43] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2275 ms
[2024-05-24 09:07:43] [INFO ] After 2567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 97 ms.
[2024-05-24 09:07:43] [INFO ] After 3162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 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 384 transition count 1111
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 379 transition count 1111
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 10 place count 379 transition count 997
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 298 place count 235 transition count 967
Applied a total of 298 rules in 44 ms. Remains 235 /384 variables (removed 149) and now considering 967/1116 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 235/384 places, 967/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 410781 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 410781 steps, saw 110824 distinct states, run finished after 3002 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 09:07:47] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 09:07:47] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 09:07:47] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-24 09:07:47] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:07:47] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:07:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-24 09:07:47] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 7 ms returned sat
[2024-05-24 09:07:47] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 09:07:47] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:07:47] [INFO ] After 123ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 09:07:47] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 1 ms to minimize.
[2024-05-24 09:07:48] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2024-05-24 09:07:48] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2024-05-24 09:07:48] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-24 09:07:48] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2024-05-24 09:07:48] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2024-05-24 09:07:48] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2024-05-24 09:07:48] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 0 ms to minimize.
[2024-05-24 09:07:49] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 1 ms to minimize.
[2024-05-24 09:07:49] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 0 ms to minimize.
[2024-05-24 09:07:49] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 0 ms to minimize.
[2024-05-24 09:07:49] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2024-05-24 09:07:49] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2024-05-24 09:07:49] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-24 09:07:49] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2039 ms
[2024-05-24 09:07:49] [INFO ] After 2254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-24 09:07:49] [INFO ] After 2658ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 21 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 23 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 09:07:49] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:07:49] [INFO ] Invariant cache hit.
[2024-05-24 09:07:50] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-24 09:07:50] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:07:50] [INFO ] Invariant cache hit.
[2024-05-24 09:07:50] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:07:51] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
[2024-05-24 09:07:51] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 09:07:51] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:07:51] [INFO ] Invariant cache hit.
[2024-05-24 09:07:52] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2558 ms. Remains : 235/235 places, 967/967 transitions.
Graph (trivial) has 864 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 2 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 205 transition count 236
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 80 transition count 164
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 80 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 74 transition count 135
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 74 transition count 129
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 74 transition count 123
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 327 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 356 place count 45 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 45 transition count 94
Applied a total of 362 rules in 26 ms. Remains 45 /235 variables (removed 190) and now considering 94/967 (removed 873) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 45 cols
[2024-05-24 09:07:52] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 09:07:52] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 09:07:52] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:07:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 09:07:52] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 09:07:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 09:07:52] [INFO ] After 24ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 09:07:52] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-24 09:07:52] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-24 09:07:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2024-05-24 09:07:52] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-24 09:07:52] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 384 ms.
Product exploration explored 100000 steps with 0 reset in 494 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 384 transition count 1116
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 109 Pre rules applied. Total rules applied 5 place count 384 transition count 1284
Deduced a syphon composed of 114 places in 1 ms
Iterating global reduction 1 with 109 rules applied. Total rules applied 114 place count 384 transition count 1284
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 149 place count 384 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 154 place count 379 transition count 1279
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 159 place count 379 transition count 1279
Deduced a syphon composed of 144 places in 1 ms
Applied a total of 159 rules in 156 ms. Remains 379 /384 variables (removed 5) and now considering 1279/1116 (removed -163) transitions.
[2024-05-24 09:07:54] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-24 09:07:54] [INFO ] Flow matrix only has 601 transitions (discarded 678 similar events)
// Phase 1: matrix 601 rows 379 cols
[2024-05-24 09:07:55] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 09:07:55] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/384 places, 1279/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1062 ms. Remains : 379/384 places, 1279/1116 transitions.
Built C files in :
/tmp/ltsmin15501168379128631005
[2024-05-24 09:07:55] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15501168379128631005
Running compilation step : cd /tmp/ltsmin15501168379128631005;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15501168379128631005;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15501168379128631005;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 10 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-24 09:07:58] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 09:07:58] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 09:07:59] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-24 09:07:59] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:07:59] [INFO ] Invariant cache hit.
[2024-05-24 09:07:59] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:08:00] [INFO ] Implicit Places using invariants and state equation in 1538 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
[2024-05-24 09:08:00] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:08:00] [INFO ] Invariant cache hit.
[2024-05-24 09:08:01] [INFO ] Dead Transitions using invariants and state equation in 1029 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2995 ms. Remains : 384/384 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin13489490004059249136
[2024-05-24 09:08:01] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13489490004059249136
Running compilation step : cd /tmp/ltsmin13489490004059249136;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13489490004059249136;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13489490004059249136;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 09:08:05] [INFO ] Flatten gal took : 39 ms
[2024-05-24 09:08:05] [INFO ] Flatten gal took : 38 ms
[2024-05-24 09:08:05] [INFO ] Time to serialize gal into /tmp/LTL17811334961650307785.gal : 8 ms
[2024-05-24 09:08:05] [INFO ] Time to serialize properties into /tmp/LTL8476543158167215722.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/LTL17811334961650307785.gal' '-t' 'CGAL' '-hoa' '/tmp/aut580177060032103371.hoa' '-atoms' '/tmp/LTL8476543158167215722.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...317
Loading property file /tmp/LTL8476543158167215722.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut580177060032103371.hoa
Detected timeout of ITS tools.
[2024-05-24 09:08:20] [INFO ] Flatten gal took : 39 ms
[2024-05-24 09:08:20] [INFO ] Flatten gal took : 42 ms
[2024-05-24 09:08:20] [INFO ] Time to serialize gal into /tmp/LTL13414568200008123670.gal : 26 ms
[2024-05-24 09:08:20] [INFO ] Time to serialize properties into /tmp/LTL18068132319158323993.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/LTL13414568200008123670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18068132319158323993.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 : !((X(X(F(((!("((turn_3==1)&&(p37_3_4==1))"))U((G(!("((turn_3==1)&&(p37_3_4==1))")))||(!("((turn_3==1)&&(p37_3_4==1))"))))U((G((!("((tu...570
Formula 0 simplified : XXG(F(!"(((!((turn_3==1)&&(p37_3_4==1)))||((turn_3==1)&&(p37_3_4==1)))&&(!((turn_3==1)&&(p37_3_4==1))))" & "((turn_3==1)&&(p37_3_4==...351
Detected timeout of ITS tools.
[2024-05-24 09:08:35] [INFO ] Flatten gal took : 34 ms
[2024-05-24 09:08:35] [INFO ] Applying decomposition
[2024-05-24 09:08:35] [INFO ] Flatten gal took : 35 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/graph7137732317764328872.txt' '-o' '/tmp/graph7137732317764328872.bin' '-w' '/tmp/graph7137732317764328872.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7137732317764328872.bin' '-l' '-1' '-v' '-w' '/tmp/graph7137732317764328872.weights' '-q' '0' '-e' '0.001'
[2024-05-24 09:08:35] [INFO ] Decomposing Gal with order
[2024-05-24 09:08:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:08:35] [INFO ] Removed a total of 1868 redundant transitions.
[2024-05-24 09:08:35] [INFO ] Flatten gal took : 101 ms
[2024-05-24 09:08:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 321 labels/synchronizations in 57 ms.
[2024-05-24 09:08:35] [INFO ] Time to serialize gal into /tmp/LTL828809747430508286.gal : 9 ms
[2024-05-24 09:08:35] [INFO ] Time to serialize properties into /tmp/LTL9810735000632492831.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/LTL828809747430508286.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9810735000632492831.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...253
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((!("((i1.u3.turn_3==1)&&(i15.u107.p37_3_4==1))"))U((G(!("((i1.u3.turn_3==1)&&(i15.u107.p37_3_4==1))")))||(!("((i1.u3.turn_3=...788
Formula 0 simplified : XXG(F(!"(((!((i1.u3.turn_3==1)&&(i15.u107.p37_3_4==1)))||((i1.u3.turn_3==1)&&(i15.u107.p37_3_4==1)))&&(!((i1.u3.turn_3==1)&&(i15.u10...494
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13269090103336321916
[2024-05-24 09:08:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13269090103336321916
Running compilation step : cd /tmp/ltsmin13269090103336321916;'/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 2952 ms.
Running link step : cd /tmp/ltsmin13269090103336321916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13269090103336321916;'/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' 'X(X(<>(((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||!(LTLAPp0==true))) U ([]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||([](!(LTLAPp2==true))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-05 finished in 105765 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(((F(p0)&&F(!p1)) U p1))))'
Support contains 6 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 19 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 09:09:05] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:09:05] [INFO ] Invariant cache hit.
[2024-05-24 09:09:06] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-24 09:09:06] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:09:06] [INFO ] Invariant cache hit.
[2024-05-24 09:09:06] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:09:08] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2345 ms to find 0 implicit places.
[2024-05-24 09:09:08] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:09:08] [INFO ] Invariant cache hit.
[2024-05-24 09:09:09] [INFO ] Dead Transitions using invariants and state equation in 937 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3303 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s11 1) (EQ s270 1)), p0:(AND (EQ s0 1) (EQ s8 1) (EQ s266 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 206 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 72 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-08 finished in 3684 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||G(F((p1||(F(p3)&&p2)))))))'
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 390/390 places, 1152/1152 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 390 transition count 1147
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 385 transition count 1147
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 10 place count 385 transition count 1034
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 236 place count 272 transition count 1034
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 242 place count 266 transition count 998
Iterating global reduction 2 with 6 rules applied. Total rules applied 248 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 308 place count 236 transition count 968
Applied a total of 308 rules in 55 ms. Remains 236 /390 variables (removed 154) and now considering 968/1152 (removed 184) transitions.
[2024-05-24 09:09:09] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 09:09:09] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 09:09:10] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-24 09:09:10] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 09:09:10] [INFO ] Invariant cache hit.
[2024-05-24 09:09:10] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:09:11] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
[2024-05-24 09:09:11] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 09:09:11] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 09:09:11] [INFO ] Invariant cache hit.
[2024-05-24 09:09:11] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/390 places, 968/1152 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2237 ms. Remains : 236/390 places, 968/1152 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s17 1) (EQ s160 1)), p2:(AND (EQ s3 1) (EQ s16 1) (EQ s145 1)), p1:(AND (EQ s3 1) (EQ s16 1) (EQ s145 1) (OR (EQ s23 0) (EQ s108 0))...], 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 338 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-10 finished in 2756 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(p0))||(F(p2)&&p1))))'
Support contains 9 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 385 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 385 transition count 1122
Applied a total of 10 rules in 19 ms. Remains 385 /390 variables (removed 5) and now considering 1122/1152 (removed 30) transitions.
[2024-05-24 09:09:12] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-05-24 09:09:12] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 09:09:12] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-05-24 09:09:12] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 09:09:12] [INFO ] Invariant cache hit.
[2024-05-24 09:09:13] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 09:09:14] [INFO ] Implicit Places using invariants and state equation in 1826 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
[2024-05-24 09:09:14] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 09:09:14] [INFO ] Invariant cache hit.
[2024-05-24 09:09:15] [INFO ] Dead Transitions using invariants and state equation in 1063 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 385/390 places, 1122/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3417 ms. Remains : 385/390 places, 1122/1152 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (EQ s4 0) (EQ s18 0) (EQ s258 0)), p1:(AND (OR (EQ s4 0) (EQ s102 0)) (OR (EQ s2 0) (EQ s12 0) (EQ s263 0))), p0:(OR (EQ s7 0) (EQ s92 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 970 ms.
Product exploration explored 100000 steps with 50000 reset in 705 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 p2 p1 p0), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-11 finished in 5328 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 3 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 11 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 09:09:17] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 09:09:17] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 09:09:18] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-24 09:09:18] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:09:18] [INFO ] Invariant cache hit.
[2024-05-24 09:09:18] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:09:19] [INFO ] Implicit Places using invariants and state equation in 1902 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
[2024-05-24 09:09:19] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:09:19] [INFO ] Invariant cache hit.
[2024-05-24 09:09:20] [INFO ] Dead Transitions using invariants and state equation in 976 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3233 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-12 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 s63 0) (EQ s8 1) (EQ s92 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 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-12 finished in 3325 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(F((G(p0)||G(F((!p1 U (p2||G(!p1)))))||(F((!p1 U (p2||G(!p1))))&&X(p3)))))))'
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 11 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 09:09:21] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:09:21] [INFO ] Invariant cache hit.
[2024-05-24 09:09:21] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-24 09:09:21] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:09:21] [INFO ] Invariant cache hit.
[2024-05-24 09:09:21] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:09:23] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2024-05-24 09:09:23] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:09:23] [INFO ] Invariant cache hit.
[2024-05-24 09:09:24] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3025 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (NOT (AND (EQ s5 1) (EQ s22 1) (EQ s276 1))) (NOT (AND (EQ s0 1) (EQ s6 1) (EQ s283 1)))), p0:(OR (EQ s5 0) (EQ s22 0) (EQ s276 0)), p1:(AND (EQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 849 ms.
Product exploration explored 100000 steps with 25000 reset in 564 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 p2 p0 (NOT p1) p3), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) p1 (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-24 09:09:26] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:09:26] [INFO ] Invariant cache hit.
[2024-05-24 09:09:26] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2024-05-24 09:09:26] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 7 ms returned sat
[2024-05-24 09:09:26] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-24 09:09:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2024-05-24 09:09:26] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 7 ms returned sat
[2024-05-24 09:09:27] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-24 09:09:27] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:09:27] [INFO ] After 297ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2024-05-24 09:09:27] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 1 ms to minimize.
[2024-05-24 09:09:28] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 1 ms to minimize.
[2024-05-24 09:09:28] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 1 ms to minimize.
[2024-05-24 09:09:28] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 1 ms to minimize.
[2024-05-24 09:09:28] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 1 ms to minimize.
[2024-05-24 09:09:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1365 ms
[2024-05-24 09:09:29] [INFO ] After 1929ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 190 ms.
[2024-05-24 09:09:29] [INFO ] After 2784ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 378 transition count 997
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 65 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 236/384 places, 968/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 381220 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 381220 steps, saw 102675 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 09:09:32] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 09:09:32] [INFO ] Computed 19 invariants in 5 ms
[2024-05-24 09:09:33] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 09:09:33] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:09:33] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 09:09:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 09:09:33] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 09:09:33] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 09:09:33] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:09:33] [INFO ] After 166ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 09:09:33] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2024-05-24 09:09:33] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2024-05-24 09:09:33] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2024-05-24 09:09:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2024-05-24 09:09:34] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-24 09:09:34] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-05-24 09:09:34] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 09:09:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 297 ms
[2024-05-24 09:09:34] [INFO ] After 962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 121 ms.
[2024-05-24 09:09:34] [INFO ] After 1437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 34 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 33 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-24 09:09:34] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 09:09:34] [INFO ] Invariant cache hit.
[2024-05-24 09:09:35] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-24 09:09:35] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 09:09:35] [INFO ] Invariant cache hit.
[2024-05-24 09:09:35] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:09:36] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1739 ms to find 0 implicit places.
[2024-05-24 09:09:36] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 09:09:36] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 09:09:36] [INFO ] Invariant cache hit.
[2024-05-24 09:09:37] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2734 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 849 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 569 transitions
Reduce isomorphic transitions removed 683 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 240
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 161 transition count 240
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 91 place count 161 transition count 228
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 120 place count 144 transition count 228
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 238 place count 85 transition count 169
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 265 place count 85 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 82 transition count 142
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 82 transition count 139
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 281 place count 82 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 281 place count 82 transition count 131
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 283 place count 81 transition count 131
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 315 place count 81 transition count 99
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 347 place count 49 transition count 99
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 353 place count 49 transition count 99
Applied a total of 353 rules in 17 ms. Remains 49 /236 variables (removed 187) and now considering 99/968 (removed 869) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 99 rows 49 cols
[2024-05-24 09:09:37] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 09:09:37] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 09:09:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-24 09:09:37] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 09:09:37] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 09:09:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-24 09:09:37] [INFO ] After 24ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 09:09:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-24 09:09:37] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 0 ms to minimize.
[2024-05-24 09:09:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2024-05-24 09:09:37] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-24 09:09:37] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1) p3), true, (X (X p2)), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 173 ms :[false, false, false, false, false]
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 7 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-24 09:09:38] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 09:09:38] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 09:09:38] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-24 09:09:38] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:09:38] [INFO ] Invariant cache hit.
[2024-05-24 09:09:38] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:09:40] [INFO ] Implicit Places using invariants and state equation in 1859 ms returned []
Implicit Place search using SMT with State Equation took 2255 ms to find 0 implicit places.
[2024-05-24 09:09:40] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:09:40] [INFO ] Invariant cache hit.
[2024-05-24 09:09:41] [INFO ] Dead Transitions using invariants and state equation in 1193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3456 ms. Remains : 384/384 places, 1116/1116 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 (NOT p1) p3), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 09:09:42] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:09:42] [INFO ] Invariant cache hit.
[2024-05-24 09:09:42] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2024-05-24 09:09:42] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:09:43] [INFO ] After 481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 09:09:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2024-05-24 09:09:43] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 7 ms returned sat
[2024-05-24 09:09:43] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 09:09:43] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:09:43] [INFO ] After 262ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 09:09:44] [INFO ] Deduced a trap composed of 3 places in 280 ms of which 1 ms to minimize.
[2024-05-24 09:09:44] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 1 ms to minimize.
[2024-05-24 09:09:44] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2024-05-24 09:09:44] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 0 ms to minimize.
[2024-05-24 09:09:45] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 0 ms to minimize.
[2024-05-24 09:09:45] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 1 ms to minimize.
[2024-05-24 09:09:45] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2024-05-24 09:09:45] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2024-05-24 09:09:45] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 0 ms to minimize.
[2024-05-24 09:09:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1922 ms
[2024-05-24 09:09:46] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2024-05-24 09:09:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-24 09:09:46] [INFO ] After 2513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 199 ms.
[2024-05-24 09:09:46] [INFO ] After 3336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 80 ms.
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 378 transition count 997
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 68 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 236/384 places, 968/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 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 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 404838 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404838 steps, saw 106215 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 09:09:49] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 09:09:49] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 09:09:50] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 09:09:50] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:09:50] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 09:09:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 09:09:50] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:09:50] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 09:09:50] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:09:50] [INFO ] After 176ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 09:09:50] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 0 ms to minimize.
[2024-05-24 09:09:50] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-24 09:09:50] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 09:09:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 375 ms
[2024-05-24 09:09:50] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 09:09:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-24 09:09:51] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2024-05-24 09:09:51] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-05-24 09:09:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2024-05-24 09:09:51] [INFO ] After 1025ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-24 09:09:51] [INFO ] After 1466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 33 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 32 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-24 09:09:51] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 09:09:51] [INFO ] Invariant cache hit.
[2024-05-24 09:09:51] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-24 09:09:51] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 09:09:51] [INFO ] Invariant cache hit.
[2024-05-24 09:09:52] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:09:53] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
[2024-05-24 09:09:53] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 09:09:53] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 09:09:53] [INFO ] Invariant cache hit.
[2024-05-24 09:09:54] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2794 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 849 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 569 transitions
Reduce isomorphic transitions removed 683 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 240
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 161 transition count 240
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 91 place count 161 transition count 228
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 120 place count 144 transition count 228
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 238 place count 85 transition count 169
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 265 place count 85 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 82 transition count 142
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 82 transition count 139
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 281 place count 82 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 281 place count 82 transition count 131
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 283 place count 81 transition count 131
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 315 place count 81 transition count 99
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 347 place count 49 transition count 99
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 353 place count 49 transition count 99
Applied a total of 353 rules in 18 ms. Remains 49 /236 variables (removed 187) and now considering 99/968 (removed 869) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 99 rows 49 cols
[2024-05-24 09:09:54] [INFO ] Computed 14 invariants in 0 ms
[2024-05-24 09:09:54] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-24 09:09:54] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 09:09:54] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 09:09:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 09:09:54] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 09:09:54] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 09:09:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-24 09:09:54] [INFO ] After 24ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 09:09:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-24 09:09:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-24 09:09:54] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-05-24 09:09:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 73 ms
[2024-05-24 09:09:54] [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 25 ms.
[2024-05-24 09:09:54] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 (NOT p1) p3), true]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 279 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 256 ms :[false, false, false, false, false]
Product exploration explored 100000 steps with 25000 reset in 787 ms.
Product exploration explored 100000 steps with 25000 reset in 621 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 260 ms :[false, false, false, false, false]
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1116
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 107 Pre rules applied. Total rules applied 6 place count 384 transition count 1284
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 107 rules applied. Total rules applied 113 place count 384 transition count 1284
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 148 place count 384 transition count 1284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 154 place count 378 transition count 1278
Deduced a syphon composed of 142 places in 2 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 160 place count 378 transition count 1278
Deduced a syphon composed of 142 places in 1 ms
Applied a total of 160 rules in 88 ms. Remains 378 /384 variables (removed 6) and now considering 1278/1116 (removed -162) transitions.
[2024-05-24 09:09:57] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-24 09:09:57] [INFO ] Flow matrix only has 600 transitions (discarded 678 similar events)
// Phase 1: matrix 600 rows 378 cols
[2024-05-24 09:09:57] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 09:09:58] [INFO ] Dead Transitions using invariants and state equation in 1281 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/384 places, 1278/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1419 ms. Remains : 378/384 places, 1278/1116 transitions.
Built C files in :
/tmp/ltsmin17731080075690218036
[2024-05-24 09:09:58] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17731080075690218036
Running compilation step : cd /tmp/ltsmin17731080075690218036;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17731080075690218036;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17731080075690218036;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 6 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-24 09:10:01] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 09:10:01] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 09:10:02] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-24 09:10:02] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:10:02] [INFO ] Invariant cache hit.
[2024-05-24 09:10:02] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:10:04] [INFO ] Implicit Places using invariants and state equation in 1982 ms returned []
Implicit Place search using SMT with State Equation took 2314 ms to find 0 implicit places.
[2024-05-24 09:10:04] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:10:04] [INFO ] Invariant cache hit.
[2024-05-24 09:10:05] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3210 ms. Remains : 384/384 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin3491368428493416843
[2024-05-24 09:10:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3491368428493416843
Running compilation step : cd /tmp/ltsmin3491368428493416843;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3491368428493416843;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3491368428493416843;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 09:10:08] [INFO ] Flatten gal took : 34 ms
[2024-05-24 09:10:08] [INFO ] Flatten gal took : 30 ms
[2024-05-24 09:10:08] [INFO ] Time to serialize gal into /tmp/LTL1636727308903399007.gal : 8 ms
[2024-05-24 09:10:08] [INFO ] Time to serialize properties into /tmp/LTL7784225007393214581.prop : 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/LTL1636727308903399007.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17824747144979866521.hoa' '-atoms' '/tmp/LTL7784225007393214581.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/LTL7784225007393214581.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17824747144979866521.hoa
Detected timeout of ITS tools.
[2024-05-24 09:10:23] [INFO ] Flatten gal took : 27 ms
[2024-05-24 09:10:23] [INFO ] Flatten gal took : 27 ms
[2024-05-24 09:10:23] [INFO ] Time to serialize gal into /tmp/LTL3441936641108558954.gal : 9 ms
[2024-05-24 09:10:23] [INFO ] Time to serialize properties into /tmp/LTL4321288549798892184.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/LTL3441936641108558954.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4321288549798892184.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((G("(((turn_5==0)||(flag_5_waiting==0))||(p25_4_0==0))"))||(G(F((!("(((turn_0==1)&&(flag_0_idle==1))&&(p25_5_1==1))"))U(("((...588
Formula 0 simplified : XXG(F!"(((turn_5==0)||(flag_5_waiting==0))||(p25_4_0==0))" & FG("(((turn_0==1)&&(flag_0_idle==1))&&(p25_5_1==1))" M !"((!(((turn_5==...440
Detected timeout of ITS tools.
[2024-05-24 09:10:38] [INFO ] Flatten gal took : 26 ms
[2024-05-24 09:10:38] [INFO ] Applying decomposition
[2024-05-24 09:10:38] [INFO ] Flatten gal took : 26 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/graph14105648113162240847.txt' '-o' '/tmp/graph14105648113162240847.bin' '-w' '/tmp/graph14105648113162240847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14105648113162240847.bin' '-l' '-1' '-v' '-w' '/tmp/graph14105648113162240847.weights' '-q' '0' '-e' '0.001'
[2024-05-24 09:10:38] [INFO ] Decomposing Gal with order
[2024-05-24 09:10:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:10:38] [INFO ] Removed a total of 1898 redundant transitions.
[2024-05-24 09:10:38] [INFO ] Flatten gal took : 93 ms
[2024-05-24 09:10:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 326 labels/synchronizations in 41 ms.
[2024-05-24 09:10:38] [INFO ] Time to serialize gal into /tmp/LTL16603250071445270341.gal : 12 ms
[2024-05-24 09:10:38] [INFO ] Time to serialize properties into /tmp/LTL11936942905421396133.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/LTL16603250071445270341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11936942905421396133.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((G("(((i16.u99.turn_5==0)||(i14.i1.u97.flag_5_waiting==0))||(i16.u99.p25_4_0==0))"))||(G(F((!("(((i16.u99.turn_0==1)&&(i15.i...844
Formula 0 simplified : XXG(F!"(((i16.u99.turn_5==0)||(i14.i1.u97.flag_5_waiting==0))||(i16.u99.p25_4_0==0))" & FG("(((i16.u99.turn_0==1)&&(i15.i1.u66.flag_...640
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7736918151250178762
[2024-05-24 09:10:53] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7736918151250178762
Running compilation step : cd /tmp/ltsmin7736918151250178762;'/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 2957 ms.
Running link step : cd /tmp/ltsmin7736918151250178762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin7736918151250178762;'/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' 'X(X(<>(([]((LTLAPp0==true))||[](<>((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))||(<>((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))&&X((LTLAPp3==true)))))))' '--buchi-type=spotba'
LTSmin run took 382 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-13 finished in 96150 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(p0)||F(p1)) U X(G(((p2 U X(p1)) U p3)))))'
Support contains 9 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 12 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 09:10:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:10:57] [INFO ] Invariant cache hit.
[2024-05-24 09:10:57] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-24 09:10:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:10:57] [INFO ] Invariant cache hit.
[2024-05-24 09:10:58] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:10:59] [INFO ] Implicit Places using invariants and state equation in 2082 ms returned []
Implicit Place search using SMT with State Equation took 2501 ms to find 0 implicit places.
[2024-05-24 09:10:59] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 09:10:59] [INFO ] Invariant cache hit.
[2024-05-24 09:11:00] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3449 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 480 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 4}, { cond=(NOT p3), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=1, aps=[p1:(EQ s231 1), p3:(AND (EQ s3 1) (EQ s15 1) (EQ s284 1)), p0:(AND (EQ s18 1) (EQ s185 1)), p2:(AND (EQ s4 1) (EQ s20 1) (EQ s259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 274 reset in 298 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-14 finished in 4287 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(p0)||G(p1)||(X(X(p0))&&X(p0)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-01
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 390 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 390 transition count 1146
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 384 transition count 1146
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 384 transition count 1032
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 270 transition count 1032
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 246 place count 264 transition count 996
Iterating global reduction 2 with 6 rules applied. Total rules applied 252 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 312 place count 234 transition count 966
Applied a total of 312 rules in 59 ms. Remains 234 /390 variables (removed 156) and now considering 966/1152 (removed 186) transitions.
[2024-05-24 09:11:01] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 09:11:01] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 09:11:02] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-05-24 09:11:02] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:02] [INFO ] Invariant cache hit.
[2024-05-24 09:11:02] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:11:03] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
[2024-05-24 09:11:03] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:03] [INFO ] Invariant cache hit.
[2024-05-24 09:11:04] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 234/390 places, 966/1152 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2665 ms. Remains : 234/390 places, 966/1152 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s23 0) (EQ s165 0)), p0:(AND (EQ s5 1) (EQ s23 1) (EQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 231 ms.
Product exploration explored 100000 steps with 0 reset in 256 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 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 322483 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322483 steps, saw 93985 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 09:11:08] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:08] [INFO ] Invariant cache hit.
[2024-05-24 09:11:08] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 09:11:08] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:11:08] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 09:11:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 09:11:08] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 09:11:09] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 09:11:09] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:11:09] [INFO ] After 118ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 09:11:09] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-24 09:11:09] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 09:11:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2024-05-24 09:11:09] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2024-05-24 09:11:09] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2024-05-24 09:11:09] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 0 ms to minimize.
[2024-05-24 09:11:09] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2024-05-24 09:11:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 583 ms
[2024-05-24 09:11:10] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2024-05-24 09:11:10] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-05-24 09:11:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2024-05-24 09:11:10] [INFO ] After 1236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 100 ms.
[2024-05-24 09:11:10] [INFO ] After 1679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 33 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 351442 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 351442 steps, saw 100396 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 09:11:14] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:14] [INFO ] Invariant cache hit.
[2024-05-24 09:11:14] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 09:11:14] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:11:14] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 09:11:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 09:11:14] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:11:14] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 09:11:14] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:11:14] [INFO ] After 154ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 09:11:14] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-24 09:11:15] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 09:11:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2024-05-24 09:11:15] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2024-05-24 09:11:15] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 0 ms to minimize.
[2024-05-24 09:11:15] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-05-24 09:11:15] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-24 09:11:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 579 ms
[2024-05-24 09:11:15] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2024-05-24 09:11:15] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-24 09:11:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 229 ms
[2024-05-24 09:11:15] [INFO ] After 1266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-24 09:11:16] [INFO ] After 1686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 21 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 23 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 09:11:16] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:16] [INFO ] Invariant cache hit.
[2024-05-24 09:11:16] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-24 09:11:16] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:16] [INFO ] Invariant cache hit.
[2024-05-24 09:11:16] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:11:17] [INFO ] Implicit Places using invariants and state equation in 1370 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
[2024-05-24 09:11:17] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 09:11:17] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:17] [INFO ] Invariant cache hit.
[2024-05-24 09:11:18] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2597 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 33 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2024-05-24 09:11:18] [INFO ] Computed 13 invariants in 0 ms
[2024-05-24 09:11:18] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 09:11:18] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 09:11:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 09:11:18] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 09:11:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 09:11:19] [INFO ] After 39ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 09:11:19] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 09:11:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-24 09:11:19] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 09:11:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-24 09:11:19] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-24 09:11:19] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 146 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 09:11:19] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 09:11:19] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 09:11:20] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-24 09:11:20] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:20] [INFO ] Invariant cache hit.
[2024-05-24 09:11:20] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:11:21] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1535 ms to find 0 implicit places.
[2024-05-24 09:11:21] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:21] [INFO ] Invariant cache hit.
[2024-05-24 09:11:21] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2302 ms. Remains : 234/234 places, 966/966 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 (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 366198 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 366198 steps, saw 102555 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 09:11:25] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:25] [INFO ] Invariant cache hit.
[2024-05-24 09:11:25] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 09:11:25] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 09:11:25] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 09:11:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 09:11:25] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:11:26] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 09:11:26] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:11:26] [INFO ] After 173ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 09:11:26] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-24 09:11:26] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 09:11:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2024-05-24 09:11:26] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 3 ms to minimize.
[2024-05-24 09:11:26] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 1 ms to minimize.
[2024-05-24 09:11:26] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 1 ms to minimize.
[2024-05-24 09:11:27] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2024-05-24 09:11:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 615 ms
[2024-05-24 09:11:27] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-24 09:11:27] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-24 09:11:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2024-05-24 09:11:27] [INFO ] After 1363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 128 ms.
[2024-05-24 09:11:27] [INFO ] After 1955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 31 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 296975 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 296975 steps, saw 89344 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 09:11:31] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:31] [INFO ] Invariant cache hit.
[2024-05-24 09:11:31] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-24 09:11:31] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:11:31] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 09:11:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 09:11:31] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:11:31] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 09:11:31] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:11:32] [INFO ] After 175ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 09:11:32] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2024-05-24 09:11:32] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 09:11:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2024-05-24 09:11:32] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-24 09:11:32] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2024-05-24 09:11:32] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 0 ms to minimize.
[2024-05-24 09:11:32] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-24 09:11:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 538 ms
[2024-05-24 09:11:33] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2024-05-24 09:11:33] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-24 09:11:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2024-05-24 09:11:33] [INFO ] After 1251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 130 ms.
[2024-05-24 09:11:33] [INFO ] After 1819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 35 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 32 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 09:11:33] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:33] [INFO ] Invariant cache hit.
[2024-05-24 09:11:33] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-24 09:11:33] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:33] [INFO ] Invariant cache hit.
[2024-05-24 09:11:34] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:11:35] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
[2024-05-24 09:11:35] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 09:11:35] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:35] [INFO ] Invariant cache hit.
[2024-05-24 09:11:36] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2917 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 20 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2024-05-24 09:11:36] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 09:11:36] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 09:11:36] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 09:11:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 09:11:36] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 09:11:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 09:11:36] [INFO ] After 30ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 09:11:36] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-24 09:11:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-05-24 09:11:36] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 2 ms to minimize.
[2024-05-24 09:11:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-05-24 09:11:36] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-24 09:11:36] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 391 ms.
Product exploration explored 100000 steps with 0 reset in 305 ms.
Built C files in :
/tmp/ltsmin1355298563962805544
[2024-05-24 09:11:38] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1355298563962805544
Running compilation step : cd /tmp/ltsmin1355298563962805544;'/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 2833 ms.
Running link step : cd /tmp/ltsmin1355298563962805544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1355298563962805544;'/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' '--hoa' '/tmp/stateBased2574703625624717967.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 4 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 09:11:53] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 09:11:53] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 09:11:53] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-24 09:11:53] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:53] [INFO ] Invariant cache hit.
[2024-05-24 09:11:53] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:11:54] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
[2024-05-24 09:11:54] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 09:11:54] [INFO ] Invariant cache hit.
[2024-05-24 09:11:55] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2274 ms. Remains : 234/234 places, 966/966 transitions.
Built C files in :
/tmp/ltsmin1820030852994993058
[2024-05-24 09:11:55] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1820030852994993058
Running compilation step : cd /tmp/ltsmin1820030852994993058;'/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 2669 ms.
Running link step : cd /tmp/ltsmin1820030852994993058;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1820030852994993058;'/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' '--hoa' '/tmp/stateBased3079134707648713795.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 09:12:10] [INFO ] Flatten gal took : 24 ms
[2024-05-24 09:12:10] [INFO ] Flatten gal took : 24 ms
[2024-05-24 09:12:10] [INFO ] Time to serialize gal into /tmp/LTL10328236840045585801.gal : 5 ms
[2024-05-24 09:12:10] [INFO ] Time to serialize properties into /tmp/LTL6775591846026936903.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/LTL10328236840045585801.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17014777640730163372.hoa' '-atoms' '/tmp/LTL6775591846026936903.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/LTL6775591846026936903.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17014777640730163372.hoa
Detected timeout of ITS tools.
[2024-05-24 09:12:25] [INFO ] Flatten gal took : 26 ms
[2024-05-24 09:12:25] [INFO ] Flatten gal took : 26 ms
[2024-05-24 09:12:25] [INFO ] Time to serialize gal into /tmp/LTL18399368538072951944.gal : 5 ms
[2024-05-24 09:12:25] [INFO ] Time to serialize properties into /tmp/LTL14398718314714461090.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/LTL18399368538072951944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14398718314714461090.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 : !((F(((G("(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))"))||(G("(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))")))||((X(X("(((t...266
Formula 0 simplified : G(F!"(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))" & X(!"(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))" | X!"(((turn_5==1)&...193
Detected timeout of ITS tools.
[2024-05-24 09:12:40] [INFO ] Flatten gal took : 22 ms
[2024-05-24 09:12:40] [INFO ] Applying decomposition
[2024-05-24 09:12:40] [INFO ] Flatten gal took : 23 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/graph9967412037099232085.txt' '-o' '/tmp/graph9967412037099232085.bin' '-w' '/tmp/graph9967412037099232085.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9967412037099232085.bin' '-l' '-1' '-v' '-w' '/tmp/graph9967412037099232085.weights' '-q' '0' '-e' '0.001'
[2024-05-24 09:12:40] [INFO ] Decomposing Gal with order
[2024-05-24 09:12:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:12:40] [INFO ] Removed a total of 1772 redundant transitions.
[2024-05-24 09:12:40] [INFO ] Flatten gal took : 114 ms
[2024-05-24 09:12:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 337 labels/synchronizations in 28 ms.
[2024-05-24 09:12:41] [INFO ] Time to serialize gal into /tmp/LTL4518241882823987168.gal : 8 ms
[2024-05-24 09:12:41] [INFO ] Time to serialize properties into /tmp/LTL4964591476568728945.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/LTL4518241882823987168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4964591476568728945.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 : !((F(((G("(((i10.u3.turn_5==1)&&(i7.i1.u37.flag_5_active==1))&&(i12.i0.u2.p25_2_1==1))"))||(G("(((i10.u3.turn_5==0)||(i7.i1.u37.flag_5...371
Formula 0 simplified : G(F!"(((i10.u3.turn_5==0)||(i7.i1.u37.flag_5_active==0))||(i10.u3.p25_4_1==0))" & X(!"(((i10.u3.turn_5==1)&&(i7.i1.u37.flag_5_active...271
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3622094439097627801
[2024-05-24 09:12:56] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3622094439097627801
Running compilation step : cd /tmp/ltsmin3622094439097627801;'/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 2774 ms.
Running link step : cd /tmp/ltsmin3622094439097627801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin3622094439097627801;'/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))||[]((LTLAPp1==true))||(X(X((LTLAPp0==true)))&&X((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 129754 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(F(((!p0 U (G(!p0)||!p0)) U (G((!p0 U (p1||G(!p0))))||(G(!p2)&&(!p0 U (p1||G(!p0))))))))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-05
Stuttering acceptance computed with spot in 254 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 5 out of 390 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 390/390 places, 1152/1152 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 390 transition count 1147
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 385 transition count 1147
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 10 place count 385 transition count 1033
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 238 place count 271 transition count 1033
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 244 place count 265 transition count 997
Iterating global reduction 2 with 6 rules applied. Total rules applied 250 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 310 place count 235 transition count 967
Applied a total of 310 rules in 36 ms. Remains 235 /390 variables (removed 155) and now considering 967/1152 (removed 185) transitions.
[2024-05-24 09:13:11] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 09:13:11] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 09:13:12] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-24 09:13:12] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:12] [INFO ] Invariant cache hit.
[2024-05-24 09:13:12] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:13:13] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
[2024-05-24 09:13:13] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:13] [INFO ] Invariant cache hit.
[2024-05-24 09:13:14] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 235/390 places, 967/1152 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2410 ms. Remains : 235/390 places, 967/1152 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s3 1) (EQ s209 1)), p2:(AND (EQ s2 1) (EQ s12 1) (EQ s149 1)), p1:(AND (OR (NOT (AND (EQ s3 1) (EQ s209 1))) (AND (EQ s3 1) (EQ s209 1))) (NOT...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 277 ms.
Product exploration explored 100000 steps with 0 reset in 322 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 p0) (NOT p2) p1), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-24 09:13:15] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:15] [INFO ] Invariant cache hit.
[2024-05-24 09:13:15] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-24 09:13:15] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:13:15] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2024-05-24 09:13:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 09:13:15] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:13:15] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2024-05-24 09:13:15] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:13:15] [INFO ] After 67ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2024-05-24 09:13:16] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2024-05-24 09:13:16] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2024-05-24 09:13:16] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-24 09:13:16] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-24 09:13:16] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2024-05-24 09:13:16] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2024-05-24 09:13:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 691 ms
[2024-05-24 09:13:16] [INFO ] After 802ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-24 09:13:16] [INFO ] After 1145ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 20 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 235/235 places, 967/967 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 667527 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 667527 steps, saw 163967 distinct states, run finished after 3005 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 09:13:19] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:19] [INFO ] Invariant cache hit.
[2024-05-24 09:13:19] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 09:13:19] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 09:13:19] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 09:13:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 09:13:19] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 09:13:20] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 09:13:20] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:13:20] [INFO ] After 68ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 09:13:20] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2024-05-24 09:13:20] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-05-24 09:13:20] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-24 09:13:20] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-24 09:13:20] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2024-05-24 09:13:20] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2024-05-24 09:13:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 678 ms
[2024-05-24 09:13:20] [INFO ] After 791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-24 09:13:21] [INFO ] After 1128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 20 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 20 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 09:13:21] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:21] [INFO ] Invariant cache hit.
[2024-05-24 09:13:21] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-24 09:13:21] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:21] [INFO ] Invariant cache hit.
[2024-05-24 09:13:21] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:13:22] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
[2024-05-24 09:13:22] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 09:13:22] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:22] [INFO ] Invariant cache hit.
[2024-05-24 09:13:23] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2408 ms. Remains : 235/235 places, 967/967 transitions.
Graph (trivial) has 864 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 205 transition count 236
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 80 transition count 164
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 80 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 74 transition count 135
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 74 transition count 129
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 74 transition count 123
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 327 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 356 place count 45 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 45 transition count 94
Applied a total of 362 rules in 16 ms. Remains 45 /235 variables (removed 190) and now considering 94/967 (removed 873) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 45 cols
[2024-05-24 09:13:23] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 09:13:23] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 09:13:23] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 09:13:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-24 09:13:23] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 09:13:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 09:13:23] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 09:13:23] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-24 09:13:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-05-24 09:13:23] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-24 09:13:23] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (G (NOT (AND p0 p2 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 264 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 09:13:24] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 09:13:24] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 09:13:24] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-24 09:13:24] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:24] [INFO ] Invariant cache hit.
[2024-05-24 09:13:24] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:13:25] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
[2024-05-24 09:13:25] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:25] [INFO ] Invariant cache hit.
[2024-05-24 09:13:26] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2117 ms. Remains : 235/235 places, 967/967 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 (NOT p2) p1), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (AND (NOT p2) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 09:13:27] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:27] [INFO ] Invariant cache hit.
[2024-05-24 09:13:27] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 09:13:27] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:13:27] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:13:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 09:13:27] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:13:27] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 09:13:27] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:13:27] [INFO ] After 126ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 09:13:27] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 1 ms to minimize.
[2024-05-24 09:13:27] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-24 09:13:28] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2024-05-24 09:13:28] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-24 09:13:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 555 ms
[2024-05-24 09:13:28] [INFO ] After 771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-24 09:13:28] [INFO ] After 1230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 32 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 235/235 places, 967/967 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 369096 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 369096 steps, saw 103904 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 09:13:31] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:31] [INFO ] Invariant cache hit.
[2024-05-24 09:13:31] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 09:13:31] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 7 ms returned sat
[2024-05-24 09:13:31] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:13:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 09:13:31] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:13:32] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 09:13:32] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:13:32] [INFO ] After 114ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 09:13:32] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2024-05-24 09:13:32] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2024-05-24 09:13:32] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-05-24 09:13:32] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2024-05-24 09:13:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 505 ms
[2024-05-24 09:13:32] [INFO ] After 699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-24 09:13:32] [INFO ] After 1106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 19 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 18 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 09:13:33] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:33] [INFO ] Invariant cache hit.
[2024-05-24 09:13:33] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-24 09:13:33] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:33] [INFO ] Invariant cache hit.
[2024-05-24 09:13:33] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:13:34] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
[2024-05-24 09:13:34] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 09:13:34] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:34] [INFO ] Invariant cache hit.
[2024-05-24 09:13:35] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2305 ms. Remains : 235/235 places, 967/967 transitions.
Graph (trivial) has 864 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 205 transition count 236
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 80 transition count 164
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 80 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 74 transition count 135
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 74 transition count 129
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 74 transition count 123
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 327 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 356 place count 45 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 45 transition count 94
Applied a total of 362 rules in 11 ms. Remains 45 /235 variables (removed 190) and now considering 94/967 (removed 873) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 45 cols
[2024-05-24 09:13:35] [INFO ] Computed 13 invariants in 0 ms
[2024-05-24 09:13:35] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 09:13:35] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 09:13:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 09:13:35] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 09:13:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 09:13:35] [INFO ] After 20ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 09:13:35] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-24 09:13:35] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 09:13:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2024-05-24 09:13:35] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-24 09:13:35] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 407 ms.
Product exploration explored 100000 steps with 0 reset in 443 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 33 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 09:13:37] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 09:13:37] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 09:13:37] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 09:13:38] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 937 ms. Remains : 235/235 places, 967/967 transitions.
Built C files in :
/tmp/ltsmin6271451827072548019
[2024-05-24 09:13:38] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6271451827072548019
Running compilation step : cd /tmp/ltsmin6271451827072548019;'/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 2816 ms.
Running link step : cd /tmp/ltsmin6271451827072548019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6271451827072548019;'/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' '--hoa' '/tmp/stateBased10874365401254184521.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 09:13:53] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:53] [INFO ] Invariant cache hit.
[2024-05-24 09:13:53] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-24 09:13:53] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:53] [INFO ] Invariant cache hit.
[2024-05-24 09:13:54] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 09:13:55] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
[2024-05-24 09:13:55] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 09:13:55] [INFO ] Invariant cache hit.
[2024-05-24 09:13:55] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2253 ms. Remains : 235/235 places, 967/967 transitions.
Built C files in :
/tmp/ltsmin5221505996533038172
[2024-05-24 09:13:56] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5221505996533038172
Running compilation step : cd /tmp/ltsmin5221505996533038172;'/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 2973 ms.
Running link step : cd /tmp/ltsmin5221505996533038172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5221505996533038172;'/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' '--hoa' '/tmp/stateBased12352040640931134320.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 09:14:11] [INFO ] Flatten gal took : 22 ms
[2024-05-24 09:14:11] [INFO ] Flatten gal took : 23 ms
[2024-05-24 09:14:11] [INFO ] Time to serialize gal into /tmp/LTL10200835149328178204.gal : 4 ms
[2024-05-24 09:14:11] [INFO ] Time to serialize properties into /tmp/LTL1601210296080988314.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/LTL10200835149328178204.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11787849916702659245.hoa' '-atoms' '/tmp/LTL1601210296080988314.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/LTL1601210296080988314.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11787849916702659245.hoa
Detected timeout of ITS tools.
[2024-05-24 09:14:26] [INFO ] Flatten gal took : 23 ms
[2024-05-24 09:14:26] [INFO ] Flatten gal took : 38 ms
[2024-05-24 09:14:26] [INFO ] Time to serialize gal into /tmp/LTL10670574478016571555.gal : 6 ms
[2024-05-24 09:14:26] [INFO ] Time to serialize properties into /tmp/LTL958715504516878380.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/LTL10670574478016571555.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL958715504516878380.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((!("((turn_3==1)&&(p37_3_4==1))"))U((G(!("((turn_3==1)&&(p37_3_4==1))")))||(!("((turn_3==1)&&(p37_3_4==1))"))))U((G((!("((tu...570
Formula 0 simplified : XXG(F(!"(((!((turn_3==1)&&(p37_3_4==1)))||((turn_3==1)&&(p37_3_4==1)))&&(!((turn_3==1)&&(p37_3_4==1))))" & "((turn_3==1)&&(p37_3_4==...351
Detected timeout of ITS tools.
[2024-05-24 09:14:41] [INFO ] Flatten gal took : 40 ms
[2024-05-24 09:14:41] [INFO ] Applying decomposition
[2024-05-24 09:14:41] [INFO ] Flatten gal took : 40 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/graph13179242749174189550.txt' '-o' '/tmp/graph13179242749174189550.bin' '-w' '/tmp/graph13179242749174189550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13179242749174189550.bin' '-l' '-1' '-v' '-w' '/tmp/graph13179242749174189550.weights' '-q' '0' '-e' '0.001'
[2024-05-24 09:14:41] [INFO ] Decomposing Gal with order
[2024-05-24 09:14:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:14:41] [INFO ] Removed a total of 1795 redundant transitions.
[2024-05-24 09:14:41] [INFO ] Flatten gal took : 120 ms
[2024-05-24 09:14:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 367 labels/synchronizations in 37 ms.
[2024-05-24 09:14:41] [INFO ] Time to serialize gal into /tmp/LTL4398132874722795044.gal : 10 ms
[2024-05-24 09:14:41] [INFO ] Time to serialize properties into /tmp/LTL4878364762913749854.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/LTL4398132874722795044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4878364762913749854.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 : !((X(X(F(((!("((i8.u3.turn_3==1)&&(i8.u58.p37_3_4==1))"))U((G(!("((i8.u3.turn_3==1)&&(i8.u58.p37_3_4==1))")))||(!("((i8.u3.turn_3==1)&...764
Formula 0 simplified : XXG(F(!"(((!((i8.u3.turn_3==1)&&(i8.u58.p37_3_4==1)))||((i8.u3.turn_3==1)&&(i8.u58.p37_3_4==1)))&&(!((i8.u3.turn_3==1)&&(i8.u58.p37_...480
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14502208975540750458
[2024-05-24 09:14:56] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14502208975540750458
Running compilation step : cd /tmp/ltsmin14502208975540750458;'/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 2859 ms.
Running link step : cd /tmp/ltsmin14502208975540750458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14502208975540750458;'/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' 'X(X(<>(((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||!(LTLAPp0==true))) U ([]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||([](!(LTLAPp2==true))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-05 finished in 120655 ms.
[2024-05-24 09:15:11] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12059778529250849852
[2024-05-24 09:15:11] [INFO ] Computing symmetric may disable matrix : 1152 transitions.
[2024-05-24 09:15:11] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:15:11] [INFO ] Applying decomposition
[2024-05-24 09:15:11] [INFO ] Computing symmetric may enable matrix : 1152 transitions.
[2024-05-24 09:15:11] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:15:11] [INFO ] Flatten gal took : 28 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/graph12631362081911952220.txt' '-o' '/tmp/graph12631362081911952220.bin' '-w' '/tmp/graph12631362081911952220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12631362081911952220.bin' '-l' '-1' '-v' '-w' '/tmp/graph12631362081911952220.weights' '-q' '0' '-e' '0.001'
[2024-05-24 09:15:12] [INFO ] Decomposing Gal with order
[2024-05-24 09:15:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:15:12] [INFO ] Removed a total of 2066 redundant transitions.
[2024-05-24 09:15:12] [INFO ] Flatten gal took : 73 ms
[2024-05-24 09:15:12] [INFO ] Computing Do-Not-Accords matrix : 1152 transitions.
[2024-05-24 09:15:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 337 labels/synchronizations in 25 ms.
[2024-05-24 09:15:12] [INFO ] Time to serialize gal into /tmp/LTLFireability4714320211737689900.gal : 10 ms
[2024-05-24 09:15:12] [INFO ] Time to serialize properties into /tmp/LTLFireability15977563240201760879.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/LTLFireability4714320211737689900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15977563240201760879.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 2 LTL properties
[2024-05-24 09:15:12] [INFO ] Computation of Completed DNA matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:15:12] [INFO ] Built C files in 343ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12059778529250849852
Running compilation step : cd /tmp/ltsmin12059778529250849852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
Checking formula 0 : !((F(((G("(((i14.i0.u3.turn_5==1)&&(i6.i0.u8.flag_5_active==1))&&(i1.u6.p25_2_1==1))"))||(G("(((i14.i0.u3.turn_5==0)||(i6.i0.u8.flag_5...369
Formula 0 simplified : G(F!"(((i14.i0.u3.turn_5==0)||(i6.i0.u8.flag_5_active==0))||(i6.i0.u8.p25_4_1==0))" & X(!"(((i14.i0.u3.turn_5==1)&&(i6.i0.u8.flag_5_...271
Compilation finished in 5400 ms.
Running link step : cd /tmp/ltsmin12059778529250849852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin12059778529250849852;'/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))||[]((LTLAPp1==true))||(X(X((LTLAPp0==true)))&&X((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 09:38:45] [INFO ] Applying decomposition
[2024-05-24 09:38:45] [INFO ] Flatten gal took : 88 ms
[2024-05-24 09:38:45] [INFO ] Decomposing Gal with order
[2024-05-24 09:38:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:38:46] [INFO ] Removed a total of 2155 redundant transitions.
[2024-05-24 09:38:46] [INFO ] Flatten gal took : 606 ms
[2024-05-24 09:38:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 42 ms.
[2024-05-24 09:38:46] [INFO ] Time to serialize gal into /tmp/LTLFireability2942879178424638553.gal : 11 ms
[2024-05-24 09:38:46] [INFO ] Time to serialize properties into /tmp/LTLFireability3714893322256068445.ltl : 9 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/LTLFireability2942879178424638553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3714893322256068445.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...276
Read 2 LTL properties
Checking formula 0 : !((F(((G("(((u8.turn_5==1)&&(u14.flag_5_active==1))&&(u5.p25_2_1==1))"))||(G("(((u8.turn_5==0)||(u14.flag_5_active==0))||(u7.p25_4_1==...306
Formula 0 simplified : G(F!"(((u8.turn_5==0)||(u14.flag_5_active==0))||(u7.p25_4_1==0))" & X(!"(((u8.turn_5==1)&&(u14.flag_5_active==1))&&(u5.p25_2_1==1))"...223
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin12059778529250849852;'/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))||[]((LTLAPp1==true))||(X(X((LTLAPp0==true)))&&X((LTLAPp0==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12059778529250849852;'/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' 'X(X(<>(((!(LTLAPp2==true) U ([](!(LTLAPp2==true))||!(LTLAPp2==true))) U ([]((!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true)))))||([](!(LTLAPp4==true))&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 10:02:19] [INFO ] Flatten gal took : 81 ms
[2024-05-24 10:02:19] [INFO ] Input system was already deterministic with 1152 transitions.
[2024-05-24 10:02:19] [INFO ] Transformed 390 places.
[2024-05-24 10:02:19] [INFO ] Transformed 1152 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 10:02:19] [INFO ] Time to serialize gal into /tmp/LTLFireability15253480489103394562.gal : 4 ms
[2024-05-24 10:02:19] [INFO ] Time to serialize properties into /tmp/LTLFireability82871506096376257.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/LTLFireability15253480489103394562.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability82871506096376257.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...341
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(((G("(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))"))||(G("(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))")))||((X(X("(((t...266
Formula 0 simplified : G(F!"(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))" & X(!"(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))" | X!"(((turn_5==1)&...193
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11015692 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16037872 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ 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-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is EisenbergMcGuire-PT-06, 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 r175-smll-171636279900108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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