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.r373-tall-171683789500528.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 ShieldRVs-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789500528
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 17:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 498K May 18 16:43 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 ShieldRVs-PT-040B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717005509245

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=ShieldRVs-PT-040B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 17:58:31] [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-29 17:58:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:58:31] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2024-05-29 17:58:31] [INFO ] Transformed 1603 places.
[2024-05-29 17:58:31] [INFO ] Transformed 1803 transitions.
[2024-05-29 17:58:31] [INFO ] Found NUPN structural information;
[2024-05-29 17:58:31] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVs-PT-040B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Discarding 270 places :
Symmetric choice reduction at 0 with 270 rule applications. Total rules 270 place count 1333 transition count 1533
Iterating global reduction 0 with 270 rules applied. Total rules applied 540 place count 1333 transition count 1533
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 541 place count 1332 transition count 1532
Iterating global reduction 0 with 1 rules applied. Total rules applied 542 place count 1332 transition count 1532
Applied a total of 542 rules in 305 ms. Remains 1332 /1603 variables (removed 271) and now considering 1532/1803 (removed 271) transitions.
// Phase 1: matrix 1532 rows 1332 cols
[2024-05-29 17:58:32] [INFO ] Computed 161 invariants in 34 ms
[2024-05-29 17:58:32] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-05-29 17:58:32] [INFO ] Invariant cache hit.
[2024-05-29 17:58:33] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
[2024-05-29 17:58:33] [INFO ] Invariant cache hit.
[2024-05-29 17:58:34] [INFO ] Dead Transitions using invariants and state equation in 791 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1332/1603 places, 1532/1803 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2444 ms. Remains : 1332/1603 places, 1532/1803 transitions.
Support contains 51 out of 1332 places after structural reductions.
[2024-05-29 17:58:34] [INFO ] Flatten gal took : 143 ms
[2024-05-29 17:58:34] [INFO ] Flatten gal took : 89 ms
[2024-05-29 17:58:34] [INFO ] Input system was already deterministic with 1532 transitions.
Support contains 48 out of 1332 places (down from 51) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 33) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-29 17:58:35] [INFO ] Invariant cache hit.
[2024-05-29 17:58:35] [INFO ] [Real]Absence check using 161 positive place invariants in 59 ms returned sat
[2024-05-29 17:58:36] [INFO ] After 565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 17:58:36] [INFO ] [Nat]Absence check using 161 positive place invariants in 52 ms returned sat
[2024-05-29 17:58:37] [INFO ] After 1197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 17:58:38] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 7 ms to minimize.
[2024-05-29 17:58:38] [INFO ] Deduced a trap composed of 41 places in 306 ms of which 2 ms to minimize.
[2024-05-29 17:58:38] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 1 ms to minimize.
[2024-05-29 17:58:39] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 2 ms to minimize.
[2024-05-29 17:58:39] [INFO ] Deduced a trap composed of 35 places in 290 ms of which 1 ms to minimize.
[2024-05-29 17:58:39] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 0 ms to minimize.
[2024-05-29 17:58:40] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 2 ms to minimize.
[2024-05-29 17:58:40] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 0 ms to minimize.
[2024-05-29 17:58:40] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 1 ms to minimize.
[2024-05-29 17:58:40] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 0 ms to minimize.
[2024-05-29 17:58:41] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 0 ms to minimize.
[2024-05-29 17:58:41] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 1 ms to minimize.
[2024-05-29 17:58:41] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 0 ms to minimize.
[2024-05-29 17:58:41] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 1 ms to minimize.
[2024-05-29 17:58:42] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 0 ms to minimize.
[2024-05-29 17:58:42] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 1 ms to minimize.
[2024-05-29 17:58:42] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 1 ms to minimize.
[2024-05-29 17:58:42] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
[2024-05-29 17:58:42] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 0 ms to minimize.
[2024-05-29 17:58:43] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
[2024-05-29 17:58:43] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 0 ms to minimize.
[2024-05-29 17:58:43] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 0 ms to minimize.
[2024-05-29 17:58:43] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 0 ms to minimize.
[2024-05-29 17:58:43] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 0 ms to minimize.
[2024-05-29 17:58:44] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 1 ms to minimize.
[2024-05-29 17:58:44] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 0 ms to minimize.
[2024-05-29 17:58:44] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 0 ms to minimize.
[2024-05-29 17:58:44] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 1 ms to minimize.
[2024-05-29 17:58:45] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 0 ms to minimize.
[2024-05-29 17:58:45] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 0 ms to minimize.
[2024-05-29 17:58:45] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 0 ms to minimize.
[2024-05-29 17:58:45] [INFO ] Deduced a trap composed of 63 places in 149 ms of which 0 ms to minimize.
[2024-05-29 17:58:45] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 1 ms to minimize.
[2024-05-29 17:58:46] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 3 ms to minimize.
[2024-05-29 17:58:46] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 1 ms to minimize.
[2024-05-29 17:58:46] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 8495 ms
[2024-05-29 17:58:46] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 1 ms to minimize.
[2024-05-29 17:58:46] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 1 ms to minimize.
[2024-05-29 17:58:47] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 1 ms to minimize.
[2024-05-29 17:58:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 576 ms
[2024-05-29 17:58:47] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 0 ms to minimize.
[2024-05-29 17:58:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 160 ms
[2024-05-29 17:58:47] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 0 ms to minimize.
[2024-05-29 17:58:47] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2024-05-29 17:58:47] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 0 ms to minimize.
[2024-05-29 17:58:47] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2024-05-29 17:58:48] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 1 ms to minimize.
[2024-05-29 17:58:48] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 0 ms to minimize.
[2024-05-29 17:58:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1120 ms
[2024-05-29 17:58:48] [INFO ] After 12048ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 398 ms.
[2024-05-29 17:58:49] [INFO ] After 13111ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 271 ms.
Support contains 16 out of 1332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 1332 transition count 1373
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 1 with 159 rules applied. Total rules applied 318 place count 1173 transition count 1373
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 318 place count 1173 transition count 1175
Deduced a syphon composed of 198 places in 2 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 714 place count 975 transition count 1175
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 721 place count 968 transition count 1168
Iterating global reduction 2 with 7 rules applied. Total rules applied 728 place count 968 transition count 1168
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 728 place count 968 transition count 1165
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 734 place count 965 transition count 1165
Performed 394 Post agglomeration using F-continuation condition.Transition count delta: 394
Deduced a syphon composed of 394 places in 11 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 1522 place count 571 transition count 771
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 1601 place count 571 transition count 771
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1602 place count 570 transition count 770
Applied a total of 1602 rules in 386 ms. Remains 570 /1332 variables (removed 762) and now considering 770/1532 (removed 762) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 570/1332 places, 770/1532 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Finished Best-First random walk after 2611 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=326 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 325 stabilizing places and 325 stable transitions
FORMULA ShieldRVs-PT-040B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)))'
Support contains 1 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1331 transition count 1370
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1170 transition count 1370
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1170 transition count 1170
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 970 transition count 1170
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 732 place count 960 transition count 1160
Iterating global reduction 2 with 10 rules applied. Total rules applied 742 place count 960 transition count 1160
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 742 place count 960 transition count 1156
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 750 place count 956 transition count 1156
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1536 place count 563 transition count 763
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1538 place count 561 transition count 761
Applied a total of 1538 rules in 190 ms. Remains 561 /1332 variables (removed 771) and now considering 761/1532 (removed 771) transitions.
// Phase 1: matrix 761 rows 561 cols
[2024-05-29 17:58:50] [INFO ] Computed 161 invariants in 4 ms
[2024-05-29 17:58:51] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-29 17:58:51] [INFO ] Invariant cache hit.
[2024-05-29 17:58:51] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2024-05-29 17:58:51] [INFO ] Redundant transitions in 177 ms returned [760]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 760 rows 561 cols
[2024-05-29 17:58:51] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 17:58:52] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/1332 places, 760/1532 transitions.
Applied a total of 0 rules in 22 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1748 ms. Remains : 561/1332 places, 760/1532 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 139 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s25 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 187 reset in 562 ms.
Product exploration explored 100000 steps with 187 reset in 570 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 492 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 760/760 transitions.
Applied a total of 0 rules in 21 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
[2024-05-29 17:58:53] [INFO ] Invariant cache hit.
[2024-05-29 17:58:54] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-29 17:58:54] [INFO ] Invariant cache hit.
[2024-05-29 17:58:54] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2024-05-29 17:58:54] [INFO ] Redundant transitions in 140 ms returned []
[2024-05-29 17:58:54] [INFO ] Invariant cache hit.
[2024-05-29 17:58:55] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1422 ms. Remains : 561/561 places, 760/760 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 467 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=77 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 187 reset in 450 ms.
Product exploration explored 100000 steps with 187 reset in 540 ms.
Built C files in :
/tmp/ltsmin3124704826679275933
[2024-05-29 17:58:56] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2024-05-29 17:58:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:58:56] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2024-05-29 17:58:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:58:56] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2024-05-29 17:58:56] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:58:56] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3124704826679275933
Running compilation step : cd /tmp/ltsmin3124704826679275933;'/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 2189 ms.
Running link step : cd /tmp/ltsmin3124704826679275933;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin3124704826679275933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15019910198811398507.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 760/760 transitions.
Applied a total of 0 rules in 17 ms. Remains 561 /561 variables (removed 0) and now considering 760/760 (removed 0) transitions.
[2024-05-29 17:59:11] [INFO ] Invariant cache hit.
[2024-05-29 17:59:12] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-29 17:59:12] [INFO ] Invariant cache hit.
[2024-05-29 17:59:12] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2024-05-29 17:59:12] [INFO ] Redundant transitions in 122 ms returned []
[2024-05-29 17:59:12] [INFO ] Invariant cache hit.
[2024-05-29 17:59:13] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1305 ms. Remains : 561/561 places, 760/760 transitions.
Built C files in :
/tmp/ltsmin13868812774107050043
[2024-05-29 17:59:13] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2024-05-29 17:59:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:59:13] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2024-05-29 17:59:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:59:13] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2024-05-29 17:59:13] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 17:59:13] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13868812774107050043
Running compilation step : cd /tmp/ltsmin13868812774107050043;'/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 1926 ms.
Running link step : cd /tmp/ltsmin13868812774107050043;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin13868812774107050043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14758245656290678424.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 17:59:28] [INFO ] Flatten gal took : 34 ms
[2024-05-29 17:59:28] [INFO ] Flatten gal took : 34 ms
[2024-05-29 17:59:28] [INFO ] Time to serialize gal into /tmp/LTL16303907103711895432.gal : 9 ms
[2024-05-29 17:59:28] [INFO ] Time to serialize properties into /tmp/LTL4442384124697280103.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/LTL16303907103711895432.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8909846625723477260.hoa' '-atoms' '/tmp/LTL4442384124697280103.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/LTL4442384124697280103.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8909846625723477260.hoa
Detected timeout of ITS tools.
[2024-05-29 17:59:43] [INFO ] Flatten gal took : 43 ms
[2024-05-29 17:59:43] [INFO ] Flatten gal took : 28 ms
[2024-05-29 17:59:43] [INFO ] Time to serialize gal into /tmp/LTL11132139322866112348.gal : 6 ms
[2024-05-29 17:59:43] [INFO ] Time to serialize properties into /tmp/LTL11459417312637901230.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11132139322866112348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11459417312637901230.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("(p106==0)"))))
Formula 0 simplified : GF!"(p106==0)"
Detected timeout of ITS tools.
[2024-05-29 17:59:58] [INFO ] Flatten gal took : 24 ms
[2024-05-29 17:59:58] [INFO ] Applying decomposition
[2024-05-29 17:59:58] [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/graph9481638241109539485.txt' '-o' '/tmp/graph9481638241109539485.bin' '-w' '/tmp/graph9481638241109539485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9481638241109539485.bin' '-l' '-1' '-v' '-w' '/tmp/graph9481638241109539485.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:59:58] [INFO ] Decomposing Gal with order
[2024-05-29 17:59:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:59:59] [INFO ] Removed a total of 835 redundant transitions.
[2024-05-29 17:59:59] [INFO ] Flatten gal took : 107 ms
[2024-05-29 17:59:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 892 labels/synchronizations in 46 ms.
[2024-05-29 17:59:59] [INFO ] Time to serialize gal into /tmp/LTL13388829550767992397.gal : 7 ms
[2024-05-29 17:59:59] [INFO ] Time to serialize properties into /tmp/LTL13364525221176273242.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/LTL13388829550767992397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13364525221176273242.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 : !((F(G("(i0.i1.u7.p106==0)"))))
Formula 0 simplified : GF!"(i0.i1.u7.p106==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17016504600983942105
[2024-05-29 18:00:14] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17016504600983942105
Running compilation step : cd /tmp/ltsmin17016504600983942105;'/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 1260 ms.
Running link step : cd /tmp/ltsmin17016504600983942105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17016504600983942105;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-040B-LTLFireability-01 finished in 98821 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 4 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1323 transition count 1523
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1323 transition count 1523
Applied a total of 18 rules in 78 ms. Remains 1323 /1332 variables (removed 9) and now considering 1523/1532 (removed 9) transitions.
// Phase 1: matrix 1523 rows 1323 cols
[2024-05-29 18:00:29] [INFO ] Computed 161 invariants in 12 ms
[2024-05-29 18:00:29] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-29 18:00:29] [INFO ] Invariant cache hit.
[2024-05-29 18:00:31] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1661 ms to find 0 implicit places.
[2024-05-29 18:00:31] [INFO ] Invariant cache hit.
[2024-05-29 18:00:31] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1323/1332 places, 1523/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2497 ms. Remains : 1323/1332 places, 1523/1532 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 : ShieldRVs-PT-040B-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:(EQ s55 0), p0:(AND (EQ s982 1) (EQ s985 1) (EQ s992 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 1 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-03 finished in 2657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (p1||X(p1)||G(!p0))))))))'
Support contains 4 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1323 transition count 1523
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1323 transition count 1523
Applied a total of 18 rules in 82 ms. Remains 1323 /1332 variables (removed 9) and now considering 1523/1532 (removed 9) transitions.
// Phase 1: matrix 1523 rows 1323 cols
[2024-05-29 18:00:32] [INFO ] Computed 161 invariants in 15 ms
[2024-05-29 18:00:32] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-29 18:00:32] [INFO ] Invariant cache hit.
[2024-05-29 18:00:33] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 1826 ms to find 0 implicit places.
[2024-05-29 18:00:33] [INFO ] Invariant cache hit.
[2024-05-29 18:00:34] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1323/1332 places, 1523/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2691 ms. Remains : 1323/1332 places, 1523/1532 transitions.
Stuttering acceptance computed with spot in 170 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(AND (EQ s126 1) (EQ s135 1) (EQ s156 1)), p1:(EQ s584 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 59 reset in 523 ms.
Product exploration explored 100000 steps with 58 reset in 547 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 291 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 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 192096 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192096 steps, saw 128412 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 18:00:39] [INFO ] Invariant cache hit.
[2024-05-29 18:00:39] [INFO ] [Real]Absence check using 161 positive place invariants in 54 ms returned sat
[2024-05-29 18:00:39] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 18:00:40] [INFO ] [Nat]Absence check using 161 positive place invariants in 49 ms returned sat
[2024-05-29 18:00:41] [INFO ] After 999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 18:00:41] [INFO ] Deduced a trap composed of 27 places in 352 ms of which 1 ms to minimize.
[2024-05-29 18:00:41] [INFO ] Deduced a trap composed of 30 places in 335 ms of which 1 ms to minimize.
[2024-05-29 18:00:42] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 1 ms to minimize.
[2024-05-29 18:00:42] [INFO ] Deduced a trap composed of 29 places in 353 ms of which 0 ms to minimize.
[2024-05-29 18:00:43] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 1 ms to minimize.
[2024-05-29 18:00:43] [INFO ] Deduced a trap composed of 30 places in 324 ms of which 3 ms to minimize.
[2024-05-29 18:00:43] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 0 ms to minimize.
[2024-05-29 18:00:44] [INFO ] Deduced a trap composed of 31 places in 330 ms of which 1 ms to minimize.
[2024-05-29 18:00:44] [INFO ] Deduced a trap composed of 41 places in 339 ms of which 5 ms to minimize.
[2024-05-29 18:00:45] [INFO ] Deduced a trap composed of 21 places in 327 ms of which 3 ms to minimize.
[2024-05-29 18:00:45] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 1 ms to minimize.
[2024-05-29 18:00:45] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 1 ms to minimize.
[2024-05-29 18:00:46] [INFO ] Deduced a trap composed of 22 places in 319 ms of which 1 ms to minimize.
[2024-05-29 18:00:46] [INFO ] Deduced a trap composed of 43 places in 307 ms of which 0 ms to minimize.
[2024-05-29 18:00:46] [INFO ] Deduced a trap composed of 35 places in 293 ms of which 1 ms to minimize.
[2024-05-29 18:00:47] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 1 ms to minimize.
[2024-05-29 18:00:47] [INFO ] Deduced a trap composed of 39 places in 298 ms of which 0 ms to minimize.
[2024-05-29 18:00:47] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 1 ms to minimize.
[2024-05-29 18:00:48] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 1 ms to minimize.
[2024-05-29 18:00:48] [INFO ] Deduced a trap composed of 35 places in 283 ms of which 1 ms to minimize.
[2024-05-29 18:00:48] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 1 ms to minimize.
[2024-05-29 18:00:49] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 1 ms to minimize.
[2024-05-29 18:00:49] [INFO ] Deduced a trap composed of 33 places in 280 ms of which 2 ms to minimize.
[2024-05-29 18:00:49] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 1 ms to minimize.
[2024-05-29 18:00:50] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 1 ms to minimize.
[2024-05-29 18:00:50] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 1 ms to minimize.
[2024-05-29 18:00:50] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 1 ms to minimize.
[2024-05-29 18:00:51] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 0 ms to minimize.
[2024-05-29 18:00:51] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 1 ms to minimize.
[2024-05-29 18:00:51] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 1 ms to minimize.
[2024-05-29 18:00:52] [INFO ] Deduced a trap composed of 51 places in 237 ms of which 0 ms to minimize.
[2024-05-29 18:00:52] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 1 ms to minimize.
[2024-05-29 18:00:52] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 1 ms to minimize.
[2024-05-29 18:00:52] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 1 ms to minimize.
[2024-05-29 18:00:53] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 1 ms to minimize.
[2024-05-29 18:00:53] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 0 ms to minimize.
[2024-05-29 18:00:53] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 1 ms to minimize.
[2024-05-29 18:00:53] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 1 ms to minimize.
[2024-05-29 18:00:54] [INFO ] Deduced a trap composed of 53 places in 226 ms of which 0 ms to minimize.
[2024-05-29 18:00:54] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 0 ms to minimize.
[2024-05-29 18:00:54] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 0 ms to minimize.
[2024-05-29 18:00:55] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 1 ms to minimize.
[2024-05-29 18:00:55] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 1 ms to minimize.
[2024-05-29 18:00:55] [INFO ] Deduced a trap composed of 42 places in 232 ms of which 0 ms to minimize.
[2024-05-29 18:00:55] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 1 ms to minimize.
[2024-05-29 18:00:56] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 1 ms to minimize.
[2024-05-29 18:00:56] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 0 ms to minimize.
[2024-05-29 18:00:56] [INFO ] Deduced a trap composed of 52 places in 220 ms of which 1 ms to minimize.
[2024-05-29 18:00:56] [INFO ] Deduced a trap composed of 57 places in 203 ms of which 1 ms to minimize.
[2024-05-29 18:00:57] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 0 ms to minimize.
[2024-05-29 18:00:57] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 1 ms to minimize.
[2024-05-29 18:00:57] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 0 ms to minimize.
[2024-05-29 18:00:57] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 1 ms to minimize.
[2024-05-29 18:00:58] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 1 ms to minimize.
[2024-05-29 18:00:58] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 0 ms to minimize.
[2024-05-29 18:00:58] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 0 ms to minimize.
[2024-05-29 18:00:58] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 1 ms to minimize.
[2024-05-29 18:00:58] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 0 ms to minimize.
[2024-05-29 18:00:59] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 0 ms to minimize.
[2024-05-29 18:00:59] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 0 ms to minimize.
[2024-05-29 18:00:59] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 18145 ms
[2024-05-29 18:00:59] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 1 ms to minimize.
[2024-05-29 18:00:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-29 18:00:59] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 0 ms to minimize.
[2024-05-29 18:00:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2024-05-29 18:00:59] [INFO ] After 19756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 162 ms.
[2024-05-29 18:01:00] [INFO ] After 20220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 143 ms.
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1323 transition count 1362
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1162 transition count 1362
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1162 transition count 1162
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 962 transition count 1162
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 1 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1518 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 1599 place count 564 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1600 place count 563 transition count 763
Applied a total of 1600 rules in 129 ms. Remains 563 /1323 variables (removed 760) and now considering 763/1523 (removed 760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 563/1323 places, 763/1523 transitions.
Finished random walk after 2312 steps, including 4 resets, run visited all 3 properties in 23 ms. (steps per millisecond=100 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 194 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Applied a total of 0 rules in 48 ms. Remains 1323 /1323 variables (removed 0) and now considering 1523/1523 (removed 0) transitions.
[2024-05-29 18:01:00] [INFO ] Invariant cache hit.
[2024-05-29 18:01:01] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-29 18:01:01] [INFO ] Invariant cache hit.
[2024-05-29 18:01:02] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
[2024-05-29 18:01:02] [INFO ] Invariant cache hit.
[2024-05-29 18:01:03] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2707 ms. Remains : 1323/1323 places, 1523/1523 transitions.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 188778 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188778 steps, saw 127840 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 18:01:07] [INFO ] Invariant cache hit.
[2024-05-29 18:01:07] [INFO ] [Real]Absence check using 161 positive place invariants in 65 ms returned sat
[2024-05-29 18:01:07] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 18:01:07] [INFO ] [Nat]Absence check using 161 positive place invariants in 54 ms returned sat
[2024-05-29 18:01:08] [INFO ] After 1030ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 18:01:09] [INFO ] Deduced a trap composed of 27 places in 330 ms of which 0 ms to minimize.
[2024-05-29 18:01:09] [INFO ] Deduced a trap composed of 30 places in 329 ms of which 1 ms to minimize.
[2024-05-29 18:01:09] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 1 ms to minimize.
[2024-05-29 18:01:10] [INFO ] Deduced a trap composed of 29 places in 323 ms of which 1 ms to minimize.
[2024-05-29 18:01:10] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 1 ms to minimize.
[2024-05-29 18:01:11] [INFO ] Deduced a trap composed of 30 places in 318 ms of which 1 ms to minimize.
[2024-05-29 18:01:11] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 1 ms to minimize.
[2024-05-29 18:01:11] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 0 ms to minimize.
[2024-05-29 18:01:12] [INFO ] Deduced a trap composed of 41 places in 307 ms of which 1 ms to minimize.
[2024-05-29 18:01:12] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 1 ms to minimize.
[2024-05-29 18:01:12] [INFO ] Deduced a trap composed of 29 places in 311 ms of which 0 ms to minimize.
[2024-05-29 18:01:13] [INFO ] Deduced a trap composed of 27 places in 299 ms of which 2 ms to minimize.
[2024-05-29 18:01:13] [INFO ] Deduced a trap composed of 22 places in 303 ms of which 1 ms to minimize.
[2024-05-29 18:01:13] [INFO ] Deduced a trap composed of 43 places in 307 ms of which 1 ms to minimize.
[2024-05-29 18:01:14] [INFO ] Deduced a trap composed of 35 places in 286 ms of which 1 ms to minimize.
[2024-05-29 18:01:14] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 0 ms to minimize.
[2024-05-29 18:01:14] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 1 ms to minimize.
[2024-05-29 18:01:15] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 0 ms to minimize.
[2024-05-29 18:01:15] [INFO ] Deduced a trap composed of 42 places in 283 ms of which 0 ms to minimize.
[2024-05-29 18:01:15] [INFO ] Deduced a trap composed of 35 places in 281 ms of which 1 ms to minimize.
[2024-05-29 18:01:16] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 0 ms to minimize.
[2024-05-29 18:01:16] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 1 ms to minimize.
[2024-05-29 18:01:16] [INFO ] Deduced a trap composed of 33 places in 285 ms of which 0 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 43 places in 285 ms of which 1 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 1 ms to minimize.
[2024-05-29 18:01:17] [INFO ] Deduced a trap composed of 28 places in 291 ms of which 0 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 34 places in 275 ms of which 1 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 38 places in 278 ms of which 1 ms to minimize.
[2024-05-29 18:01:18] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 1 ms to minimize.
[2024-05-29 18:01:19] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 1 ms to minimize.
[2024-05-29 18:01:19] [INFO ] Deduced a trap composed of 51 places in 236 ms of which 0 ms to minimize.
[2024-05-29 18:01:19] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 1 ms to minimize.
[2024-05-29 18:01:20] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 2 ms to minimize.
[2024-05-29 18:01:20] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 1 ms to minimize.
[2024-05-29 18:01:20] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 0 ms to minimize.
[2024-05-29 18:01:20] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 1 ms to minimize.
[2024-05-29 18:01:21] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 0 ms to minimize.
[2024-05-29 18:01:21] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 1 ms to minimize.
[2024-05-29 18:01:21] [INFO ] Deduced a trap composed of 53 places in 227 ms of which 1 ms to minimize.
[2024-05-29 18:01:22] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 1 ms to minimize.
[2024-05-29 18:01:22] [INFO ] Deduced a trap composed of 36 places in 238 ms of which 1 ms to minimize.
[2024-05-29 18:01:22] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 1 ms to minimize.
[2024-05-29 18:01:22] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 0 ms to minimize.
[2024-05-29 18:01:23] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 1 ms to minimize.
[2024-05-29 18:01:23] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 1 ms to minimize.
[2024-05-29 18:01:23] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 1 ms to minimize.
[2024-05-29 18:01:23] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 1 ms to minimize.
[2024-05-29 18:01:24] [INFO ] Deduced a trap composed of 52 places in 212 ms of which 0 ms to minimize.
[2024-05-29 18:01:24] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 1 ms to minimize.
[2024-05-29 18:01:24] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 1 ms to minimize.
[2024-05-29 18:01:25] [INFO ] Deduced a trap composed of 55 places in 204 ms of which 1 ms to minimize.
[2024-05-29 18:01:25] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 0 ms to minimize.
[2024-05-29 18:01:25] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 1 ms to minimize.
[2024-05-29 18:01:25] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 0 ms to minimize.
[2024-05-29 18:01:25] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 1 ms to minimize.
[2024-05-29 18:01:26] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 0 ms to minimize.
[2024-05-29 18:01:26] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 1 ms to minimize.
[2024-05-29 18:01:26] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 0 ms to minimize.
[2024-05-29 18:01:26] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 1 ms to minimize.
[2024-05-29 18:01:26] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 1 ms to minimize.
[2024-05-29 18:01:26] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 18173 ms
[2024-05-29 18:01:27] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 0 ms to minimize.
[2024-05-29 18:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2024-05-29 18:01:27] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 0 ms to minimize.
[2024-05-29 18:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-05-29 18:01:27] [INFO ] After 19834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 192 ms.
[2024-05-29 18:01:27] [INFO ] After 20354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 79 ms.
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1323 transition count 1362
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1162 transition count 1362
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1162 transition count 1162
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 962 transition count 1162
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 1 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1518 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 1599 place count 564 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1600 place count 563 transition count 763
Applied a total of 1600 rules in 133 ms. Remains 563 /1323 variables (removed 760) and now considering 763/1523 (removed 760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 563/1323 places, 763/1523 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished Best-First random walk after 6607 steps, including 1 resets, run visited all 2 properties in 23 ms. (steps per millisecond=287 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 162 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 59 reset in 479 ms.
Product exploration explored 100000 steps with 60 reset in 537 ms.
Built C files in :
/tmp/ltsmin8432416374280888300
[2024-05-29 18:01:30] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8432416374280888300
Running compilation step : cd /tmp/ltsmin8432416374280888300;'/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 2707 ms.
Running link step : cd /tmp/ltsmin8432416374280888300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8432416374280888300;'/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/stateBased6215123605634877986.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Applied a total of 0 rules in 35 ms. Remains 1323 /1323 variables (removed 0) and now considering 1523/1523 (removed 0) transitions.
[2024-05-29 18:01:45] [INFO ] Invariant cache hit.
[2024-05-29 18:01:45] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-29 18:01:45] [INFO ] Invariant cache hit.
[2024-05-29 18:01:46] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
[2024-05-29 18:01:46] [INFO ] Invariant cache hit.
[2024-05-29 18:01:47] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2609 ms. Remains : 1323/1323 places, 1523/1523 transitions.
Built C files in :
/tmp/ltsmin5254328074513387703
[2024-05-29 18:01:47] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5254328074513387703
Running compilation step : cd /tmp/ltsmin5254328074513387703;'/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 2672 ms.
Running link step : cd /tmp/ltsmin5254328074513387703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5254328074513387703;'/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/stateBased7261977148279717859.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:02:02] [INFO ] Flatten gal took : 43 ms
[2024-05-29 18:02:02] [INFO ] Flatten gal took : 42 ms
[2024-05-29 18:02:02] [INFO ] Time to serialize gal into /tmp/LTL15906331074759743652.gal : 8 ms
[2024-05-29 18:02:02] [INFO ] Time to serialize properties into /tmp/LTL5664957561394565807.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/LTL15906331074759743652.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4112935331542273615.hoa' '-atoms' '/tmp/LTL5664957561394565807.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/LTL5664957561394565807.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4112935331542273615.hoa
Detected timeout of ITS tools.
[2024-05-29 18:02:18] [INFO ] Flatten gal took : 40 ms
[2024-05-29 18:02:18] [INFO ] Flatten gal took : 45 ms
[2024-05-29 18:02:18] [INFO ] Time to serialize gal into /tmp/LTL13139339323851581680.gal : 8 ms
[2024-05-29 18:02:18] [INFO ] Time to serialize properties into /tmp/LTL5467126822852777478.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/LTL13139339323851581680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5467126822852777478.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("(((p143==1)&&(p154==1))&&(p180==1))"))U((("(p701==1)")||(X("(p701==1)")))||(G(!("(((p143==1)&&(p154==1))&&(p180==1))")))...203
Formula 0 simplified : FG(!"(((p143!=1)||(p154!=1))||(p180!=1))" | X("(((p143==1)&&(p154==1))&&(p180==1))" M (!"(p701==1)" & X!"(p701==1)")))
Detected timeout of ITS tools.
[2024-05-29 18:02:33] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:02:33] [INFO ] Applying decomposition
[2024-05-29 18:02:33] [INFO ] Flatten gal took : 39 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/graph5925585755585314128.txt' '-o' '/tmp/graph5925585755585314128.bin' '-w' '/tmp/graph5925585755585314128.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5925585755585314128.bin' '-l' '-1' '-v' '-w' '/tmp/graph5925585755585314128.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:02:33] [INFO ] Decomposing Gal with order
[2024-05-29 18:02:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:02:33] [INFO ] Removed a total of 1431 redundant transitions.
[2024-05-29 18:02:33] [INFO ] Flatten gal took : 133 ms
[2024-05-29 18:02:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-29 18:02:33] [INFO ] Time to serialize gal into /tmp/LTL11366306879096697248.gal : 15 ms
[2024-05-29 18:02:33] [INFO ] Time to serialize properties into /tmp/LTL5820454967546984536.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/LTL11366306879096697248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5820454967546984536.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("(((i1.u50.p143==1)&&(i1.u53.p154==1))&&(i1.u62.p180==1))"))U((("(i8.i0.i0.u221.p701==1)")||(X("(i8.i0.i0.u221.p701==1)")...294
Formula 0 simplified : FG(!"(((i1.u50.p143!=1)||(i1.u53.p154!=1))||(i1.u62.p180!=1))" | X("(((i1.u50.p143==1)&&(i1.u53.p154==1))&&(i1.u62.p180==1))" M (!"(...211
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3245716154065873596
[2024-05-29 18:02:48] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3245716154065873596
Running compilation step : cd /tmp/ltsmin3245716154065873596;'/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 2673 ms.
Running link step : cd /tmp/ltsmin3245716154065873596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3245716154065873596;'/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((!(LTLAPp0==true) U ((LTLAPp1==true)||X((LTLAPp1==true))||[](!(LTLAPp0==true)))))&&!(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-040B-LTLFireability-05 finished in 151808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 1331 transition count 1371
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 320 place count 1171 transition count 1371
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 320 place count 1171 transition count 1172
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 718 place count 972 transition count 1172
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 727 place count 963 transition count 1163
Iterating global reduction 2 with 9 rules applied. Total rules applied 736 place count 963 transition count 1163
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 736 place count 963 transition count 1159
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 744 place count 959 transition count 1159
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 0 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1530 place count 566 transition count 766
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1532 place count 564 transition count 764
Applied a total of 1532 rules in 140 ms. Remains 564 /1332 variables (removed 768) and now considering 764/1532 (removed 768) transitions.
// Phase 1: matrix 764 rows 564 cols
[2024-05-29 18:03:03] [INFO ] Computed 161 invariants in 4 ms
[2024-05-29 18:03:04] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-29 18:03:04] [INFO ] Invariant cache hit.
[2024-05-29 18:03:04] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2024-05-29 18:03:04] [INFO ] Redundant transitions in 169 ms returned [763]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 763 rows 564 cols
[2024-05-29 18:03:04] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 18:03:05] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 564/1332 places, 763/1532 transitions.
Applied a total of 0 rules in 18 ms. Remains 564 /564 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1540 ms. Remains : 564/1332 places, 763/1532 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s297 1) (NEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 184 reset in 462 ms.
Product exploration explored 100000 steps with 185 reset in 540 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Finished Best-First random walk after 5898 steps, including 1 resets, run visited all 1 properties in 17 ms. (steps per millisecond=346 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 763/763 transitions.
Applied a total of 0 rules in 16 ms. Remains 564 /564 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2024-05-29 18:03:06] [INFO ] Invariant cache hit.
[2024-05-29 18:03:07] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-29 18:03:07] [INFO ] Invariant cache hit.
[2024-05-29 18:03:07] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
[2024-05-29 18:03:07] [INFO ] Redundant transitions in 158 ms returned []
[2024-05-29 18:03:07] [INFO ] Invariant cache hit.
[2024-05-29 18:03:08] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1382 ms. Remains : 564/564 places, 763/763 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished probabilistic random walk after 216888 steps, run visited all 1 properties in 1410 ms. (steps per millisecond=153 )
Probabilistic random walk after 216888 steps, saw 210040 distinct states, run finished after 1410 ms. (steps per millisecond=153 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 184 reset in 509 ms.
Product exploration explored 100000 steps with 184 reset in 542 ms.
Built C files in :
/tmp/ltsmin16266460781129223133
[2024-05-29 18:03:11] [INFO ] Computing symmetric may disable matrix : 763 transitions.
[2024-05-29 18:03:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:03:11] [INFO ] Computing symmetric may enable matrix : 763 transitions.
[2024-05-29 18:03:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:03:11] [INFO ] Computing Do-Not-Accords matrix : 763 transitions.
[2024-05-29 18:03:11] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:03:11] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16266460781129223133
Running compilation step : cd /tmp/ltsmin16266460781129223133;'/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 1946 ms.
Running link step : cd /tmp/ltsmin16266460781129223133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin16266460781129223133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8984928856293423847.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 763/763 transitions.
Applied a total of 0 rules in 18 ms. Remains 564 /564 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2024-05-29 18:03:26] [INFO ] Invariant cache hit.
[2024-05-29 18:03:26] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-29 18:03:26] [INFO ] Invariant cache hit.
[2024-05-29 18:03:27] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2024-05-29 18:03:27] [INFO ] Redundant transitions in 135 ms returned []
[2024-05-29 18:03:27] [INFO ] Invariant cache hit.
[2024-05-29 18:03:27] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1314 ms. Remains : 564/564 places, 763/763 transitions.
Built C files in :
/tmp/ltsmin17929763519850934815
[2024-05-29 18:03:27] [INFO ] Computing symmetric may disable matrix : 763 transitions.
[2024-05-29 18:03:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:03:27] [INFO ] Computing symmetric may enable matrix : 763 transitions.
[2024-05-29 18:03:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:03:27] [INFO ] Computing Do-Not-Accords matrix : 763 transitions.
[2024-05-29 18:03:27] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:03:27] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17929763519850934815
Running compilation step : cd /tmp/ltsmin17929763519850934815;'/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 1924 ms.
Running link step : cd /tmp/ltsmin17929763519850934815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17929763519850934815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14439939932989137054.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:03:42] [INFO ] Flatten gal took : 22 ms
[2024-05-29 18:03:42] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:03:42] [INFO ] Time to serialize gal into /tmp/LTL11668011331247297857.gal : 4 ms
[2024-05-29 18:03:42] [INFO ] Time to serialize properties into /tmp/LTL16581460063317527782.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/LTL11668011331247297857.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13575261412581681737.hoa' '-atoms' '/tmp/LTL16581460063317527782.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...320
Loading property file /tmp/LTL16581460063317527782.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13575261412581681737.hoa
Detected timeout of ITS tools.
[2024-05-29 18:03:57] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:03:57] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:03:57] [INFO ] Time to serialize gal into /tmp/LTL2696967569099902427.gal : 4 ms
[2024-05-29 18:03:57] [INFO ] Time to serialize properties into /tmp/LTL8797464323254763516.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/LTL2696967569099902427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8797464323254763516.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 : !((G(F("((p857!=1)||(p264!=1))"))))
Formula 0 simplified : FG!"((p857!=1)||(p264!=1))"
Detected timeout of ITS tools.
[2024-05-29 18:04:12] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:04:12] [INFO ] Applying decomposition
[2024-05-29 18:04:13] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8239242438290254894.txt' '-o' '/tmp/graph8239242438290254894.bin' '-w' '/tmp/graph8239242438290254894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8239242438290254894.bin' '-l' '-1' '-v' '-w' '/tmp/graph8239242438290254894.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:04:13] [INFO ] Decomposing Gal with order
[2024-05-29 18:04:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:04:13] [INFO ] Removed a total of 841 redundant transitions.
[2024-05-29 18:04:13] [INFO ] Flatten gal took : 39 ms
[2024-05-29 18:04:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 892 labels/synchronizations in 16 ms.
[2024-05-29 18:04:13] [INFO ] Time to serialize gal into /tmp/LTL7386111335300750839.gal : 5 ms
[2024-05-29 18:04:13] [INFO ] Time to serialize properties into /tmp/LTL4922226606945908381.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/LTL7386111335300750839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4922226606945908381.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i8.i0.u85.p857!=1)||(i1.i1.u24.p264!=1))"))))
Formula 0 simplified : FG!"((i8.i0.u85.p857!=1)||(i1.i1.u24.p264!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6697963952688014129
[2024-05-29 18:04:28] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6697963952688014129
Running compilation step : cd /tmp/ltsmin6697963952688014129;'/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 1253 ms.
Running link step : cd /tmp/ltsmin6697963952688014129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6697963952688014129;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-040B-LTLFireability-06 finished in 99570 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((X(p0)&&(p0||F(p1)||G(p2)))))'
Support contains 7 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1323 transition count 1523
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1323 transition count 1523
Applied a total of 18 rules in 80 ms. Remains 1323 /1332 variables (removed 9) and now considering 1523/1532 (removed 9) transitions.
// Phase 1: matrix 1523 rows 1323 cols
[2024-05-29 18:04:43] [INFO ] Computed 161 invariants in 8 ms
[2024-05-29 18:04:43] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-29 18:04:43] [INFO ] Invariant cache hit.
[2024-05-29 18:04:45] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2024-05-29 18:04:45] [INFO ] Invariant cache hit.
[2024-05-29 18:04:45] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1323/1332 places, 1523/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2501 ms. Remains : 1323/1332 places, 1523/1532 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(OR p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s223 1), p1:(OR (EQ s370 0) (EQ s406 0) (EQ s426 0)), p2:(OR (EQ s1045 0) (EQ s1049 0) (EQ s1056 0))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-08 finished in 2686 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((p0&&F((G(p1)||(p2 U p3))))))'
Support contains 3 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1323 transition count 1523
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1323 transition count 1523
Applied a total of 18 rules in 74 ms. Remains 1323 /1332 variables (removed 9) and now considering 1523/1532 (removed 9) transitions.
// Phase 1: matrix 1523 rows 1323 cols
[2024-05-29 18:04:46] [INFO ] Computed 161 invariants in 8 ms
[2024-05-29 18:04:46] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-29 18:04:46] [INFO ] Invariant cache hit.
[2024-05-29 18:04:48] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
[2024-05-29 18:04:48] [INFO ] Invariant cache hit.
[2024-05-29 18:04:48] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1323/1332 places, 1523/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2716 ms. Remains : 1323/1332 places, 1523/1532 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s70 0), p3:(EQ s725 1), p1:(EQ s642 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 64 reset in 478 ms.
Product exploration explored 100000 steps with 65 reset in 534 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) p1), (X (AND p0 (NOT p3))), (X p0), true, (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 96 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 18:04:50] [INFO ] Invariant cache hit.
[2024-05-29 18:04:50] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:04:50] [INFO ] [Nat]Absence check using 161 positive place invariants in 52 ms returned sat
[2024-05-29 18:04:51] [INFO ] After 627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:04:51] [INFO ] Deduced a trap composed of 21 places in 303 ms of which 1 ms to minimize.
[2024-05-29 18:04:52] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 1 ms to minimize.
[2024-05-29 18:04:52] [INFO ] Deduced a trap composed of 34 places in 296 ms of which 1 ms to minimize.
[2024-05-29 18:04:52] [INFO ] Deduced a trap composed of 30 places in 302 ms of which 0 ms to minimize.
[2024-05-29 18:04:53] [INFO ] Deduced a trap composed of 37 places in 302 ms of which 1 ms to minimize.
[2024-05-29 18:04:53] [INFO ] Deduced a trap composed of 35 places in 285 ms of which 0 ms to minimize.
[2024-05-29 18:04:53] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 2 ms to minimize.
[2024-05-29 18:04:54] [INFO ] Deduced a trap composed of 22 places in 294 ms of which 1 ms to minimize.
[2024-05-29 18:04:54] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 0 ms to minimize.
[2024-05-29 18:04:54] [INFO ] Deduced a trap composed of 43 places in 258 ms of which 0 ms to minimize.
[2024-05-29 18:04:54] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 1 ms to minimize.
[2024-05-29 18:04:55] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 0 ms to minimize.
[2024-05-29 18:04:55] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 1 ms to minimize.
[2024-05-29 18:04:55] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 0 ms to minimize.
[2024-05-29 18:04:56] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 1 ms to minimize.
[2024-05-29 18:04:56] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 1 ms to minimize.
[2024-05-29 18:04:56] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 1 ms to minimize.
[2024-05-29 18:04:57] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 0 ms to minimize.
[2024-05-29 18:04:57] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 1 ms to minimize.
[2024-05-29 18:04:57] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 0 ms to minimize.
[2024-05-29 18:04:57] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 1 ms to minimize.
[2024-05-29 18:04:58] [INFO ] Deduced a trap composed of 61 places in 243 ms of which 0 ms to minimize.
[2024-05-29 18:04:58] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 1 ms to minimize.
[2024-05-29 18:04:58] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 1 ms to minimize.
[2024-05-29 18:04:59] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 1 ms to minimize.
[2024-05-29 18:04:59] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 1 ms to minimize.
[2024-05-29 18:04:59] [INFO ] Deduced a trap composed of 28 places in 229 ms of which 1 ms to minimize.
[2024-05-29 18:04:59] [INFO ] Deduced a trap composed of 40 places in 224 ms of which 1 ms to minimize.
[2024-05-29 18:05:00] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 1 ms to minimize.
[2024-05-29 18:05:00] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 0 ms to minimize.
[2024-05-29 18:05:00] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 1 ms to minimize.
[2024-05-29 18:05:01] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 1 ms to minimize.
[2024-05-29 18:05:01] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 1 ms to minimize.
[2024-05-29 18:05:01] [INFO ] Deduced a trap composed of 54 places in 210 ms of which 1 ms to minimize.
[2024-05-29 18:05:01] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 0 ms to minimize.
[2024-05-29 18:05:02] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 0 ms to minimize.
[2024-05-29 18:05:02] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 1 ms to minimize.
[2024-05-29 18:05:02] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 0 ms to minimize.
[2024-05-29 18:05:02] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 0 ms to minimize.
[2024-05-29 18:05:03] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 1 ms to minimize.
[2024-05-29 18:05:03] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 1 ms to minimize.
[2024-05-29 18:05:03] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 1 ms to minimize.
[2024-05-29 18:05:03] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 1 ms to minimize.
[2024-05-29 18:05:03] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:05:04] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 0 ms to minimize.
[2024-05-29 18:05:04] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 1 ms to minimize.
[2024-05-29 18:05:04] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2024-05-29 18:05:04] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 0 ms to minimize.
[2024-05-29 18:05:04] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2024-05-29 18:05:05] [INFO ] Deduced a trap composed of 68 places in 142 ms of which 3 ms to minimize.
[2024-05-29 18:05:05] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 0 ms to minimize.
[2024-05-29 18:05:05] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 0 ms to minimize.
[2024-05-29 18:05:05] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 1 ms to minimize.
[2024-05-29 18:05:05] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
[2024-05-29 18:05:05] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 1 ms to minimize.
[2024-05-29 18:05:06] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2024-05-29 18:05:06] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 0 ms to minimize.
[2024-05-29 18:05:06] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
[2024-05-29 18:05:06] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 0 ms to minimize.
[2024-05-29 18:05:06] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 1 ms to minimize.
[2024-05-29 18:05:06] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 0 ms to minimize.
[2024-05-29 18:05:07] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 0 ms to minimize.
[2024-05-29 18:05:07] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 0 ms to minimize.
[2024-05-29 18:05:07] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 1 ms to minimize.
[2024-05-29 18:05:07] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 0 ms to minimize.
[2024-05-29 18:05:07] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 1 ms to minimize.
[2024-05-29 18:05:07] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 0 ms to minimize.
[2024-05-29 18:05:08] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 1 ms to minimize.
[2024-05-29 18:05:08] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 1 ms to minimize.
[2024-05-29 18:05:08] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-29 18:05:08] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 0 ms to minimize.
[2024-05-29 18:05:08] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 0 ms to minimize.
[2024-05-29 18:05:08] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 0 ms to minimize.
[2024-05-29 18:05:09] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 0 ms to minimize.
[2024-05-29 18:05:09] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 1 ms to minimize.
[2024-05-29 18:05:09] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2024-05-29 18:05:09] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 18053 ms
[2024-05-29 18:05:09] [INFO ] After 18745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-29 18:05:09] [INFO ] After 19032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 1323 transition count 1363
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 320 place count 1163 transition count 1363
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 320 place count 1163 transition count 1164
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 718 place count 964 transition count 1164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 719 place count 963 transition count 1163
Iterating global reduction 2 with 1 rules applied. Total rules applied 720 place count 963 transition count 1163
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 399
Deduced a syphon composed of 399 places in 0 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1518 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 2 with 82 rules applied. Total rules applied 1600 place count 564 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1601 place count 563 transition count 763
Applied a total of 1601 rules in 148 ms. Remains 563 /1323 variables (removed 760) and now considering 763/1523 (removed 760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 563/1323 places, 763/1523 transitions.
Finished random walk after 4640 steps, including 9 resets, run visited all 1 properties in 31 ms. (steps per millisecond=149 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p3) p1), (X (AND p0 (NOT p3))), (X p0), true, (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p3) (NOT p1))), (F (AND p3 (NOT p1))), (F (NOT (AND (NOT p3) p1))), (F (AND p3 p1))]
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), false, false]
Support contains 2 out of 1323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 1523/1523 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 1322 transition count 1362
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 320 place count 1162 transition count 1362
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 320 place count 1162 transition count 1163
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 718 place count 963 transition count 1163
Performed 397 Post agglomeration using F-continuation condition.Transition count delta: 397
Deduced a syphon composed of 397 places in 1 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 2 with 794 rules applied. Total rules applied 1512 place count 566 transition count 766
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1514 place count 564 transition count 764
Applied a total of 1514 rules in 115 ms. Remains 564 /1323 variables (removed 759) and now considering 764/1523 (removed 759) transitions.
// Phase 1: matrix 764 rows 564 cols
[2024-05-29 18:05:10] [INFO ] Computed 161 invariants in 6 ms
[2024-05-29 18:05:10] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-29 18:05:10] [INFO ] Invariant cache hit.
[2024-05-29 18:05:11] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2024-05-29 18:05:11] [INFO ] Redundant transitions in 160 ms returned [763]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 763 rows 564 cols
[2024-05-29 18:05:11] [INFO ] Computed 161 invariants in 2 ms
[2024-05-29 18:05:11] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 564/1323 places, 763/1523 transitions.
Applied a total of 0 rules in 14 ms. Remains 564 /564 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1470 ms. Remains : 564/1323 places, 763/1523 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 p3) p1), (X (NOT (AND p3 p1))), (X (NOT (AND p3 (NOT p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p3 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) p1))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1))))]
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), false, false]
Finished random walk after 1925 steps, including 3 resets, run visited all 4 properties in 39 ms. (steps per millisecond=49 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p3) p1), (X (NOT (AND p3 p1))), (X (NOT (AND p3 (NOT p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p3 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) p1))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) p3)), (F (NOT (AND p1 (NOT p3)))), (F (AND p1 p3))]
Knowledge based reduction with 5 factoid took 365 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), false, false]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), false, false]
Product exploration explored 100000 steps with 222 reset in 458 ms.
Product exploration explored 100000 steps with 219 reset in 554 ms.
Built C files in :
/tmp/ltsmin4161641272987444279
[2024-05-29 18:05:13] [INFO ] Computing symmetric may disable matrix : 763 transitions.
[2024-05-29 18:05:13] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:05:13] [INFO ] Computing symmetric may enable matrix : 763 transitions.
[2024-05-29 18:05:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:05:14] [INFO ] Computing Do-Not-Accords matrix : 763 transitions.
[2024-05-29 18:05:14] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:05:14] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4161641272987444279
Running compilation step : cd /tmp/ltsmin4161641272987444279;'/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 1962 ms.
Running link step : cd /tmp/ltsmin4161641272987444279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4161641272987444279;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12579683720498797943.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 563 transition count 762
Applied a total of 2 rules in 24 ms. Remains 563 /564 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 563 cols
[2024-05-29 18:05:28] [INFO ] Computed 161 invariants in 4 ms
[2024-05-29 18:05:29] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-29 18:05:29] [INFO ] Invariant cache hit.
[2024-05-29 18:05:29] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2024-05-29 18:05:29] [INFO ] Redundant transitions in 143 ms returned []
[2024-05-29 18:05:29] [INFO ] Invariant cache hit.
[2024-05-29 18:05:30] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 563/564 places, 762/763 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1319 ms. Remains : 563/564 places, 762/763 transitions.
Built C files in :
/tmp/ltsmin7136667326869978277
[2024-05-29 18:05:30] [INFO ] Computing symmetric may disable matrix : 762 transitions.
[2024-05-29 18:05:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:05:30] [INFO ] Computing symmetric may enable matrix : 762 transitions.
[2024-05-29 18:05:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:05:30] [INFO ] Computing Do-Not-Accords matrix : 762 transitions.
[2024-05-29 18:05:30] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:05:30] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7136667326869978277
Running compilation step : cd /tmp/ltsmin7136667326869978277;'/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 1928 ms.
Running link step : cd /tmp/ltsmin7136667326869978277;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7136667326869978277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased649536124360709977.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:05:45] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:05:45] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:05:45] [INFO ] Time to serialize gal into /tmp/LTL6772154391547531359.gal : 4 ms
[2024-05-29 18:05:45] [INFO ] Time to serialize properties into /tmp/LTL9174123133273485733.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/LTL6772154391547531359.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2268487483780435533.hoa' '-atoms' '/tmp/LTL9174123133273485733.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/LTL9174123133273485733.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2268487483780435533.hoa
Detected timeout of ITS tools.
[2024-05-29 18:06:00] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:06:00] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:06:00] [INFO ] Time to serialize gal into /tmp/LTL11936983429681955553.gal : 5 ms
[2024-05-29 18:06:00] [INFO ] Time to serialize properties into /tmp/LTL6225035068997179309.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/LTL11936983429681955553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6225035068997179309.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("(p75==0)")&&(F((G("(p771==0)"))||(("(p75==1)")U("(p872==1)")))))))
Formula 0 simplified : X(!"(p75==0)" | G(F!"(p771==0)" & (!"(p75==1)" R !"(p872==1)")))
Detected timeout of ITS tools.
[2024-05-29 18:06:15] [INFO ] Flatten gal took : 23 ms
[2024-05-29 18:06:15] [INFO ] Applying decomposition
[2024-05-29 18:06:15] [INFO ] Flatten gal took : 20 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/graph7442499614684058537.txt' '-o' '/tmp/graph7442499614684058537.bin' '-w' '/tmp/graph7442499614684058537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7442499614684058537.bin' '-l' '-1' '-v' '-w' '/tmp/graph7442499614684058537.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:06:15] [INFO ] Decomposing Gal with order
[2024-05-29 18:06:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:06:15] [INFO ] Removed a total of 841 redundant transitions.
[2024-05-29 18:06:15] [INFO ] Flatten gal took : 36 ms
[2024-05-29 18:06:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 850 labels/synchronizations in 10 ms.
[2024-05-29 18:06:15] [INFO ] Time to serialize gal into /tmp/LTL2873290187851328053.gal : 5 ms
[2024-05-29 18:06:15] [INFO ] Time to serialize properties into /tmp/LTL15419573817626087952.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/LTL2873290187851328053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15419573817626087952.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 : !((X(("(i0.u4.p75==0)")&&(F((G("(i8.i0.u76.p771==0)"))||(("(i0.u4.p75==1)")U("(i9.i0.u86.p872==1)")))))))
Formula 0 simplified : X(!"(i0.u4.p75==0)" | G(F!"(i8.i0.u76.p771==0)" & (!"(i0.u4.p75==1)" R !"(i9.i0.u86.p872==1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10357490641019754929
[2024-05-29 18:06:30] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10357490641019754929
Running compilation step : cd /tmp/ltsmin10357490641019754929;'/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 1252 ms.
Running link step : cd /tmp/ltsmin10357490641019754929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10357490641019754929;'/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(((LTLAPp0==true)&&<>(([]((LTLAPp1==true))||((LTLAPp2==true) U (LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-040B-LTLFireability-09 finished in 119919 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((p0 U (p1&&(p2 U G(p3))))))'
Support contains 6 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1325 transition count 1525
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1325 transition count 1525
Applied a total of 14 rules in 70 ms. Remains 1325 /1332 variables (removed 7) and now considering 1525/1532 (removed 7) transitions.
// Phase 1: matrix 1525 rows 1325 cols
[2024-05-29 18:06:46] [INFO ] Computed 161 invariants in 10 ms
[2024-05-29 18:06:46] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-29 18:06:46] [INFO ] Invariant cache hit.
[2024-05-29 18:06:47] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
[2024-05-29 18:06:47] [INFO ] Invariant cache hit.
[2024-05-29 18:06:48] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1325/1332 places, 1525/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2540 ms. Remains : 1325/1332 places, 1525/1532 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND p1 p3 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p3 p2 p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0} source=1 dest: 5}, { cond=(AND p1 p3 (NOT p2) p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p3 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p3 p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=5 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=6 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=6 dest: 2}, { cond=(OR (AND (NOT p1) p3 (NOT p0)) (AND p3 (NOT p2) (NOT p0))), acceptance={} source=6 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p3 p2 p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0} source=6 dest: 5}, { cond=(OR (AND (NOT p1) p3 p0) (AND p3 (NOT p2) p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s465 1), p0:(EQ s626 1), p3:(AND (EQ s314 1) (EQ s325 1)), p2:(AND (EQ s291 1) (EQ s1220 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-10 finished in 2828 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((X(p0)||(G(F(p2))&&p1))))'
Support contains 6 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1322 transition count 1522
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1322 transition count 1522
Applied a total of 20 rules in 83 ms. Remains 1322 /1332 variables (removed 10) and now considering 1522/1532 (removed 10) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2024-05-29 18:06:48] [INFO ] Computed 161 invariants in 6 ms
[2024-05-29 18:06:49] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-29 18:06:49] [INFO ] Invariant cache hit.
[2024-05-29 18:06:50] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
[2024-05-29 18:06:50] [INFO ] Invariant cache hit.
[2024-05-29 18:06:51] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1322/1332 places, 1522/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2624 ms. Remains : 1322/1332 places, 1522/1532 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1309 1) (EQ s1318 1)), p2:(AND (EQ s286 1) (EQ s295 1) (EQ s316 1)), p0:(EQ s799 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 116 reset in 420 ms.
Product exploration explored 100000 steps with 115 reset in 475 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 111 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 362 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 18:06:53] [INFO ] Invariant cache hit.
[2024-05-29 18:06:53] [INFO ] [Real]Absence check using 161 positive place invariants in 58 ms returned sat
[2024-05-29 18:06:54] [INFO ] After 1070ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 18:06:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 57 ms returned sat
[2024-05-29 18:06:55] [INFO ] After 879ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 18:06:55] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 1 ms to minimize.
[2024-05-29 18:06:56] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 1 ms to minimize.
[2024-05-29 18:06:56] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 0 ms to minimize.
[2024-05-29 18:06:56] [INFO ] Deduced a trap composed of 51 places in 215 ms of which 0 ms to minimize.
[2024-05-29 18:06:56] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 1 ms to minimize.
[2024-05-29 18:06:57] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 1 ms to minimize.
[2024-05-29 18:06:57] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 2 ms to minimize.
[2024-05-29 18:06:57] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 2 ms to minimize.
[2024-05-29 18:06:57] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 0 ms to minimize.
[2024-05-29 18:06:58] [INFO ] Deduced a trap composed of 35 places in 209 ms of which 0 ms to minimize.
[2024-05-29 18:06:58] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 1 ms to minimize.
[2024-05-29 18:06:58] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 0 ms to minimize.
[2024-05-29 18:06:58] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 0 ms to minimize.
[2024-05-29 18:06:59] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 0 ms to minimize.
[2024-05-29 18:06:59] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 1 ms to minimize.
[2024-05-29 18:06:59] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 1 ms to minimize.
[2024-05-29 18:06:59] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 0 ms to minimize.
[2024-05-29 18:07:00] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 1 ms to minimize.
[2024-05-29 18:07:00] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 1 ms to minimize.
[2024-05-29 18:07:00] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 0 ms to minimize.
[2024-05-29 18:07:00] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 1 ms to minimize.
[2024-05-29 18:07:01] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 0 ms to minimize.
[2024-05-29 18:07:01] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:07:01] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 0 ms to minimize.
[2024-05-29 18:07:01] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 1 ms to minimize.
[2024-05-29 18:07:01] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 1 ms to minimize.
[2024-05-29 18:07:02] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 1 ms to minimize.
[2024-05-29 18:07:02] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 1 ms to minimize.
[2024-05-29 18:07:02] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 1 ms to minimize.
[2024-05-29 18:07:02] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 1 ms to minimize.
[2024-05-29 18:07:03] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 1 ms to minimize.
[2024-05-29 18:07:03] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 1 ms to minimize.
[2024-05-29 18:07:03] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 1 ms to minimize.
[2024-05-29 18:07:03] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 0 ms to minimize.
[2024-05-29 18:07:03] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 0 ms to minimize.
[2024-05-29 18:07:04] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 0 ms to minimize.
[2024-05-29 18:07:04] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 1 ms to minimize.
[2024-05-29 18:07:04] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 1 ms to minimize.
[2024-05-29 18:07:04] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 1 ms to minimize.
[2024-05-29 18:07:05] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 0 ms to minimize.
[2024-05-29 18:07:05] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 1 ms to minimize.
[2024-05-29 18:07:05] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 1 ms to minimize.
[2024-05-29 18:07:05] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 0 ms to minimize.
[2024-05-29 18:07:05] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 0 ms to minimize.
[2024-05-29 18:07:06] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 0 ms to minimize.
[2024-05-29 18:07:06] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 0 ms to minimize.
[2024-05-29 18:07:06] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:07:06] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 0 ms to minimize.
[2024-05-29 18:07:06] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 1 ms to minimize.
[2024-05-29 18:07:07] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 1 ms to minimize.
[2024-05-29 18:07:07] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 0 ms to minimize.
[2024-05-29 18:07:07] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 1 ms to minimize.
[2024-05-29 18:07:07] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 11912 ms
[2024-05-29 18:07:07] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 0 ms to minimize.
[2024-05-29 18:07:07] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 1 ms to minimize.
[2024-05-29 18:07:08] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 0 ms to minimize.
[2024-05-29 18:07:08] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 1 ms to minimize.
[2024-05-29 18:07:08] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 1 ms to minimize.
[2024-05-29 18:07:08] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 0 ms to minimize.
[2024-05-29 18:07:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1019 ms
[2024-05-29 18:07:08] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 1 ms to minimize.
[2024-05-29 18:07:08] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 1 ms to minimize.
[2024-05-29 18:07:09] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 1 ms to minimize.
[2024-05-29 18:07:09] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 0 ms to minimize.
[2024-05-29 18:07:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 691 ms
[2024-05-29 18:07:09] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 1 ms to minimize.
[2024-05-29 18:07:09] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 1 ms to minimize.
[2024-05-29 18:07:09] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 0 ms to minimize.
[2024-05-29 18:07:10] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 0 ms to minimize.
[2024-05-29 18:07:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 765 ms
[2024-05-29 18:07:10] [INFO ] After 15495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 359 ms.
[2024-05-29 18:07:10] [INFO ] After 16213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 152 ms.
Support contains 6 out of 1322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1322/1322 places, 1522/1522 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1322 transition count 1361
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1161 transition count 1361
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1161 transition count 1161
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 961 transition count 1161
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: 398
Deduced a syphon composed of 398 places in 1 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1518 place count 563 transition count 763
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 1598 place count 563 transition count 763
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1599 place count 562 transition count 762
Applied a total of 1599 rules in 127 ms. Remains 562 /1322 variables (removed 760) and now considering 762/1522 (removed 760) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 562/1322 places, 762/1522 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 150 ms. (steps per millisecond=66 ) 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 :1
Incomplete Best-First random walk after 10001 steps, including 3 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 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 762 rows 562 cols
[2024-05-29 18:07:11] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 18:07:11] [INFO ] [Real]Absence check using 161 positive place invariants in 24 ms returned sat
[2024-05-29 18:07:11] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 18:07:11] [INFO ] [Nat]Absence check using 161 positive place invariants in 27 ms returned sat
[2024-05-29 18:07:11] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 18:07:11] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:07:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2024-05-29 18:07:12] [INFO ] After 779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-29 18:07:12] [INFO ] After 1010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 20 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) 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 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 :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 18:07:12] [INFO ] Invariant cache hit.
[2024-05-29 18:07:12] [INFO ] [Real]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:07:13] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 18:07:13] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:07:13] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:07:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-29 18:07:13] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:07:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-29 18:07:13] [INFO ] After 490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-29 18:07:13] [INFO ] After 682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 14 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 2) 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 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
Interrupted probabilistic random walk after 207081 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207081 steps, saw 56073 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 18:07:17] [INFO ] Invariant cache hit.
[2024-05-29 18:07:17] [INFO ] [Real]Absence check using 161 positive place invariants in 23 ms returned sat
[2024-05-29 18:07:17] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 18:07:17] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:07:17] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 18:07:17] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:07:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-29 18:07:18] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:07:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-29 18:07:18] [INFO ] After 481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-29 18:07:18] [INFO ] After 661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 14 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-29 18:07:18] [INFO ] Invariant cache hit.
[2024-05-29 18:07:18] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-29 18:07:18] [INFO ] Invariant cache hit.
[2024-05-29 18:07:19] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2024-05-29 18:07:19] [INFO ] Redundant transitions in 62 ms returned [681]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-05-29 18:07:19] [INFO ] Computed 161 invariants in 4 ms
[2024-05-29 18:07:19] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/562 places, 761/762 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1336 ms. Remains : 562/562 places, 761/762 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 189 ms. (steps per millisecond=52 ) 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
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
Interrupted probabilistic random walk after 186443 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186443 steps, saw 52121 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 18:07:22] [INFO ] Invariant cache hit.
[2024-05-29 18:07:22] [INFO ] [Real]Absence check using 161 positive place invariants in 32 ms returned sat
[2024-05-29 18:07:23] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 18:07:23] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:07:23] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 18:07:23] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:07:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-29 18:07:23] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:07:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-29 18:07:23] [INFO ] After 506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-29 18:07:23] [INFO ] After 685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 562/562 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-29 18:07:23] [INFO ] Invariant cache hit.
[2024-05-29 18:07:24] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-29 18:07:24] [INFO ] Invariant cache hit.
[2024-05-29 18:07:24] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2024-05-29 18:07:24] [INFO ] Redundant transitions in 59 ms returned []
[2024-05-29 18:07:24] [INFO ] Invariant cache hit.
[2024-05-29 18:07:25] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1343 ms. Remains : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 18:07:25] [INFO ] Invariant cache hit.
[2024-05-29 18:07:25] [INFO ] [Real]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:07:25] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 18:07:25] [INFO ] [Nat]Absence check using 161 positive place invariants in 24 ms returned sat
[2024-05-29 18:07:26] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 18:07:26] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:07:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-29 18:07:26] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:07:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-29 18:07:26] [INFO ] After 490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-29 18:07:26] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1)), (F p0)]
Knowledge based reduction with 11 factoid took 442 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter insensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 339 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
// Phase 1: matrix 1522 rows 1322 cols
[2024-05-29 18:07:27] [INFO ] Computed 161 invariants in 7 ms
[2024-05-29 18:07:28] [INFO ] [Real]Absence check using 161 positive place invariants in 132 ms returned sat
[2024-05-29 18:07:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 18:07:31] [INFO ] [Real]Absence check using state equation in 3829 ms returned sat
[2024-05-29 18:07:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:07:32] [INFO ] [Nat]Absence check using 161 positive place invariants in 134 ms returned sat
[2024-05-29 18:07:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 18:07:37] [INFO ] [Nat]Absence check using state equation in 5132 ms returned sat
[2024-05-29 18:07:38] [INFO ] Computed and/alt/rep : 1521/4824/1521 causal constraints (skipped 0 transitions) in 90 ms.
[2024-05-29 18:07:47] [INFO ] Deduced a trap composed of 20 places in 630 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 18:07:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-29 18:07:47] [INFO ] Invariant cache hit.
[2024-05-29 18:07:48] [INFO ] [Real]Absence check using 161 positive place invariants in 125 ms returned sat
[2024-05-29 18:07:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 18:07:51] [INFO ] [Real]Absence check using state equation in 3525 ms returned sat
[2024-05-29 18:07:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:07:52] [INFO ] [Nat]Absence check using 161 positive place invariants in 136 ms returned sat
[2024-05-29 18:07:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 18:07:57] [INFO ] [Nat]Absence check using state equation in 4652 ms returned sat
[2024-05-29 18:07:57] [INFO ] Computed and/alt/rep : 1521/4824/1521 causal constraints (skipped 0 transitions) in 71 ms.
[2024-05-29 18:08:07] [INFO ] Deduced a trap composed of 20 places in 631 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 18:08:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 1322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1322/1322 places, 1522/1522 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1321 transition count 1360
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1160 transition count 1360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1160 transition count 1160
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 960 transition count 1160
Performed 396 Post agglomeration using F-continuation condition.Transition count delta: 396
Deduced a syphon composed of 396 places in 1 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 1514 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1516 place count 562 transition count 762
Applied a total of 1516 rules in 102 ms. Remains 562 /1322 variables (removed 760) and now considering 762/1522 (removed 760) transitions.
// Phase 1: matrix 762 rows 562 cols
[2024-05-29 18:08:07] [INFO ] Computed 161 invariants in 7 ms
[2024-05-29 18:08:08] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-29 18:08:08] [INFO ] Invariant cache hit.
[2024-05-29 18:08:08] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2024-05-29 18:08:08] [INFO ] Redundant transitions in 147 ms returned [761]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-05-29 18:08:08] [INFO ] Computed 161 invariants in 2 ms
[2024-05-29 18:08:09] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/1322 places, 761/1522 transitions.
Applied a total of 0 rules in 13 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1467 ms. Remains : 562/1322 places, 761/1522 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) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 201 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter insensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 375 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 10) seen :6
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 :1
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 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 18:08:10] [INFO ] Invariant cache hit.
[2024-05-29 18:08:10] [INFO ] [Real]Absence check using 161 positive place invariants in 24 ms returned sat
[2024-05-29 18:08:10] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 18:08:10] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:08:10] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 18:08:10] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2024-05-29 18:08:11] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2024-05-29 18:08:11] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-29 18:08:11] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:08:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 306 ms
[2024-05-29 18:08:11] [INFO ] After 723ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 96 ms.
[2024-05-29 18:08:11] [INFO ] After 965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 76 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 562 transition count 761
Applied a total of 80 rules in 31 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 562/562 places, 761/761 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 151 ms. (steps per millisecond=66 ) 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 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :1
Finished Best-First random walk after 9911 steps, including 2 resets, run visited all 2 properties in 32 ms. (steps per millisecond=309 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1)), (F p0)]
Knowledge based reduction with 19 factoid took 679 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter insensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 398 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 367 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
[2024-05-29 18:08:13] [INFO ] Invariant cache hit.
[2024-05-29 18:08:13] [INFO ] [Real]Absence check using 161 positive place invariants in 56 ms returned sat
[2024-05-29 18:08:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 18:08:14] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2024-05-29 18:08:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:08:14] [INFO ] [Nat]Absence check using 161 positive place invariants in 50 ms returned sat
[2024-05-29 18:08:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 18:08:15] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2024-05-29 18:08:15] [INFO ] Computed and/alt/rep : 684/2945/684 causal constraints (skipped 76 transitions) in 43 ms.
[2024-05-29 18:08:26] [INFO ] Added : 678 causal constraints over 136 iterations in 11080 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-29 18:08:26] [INFO ] Invariant cache hit.
[2024-05-29 18:08:26] [INFO ] [Real]Absence check using 161 positive place invariants in 51 ms returned sat
[2024-05-29 18:08:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 18:08:27] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2024-05-29 18:08:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:08:28] [INFO ] [Nat]Absence check using 161 positive place invariants in 52 ms returned sat
[2024-05-29 18:08:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 18:08:28] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2024-05-29 18:08:28] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:08:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-29 18:08:28] [INFO ] Computed and/alt/rep : 684/2945/684 causal constraints (skipped 76 transitions) in 44 ms.
[2024-05-29 18:08:37] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:08:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2024-05-29 18:08:38] [INFO ] Added : 532 causal constraints over 107 iterations in 9424 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 372 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Product exploration explored 100000 steps with 523 reset in 488 ms.
Product exploration explored 100000 steps with 529 reset in 589 ms.
Built C files in :
/tmp/ltsmin16675598607179180758
[2024-05-29 18:08:39] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2024-05-29 18:08:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:08:39] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2024-05-29 18:08:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:08:39] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2024-05-29 18:08:39] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:08:39] [INFO ] Built C files in 101ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16675598607179180758
Running compilation step : cd /tmp/ltsmin16675598607179180758;'/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 1998 ms.
Running link step : cd /tmp/ltsmin16675598607179180758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16675598607179180758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12856820978188254326.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 19 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-29 18:08:54] [INFO ] Invariant cache hit.
[2024-05-29 18:08:54] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-29 18:08:54] [INFO ] Invariant cache hit.
[2024-05-29 18:08:55] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2024-05-29 18:08:55] [INFO ] Redundant transitions in 146 ms returned []
[2024-05-29 18:08:55] [INFO ] Invariant cache hit.
[2024-05-29 18:08:55] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1391 ms. Remains : 562/562 places, 761/761 transitions.
Built C files in :
/tmp/ltsmin8533323047435676829
[2024-05-29 18:08:56] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2024-05-29 18:08:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:08:56] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2024-05-29 18:08:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:08:56] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2024-05-29 18:08:56] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:08:56] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8533323047435676829
Running compilation step : cd /tmp/ltsmin8533323047435676829;'/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 1964 ms.
Running link step : cd /tmp/ltsmin8533323047435676829;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8533323047435676829;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6936498265090919968.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:09:11] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:09:11] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:09:11] [INFO ] Time to serialize gal into /tmp/LTL4793378203826805229.gal : 4 ms
[2024-05-29 18:09:11] [INFO ] Time to serialize properties into /tmp/LTL4243371605224378334.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/LTL4793378203826805229.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14649475094862470739.hoa' '-atoms' '/tmp/LTL4243371605224378334.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/LTL4243371605224378334.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14649475094862470739.hoa
Detected timeout of ITS tools.
[2024-05-29 18:09:26] [INFO ] Flatten gal took : 21 ms
[2024-05-29 18:09:26] [INFO ] Flatten gal took : 26 ms
[2024-05-29 18:09:26] [INFO ] Time to serialize gal into /tmp/LTL12093610785738681050.gal : 4 ms
[2024-05-29 18:09:26] [INFO ] Time to serialize properties into /tmp/LTL16493960091734883481.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/LTL12093610785738681050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16493960091734883481.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((X("(p964==1)"))||(("((p1586==1)&&(p1597==1))")&&(G(F("(((p338==1)&&(p349==1))&&(p375==1))")))))))
Formula 0 simplified : G(X!"(p964==1)" & (!"((p1586==1)&&(p1597==1))" | FG!"(((p338==1)&&(p349==1))&&(p375==1))"))
Detected timeout of ITS tools.
[2024-05-29 18:09:41] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:09:41] [INFO ] Applying decomposition
[2024-05-29 18:09:41] [INFO ] Flatten gal took : 20 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/graph14823702809007217027.txt' '-o' '/tmp/graph14823702809007217027.bin' '-w' '/tmp/graph14823702809007217027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14823702809007217027.bin' '-l' '-1' '-v' '-w' '/tmp/graph14823702809007217027.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:09:41] [INFO ] Decomposing Gal with order
[2024-05-29 18:09:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:09:41] [INFO ] Removed a total of 835 redundant transitions.
[2024-05-29 18:09:41] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:09:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 844 labels/synchronizations in 9 ms.
[2024-05-29 18:09:41] [INFO ] Time to serialize gal into /tmp/LTL9460526436921171993.gal : 4 ms
[2024-05-29 18:09:41] [INFO ] Time to serialize properties into /tmp/LTL6056796142032392815.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/LTL9460526436921171993.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6056796142032392815.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((X("(i10.i0.u95.p964==1)"))||(("((i15.i1.u159.p1586==1)&&(i15.i1.u160.p1597==1))")&&(G(F("(((i2.i1.u31.p338==1)&&(i2.i1.u32.p349=...186
Formula 0 simplified : G(X!"(i10.i0.u95.p964==1)" & (!"((i15.i1.u159.p1586==1)&&(i15.i1.u160.p1597==1))" | FG!"(((i2.i1.u31.p338==1)&&(i2.i1.u32.p349==1))&...176
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4137353369316899098
[2024-05-29 18:09:56] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4137353369316899098
Running compilation step : cd /tmp/ltsmin4137353369316899098;'/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 1274 ms.
Running link step : cd /tmp/ltsmin4137353369316899098;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4137353369316899098;'/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((LTLAPp0==true))||([](<>((LTLAPp2==true)))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-040B-LTLFireability-11 finished in 202824 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)||(X((p1 U X(p2)))&&!(!p1 U p3))))'
Support contains 5 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1322 transition count 1522
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1322 transition count 1522
Applied a total of 20 rules in 81 ms. Remains 1322 /1332 variables (removed 10) and now considering 1522/1532 (removed 10) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2024-05-29 18:10:11] [INFO ] Computed 161 invariants in 6 ms
[2024-05-29 18:10:12] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-29 18:10:12] [INFO ] Invariant cache hit.
[2024-05-29 18:10:13] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 2049 ms to find 0 implicit places.
[2024-05-29 18:10:13] [INFO ] Invariant cache hit.
[2024-05-29 18:10:14] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1322/1332 places, 1522/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2957 ms. Remains : 1322/1332 places, 1522/1532 transitions.
Stuttering acceptance computed with spot in 408 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), true, p3, (NOT p0), (NOT p2), (AND (NOT p0) p3), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 7}, { cond=p1, acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) p3), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p3), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(AND p0 p1), acceptance={} source=6 dest: 10}], [{ cond=(NOT p2), acceptance={} source=7 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(EQ s714 0), p3:(EQ s686 1), p1:(NEQ s714 1), p2:(AND (EQ s593 1) (EQ s627 1) (EQ s649 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 420 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-12 finished in 3405 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 U p1))))'
Support contains 2 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 1331 transition count 1371
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 320 place count 1171 transition count 1371
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 320 place count 1171 transition count 1171
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 720 place count 971 transition count 1171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 729 place count 962 transition count 1162
Iterating global reduction 2 with 9 rules applied. Total rules applied 738 place count 962 transition count 1162
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 738 place count 962 transition count 1158
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 746 place count 958 transition count 1158
Performed 391 Post agglomeration using F-continuation condition.Transition count delta: 391
Deduced a syphon composed of 391 places in 1 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 2 with 782 rules applied. Total rules applied 1528 place count 567 transition count 767
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1530 place count 565 transition count 765
Applied a total of 1530 rules in 146 ms. Remains 565 /1332 variables (removed 767) and now considering 765/1532 (removed 767) transitions.
// Phase 1: matrix 765 rows 565 cols
[2024-05-29 18:10:15] [INFO ] Computed 161 invariants in 4 ms
[2024-05-29 18:10:15] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-29 18:10:15] [INFO ] Invariant cache hit.
[2024-05-29 18:10:16] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
[2024-05-29 18:10:16] [INFO ] Redundant transitions in 154 ms returned [764]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 764 rows 565 cols
[2024-05-29 18:10:16] [INFO ] Computed 161 invariants in 4 ms
[2024-05-29 18:10:16] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 565/1332 places, 764/1532 transitions.
Applied a total of 0 rules in 15 ms. Remains 565 /565 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1546 ms. Remains : 565/1332 places, 764/1532 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s427 1), p0:(NEQ s463 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 534 steps with 1 reset in 7 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-13 finished in 1658 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)||X(F(p1))))'
Support contains 4 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1322 transition count 1522
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1322 transition count 1522
Applied a total of 20 rules in 82 ms. Remains 1322 /1332 variables (removed 10) and now considering 1522/1532 (removed 10) transitions.
// Phase 1: matrix 1522 rows 1322 cols
[2024-05-29 18:10:16] [INFO ] Computed 161 invariants in 11 ms
[2024-05-29 18:10:17] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-29 18:10:17] [INFO ] Invariant cache hit.
[2024-05-29 18:10:18] [INFO ] Implicit Places using invariants and state equation in 1492 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
[2024-05-29 18:10:18] [INFO ] Invariant cache hit.
[2024-05-29 18:10:19] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1322/1332 places, 1522/1532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2818 ms. Remains : 1322/1332 places, 1522/1532 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s1278 1) (EQ s1289 1) (EQ s1307 1)), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1671 steps with 0 reset in 11 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-14 finished in 3059 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)))'
Support contains 1 out of 1332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1331 transition count 1370
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1170 transition count 1370
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 322 place count 1170 transition count 1171
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 720 place count 971 transition count 1171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 729 place count 962 transition count 1162
Iterating global reduction 2 with 9 rules applied. Total rules applied 738 place count 962 transition count 1162
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 738 place count 962 transition count 1158
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 746 place count 958 transition count 1158
Performed 393 Post agglomeration using F-continuation condition.Transition count delta: 393
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1532 place count 565 transition count 765
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1534 place count 563 transition count 763
Applied a total of 1534 rules in 138 ms. Remains 563 /1332 variables (removed 769) and now considering 763/1532 (removed 769) transitions.
// Phase 1: matrix 763 rows 563 cols
[2024-05-29 18:10:19] [INFO ] Computed 161 invariants in 1 ms
[2024-05-29 18:10:20] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-29 18:10:20] [INFO ] Invariant cache hit.
[2024-05-29 18:10:20] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2024-05-29 18:10:20] [INFO ] Redundant transitions in 143 ms returned [762]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 762 rows 563 cols
[2024-05-29 18:10:20] [INFO ] Computed 161 invariants in 1 ms
[2024-05-29 18:10:21] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 563/1332 places, 762/1532 transitions.
Applied a total of 0 rules in 13 ms. Remains 563 /563 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1469 ms. Remains : 563/1332 places, 762/1532 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s455 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 522 steps with 0 reset in 5 ms.
FORMULA ShieldRVs-PT-040B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-040B-LTLFireability-15 finished in 1528 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (p1||X(p1)||G(!p0))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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((p0&&F((G(p1)||(p2 U p3))))))'
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((X(p0)||(G(F(p2))&&p1))))'
Found a Shortening insensitive property : ShieldRVs-PT-040B-LTLFireability-11
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 1332 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1332/1332 places, 1532/1532 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1331 transition count 1370
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1170 transition count 1370
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1170 transition count 1170
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 970 transition count 1170
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 732 place count 960 transition count 1160
Iterating global reduction 2 with 10 rules applied. Total rules applied 742 place count 960 transition count 1160
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 742 place count 960 transition count 1156
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 750 place count 956 transition count 1156
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Deduced a syphon composed of 392 places in 1 ms
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 2 with 784 rules applied. Total rules applied 1534 place count 564 transition count 764
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1536 place count 562 transition count 762
Applied a total of 1536 rules in 145 ms. Remains 562 /1332 variables (removed 770) and now considering 762/1532 (removed 770) transitions.
// Phase 1: matrix 762 rows 562 cols
[2024-05-29 18:10:21] [INFO ] Computed 161 invariants in 2 ms
[2024-05-29 18:10:22] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-29 18:10:22] [INFO ] Invariant cache hit.
[2024-05-29 18:10:22] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2024-05-29 18:10:22] [INFO ] Invariant cache hit.
[2024-05-29 18:10:23] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 562/1332 places, 762/1532 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1279 ms. Remains : 562/1332 places, 762/1532 transitions.
Running random walk in product with property : ShieldRVs-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s556 1) (EQ s560 1)), p2:(AND (EQ s108 1) (EQ s112 1) (EQ s121 1)), p0:(EQ s334 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 528 reset in 543 ms.
Product exploration explored 100000 steps with 530 reset in 575 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 137 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 531 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) 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
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 :1
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
Running SMT prover for 3 properties.
[2024-05-29 18:10:25] [INFO ] Invariant cache hit.
[2024-05-29 18:10:25] [INFO ] [Real]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:10:25] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 18:10:25] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2024-05-29 18:10:26] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 18:10:26] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:10:26] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:10:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2024-05-29 18:10:26] [INFO ] After 594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 104 ms.
[2024-05-29 18:10:26] [INFO ] After 844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 562 transition count 762
Applied a total of 80 rules in 29 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 3) 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 3) 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 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 762 rows 562 cols
[2024-05-29 18:10:26] [INFO ] Computed 161 invariants in 13 ms
[2024-05-29 18:10:26] [INFO ] [Real]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:10:27] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 18:10:27] [INFO ] [Nat]Absence check using 161 positive place invariants in 23 ms returned sat
[2024-05-29 18:10:27] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 18:10:27] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:10:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-29 18:10:27] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-29 18:10:27] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 182 ms. (steps per millisecond=54 ) 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
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
Interrupted probabilistic random walk after 180729 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180729 steps, saw 50969 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 18:10:31] [INFO ] Invariant cache hit.
[2024-05-29 18:10:31] [INFO ] [Real]Absence check using 161 positive place invariants in 23 ms returned sat
[2024-05-29 18:10:31] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 18:10:31] [INFO ] [Nat]Absence check using 161 positive place invariants in 24 ms returned sat
[2024-05-29 18:10:31] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 18:10:31] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:10:31] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:10:32] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:10:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 191 ms
[2024-05-29 18:10:32] [INFO ] After 526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-29 18:10:32] [INFO ] After 710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 16 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 16 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-29 18:10:32] [INFO ] Invariant cache hit.
[2024-05-29 18:10:32] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-29 18:10:32] [INFO ] Invariant cache hit.
[2024-05-29 18:10:33] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
[2024-05-29 18:10:33] [INFO ] Redundant transitions in 68 ms returned [681]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-05-29 18:10:33] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 18:10:33] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/562 places, 761/762 transitions.
Applied a total of 0 rules in 17 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1413 ms. Remains : 562/562 places, 761/762 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) 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 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 18:10:33] [INFO ] Invariant cache hit.
[2024-05-29 18:10:34] [INFO ] [Real]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:10:34] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:10:34] [INFO ] [Nat]Absence check using 161 positive place invariants in 24 ms returned sat
[2024-05-29 18:10:34] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:10:34] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-29 18:10:34] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-29 18:10:34] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 16 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 562/562 places, 761/761 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 230824 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230824 steps, saw 60981 distinct states, run finished after 3003 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 18:10:37] [INFO ] Invariant cache hit.
[2024-05-29 18:10:38] [INFO ] [Real]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:10:38] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:10:38] [INFO ] [Nat]Absence check using 161 positive place invariants in 24 ms returned sat
[2024-05-29 18:10:38] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:10:38] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:10:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-29 18:10:38] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 18:10:38] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 562/562 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-29 18:10:38] [INFO ] Invariant cache hit.
[2024-05-29 18:10:39] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-29 18:10:39] [INFO ] Invariant cache hit.
[2024-05-29 18:10:39] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
[2024-05-29 18:10:39] [INFO ] Redundant transitions in 51 ms returned []
[2024-05-29 18:10:39] [INFO ] Invariant cache hit.
[2024-05-29 18:10:40] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1348 ms. Remains : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 18:10:40] [INFO ] Invariant cache hit.
[2024-05-29 18:10:40] [INFO ] [Real]Absence check using 161 positive place invariants in 24 ms returned sat
[2024-05-29 18:10:40] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:10:40] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2024-05-29 18:10:40] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:10:40] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:10:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-29 18:10:40] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-29 18:10:41] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1)), (F p0)]
Knowledge based reduction with 11 factoid took 476 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter insensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 357 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 397 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
// Phase 1: matrix 762 rows 562 cols
[2024-05-29 18:10:42] [INFO ] Computed 161 invariants in 2 ms
[2024-05-29 18:10:42] [INFO ] [Real]Absence check using 161 positive place invariants in 51 ms returned sat
[2024-05-29 18:10:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 18:10:43] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2024-05-29 18:10:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:10:43] [INFO ] [Nat]Absence check using 161 positive place invariants in 49 ms returned sat
[2024-05-29 18:10:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 18:10:44] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2024-05-29 18:10:44] [INFO ] Computed and/alt/rep : 684/2944/684 causal constraints (skipped 77 transitions) in 49 ms.
[2024-05-29 18:10:53] [INFO ] Added : 572 causal constraints over 115 iterations in 9082 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-29 18:10:53] [INFO ] Invariant cache hit.
[2024-05-29 18:10:53] [INFO ] [Real]Absence check using 161 positive place invariants in 52 ms returned sat
[2024-05-29 18:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 18:10:54] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2024-05-29 18:10:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:10:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 52 ms returned sat
[2024-05-29 18:10:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 18:10:55] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2024-05-29 18:10:55] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:10:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-29 18:10:55] [INFO ] Computed and/alt/rep : 684/2944/684 causal constraints (skipped 77 transitions) in 41 ms.
[2024-05-29 18:11:06] [INFO ] Added : 651 causal constraints over 131 iterations in 10802 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 18 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-29 18:11:06] [INFO ] Invariant cache hit.
[2024-05-29 18:11:06] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-29 18:11:06] [INFO ] Invariant cache hit.
[2024-05-29 18:11:07] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2024-05-29 18:11:07] [INFO ] Redundant transitions in 140 ms returned [761]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-05-29 18:11:07] [INFO ] Computed 161 invariants in 1 ms
[2024-05-29 18:11:07] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/562 places, 761/762 transitions.
Applied a total of 0 rules in 13 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1399 ms. Remains : 562/562 places, 761/762 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) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 193 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter insensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 393 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 10) seen :6
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 :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 18:11:08] [INFO ] Invariant cache hit.
[2024-05-29 18:11:08] [INFO ] [Real]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:11:09] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 18:11:09] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:11:09] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 18:11:09] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:11:09] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:11:09] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:11:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 211 ms
[2024-05-29 18:11:09] [INFO ] After 582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-29 18:11:09] [INFO ] After 766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 562 transition count 761
Applied a total of 80 rules in 26 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 562/562 places, 761/761 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) 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 2) 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 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 761 rows 562 cols
[2024-05-29 18:11:10] [INFO ] Computed 161 invariants in 6 ms
[2024-05-29 18:11:10] [INFO ] [Real]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:11:10] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:11:10] [INFO ] [Nat]Absence check using 161 positive place invariants in 24 ms returned sat
[2024-05-29 18:11:10] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:11:10] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-29 18:11:10] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 14 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 562/562 places, 761/761 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 231484 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 231484 steps, saw 61106 distinct states, run finished after 3002 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 18:11:13] [INFO ] Invariant cache hit.
[2024-05-29 18:11:14] [INFO ] [Real]Absence check using 161 positive place invariants in 24 ms returned sat
[2024-05-29 18:11:14] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:11:14] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:11:14] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:11:14] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:11:14] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:11:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2024-05-29 18:11:14] [INFO ] After 410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 18:11:14] [INFO ] After 550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 562/562 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 20 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-29 18:11:14] [INFO ] Invariant cache hit.
[2024-05-29 18:11:14] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-29 18:11:14] [INFO ] Invariant cache hit.
[2024-05-29 18:11:15] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
[2024-05-29 18:11:15] [INFO ] Redundant transitions in 61 ms returned []
[2024-05-29 18:11:15] [INFO ] Invariant cache hit.
[2024-05-29 18:11:16] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1454 ms. Remains : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 14 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 18:11:16] [INFO ] Invariant cache hit.
[2024-05-29 18:11:16] [INFO ] [Real]Absence check using 161 positive place invariants in 23 ms returned sat
[2024-05-29 18:11:16] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 18:11:16] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-29 18:11:16] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 18:11:16] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:11:16] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:11:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2024-05-29 18:11:16] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 18:11:16] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1)), (F p0)]
Knowledge based reduction with 19 factoid took 677 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter insensitive) to 10 states, 25 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 398 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 411 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
// Phase 1: matrix 761 rows 562 cols
[2024-05-29 18:11:18] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 18:11:18] [INFO ] [Real]Absence check using 161 positive place invariants in 47 ms returned sat
[2024-05-29 18:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 18:11:19] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2024-05-29 18:11:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:11:19] [INFO ] [Nat]Absence check using 161 positive place invariants in 54 ms returned sat
[2024-05-29 18:11:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 18:11:20] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2024-05-29 18:11:20] [INFO ] Computed and/alt/rep : 684/2945/684 causal constraints (skipped 76 transitions) in 41 ms.
[2024-05-29 18:11:29] [INFO ] Added : 587 causal constraints over 118 iterations in 9469 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-29 18:11:29] [INFO ] Invariant cache hit.
[2024-05-29 18:11:30] [INFO ] [Real]Absence check using 161 positive place invariants in 48 ms returned sat
[2024-05-29 18:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 18:11:30] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2024-05-29 18:11:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 18:11:31] [INFO ] [Nat]Absence check using 161 positive place invariants in 53 ms returned sat
[2024-05-29 18:11:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 18:11:31] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2024-05-29 18:11:31] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:11:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-29 18:11:31] [INFO ] Computed and/alt/rep : 684/2945/684 causal constraints (skipped 76 transitions) in 48 ms.
[2024-05-29 18:11:42] [INFO ] Added : 662 causal constraints over 133 iterations in 10768 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 333 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, false, false, false, false]
Product exploration explored 100000 steps with 530 reset in 487 ms.
Product exploration explored 100000 steps with 526 reset in 575 ms.
Built C files in :
/tmp/ltsmin4519105093571427952
[2024-05-29 18:11:44] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2024-05-29 18:11:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:11:44] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2024-05-29 18:11:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:11:44] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2024-05-29 18:11:44] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:11:44] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4519105093571427952
Running compilation step : cd /tmp/ltsmin4519105093571427952;'/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 1929 ms.
Running link step : cd /tmp/ltsmin4519105093571427952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4519105093571427952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased475252195147452126.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 15 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-29 18:11:59] [INFO ] Invariant cache hit.
[2024-05-29 18:11:59] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-29 18:11:59] [INFO ] Invariant cache hit.
[2024-05-29 18:12:00] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
[2024-05-29 18:12:00] [INFO ] Redundant transitions in 132 ms returned []
[2024-05-29 18:12:00] [INFO ] Invariant cache hit.
[2024-05-29 18:12:00] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1368 ms. Remains : 562/562 places, 761/761 transitions.
Built C files in :
/tmp/ltsmin1357738504730380638
[2024-05-29 18:12:00] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2024-05-29 18:12:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:12:00] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2024-05-29 18:12:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:12:00] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2024-05-29 18:12:00] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 18:12:00] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1357738504730380638
Running compilation step : cd /tmp/ltsmin1357738504730380638;'/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 1934 ms.
Running link step : cd /tmp/ltsmin1357738504730380638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1357738504730380638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11475115707636024656.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 18:12:15] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:12:15] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:12:15] [INFO ] Time to serialize gal into /tmp/LTL9658128743901812910.gal : 4 ms
[2024-05-29 18:12:15] [INFO ] Time to serialize properties into /tmp/LTL6322381009067318433.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/LTL9658128743901812910.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1418620772248440210.hoa' '-atoms' '/tmp/LTL6322381009067318433.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/LTL6322381009067318433.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1418620772248440210.hoa
Detected timeout of ITS tools.
[2024-05-29 18:12:30] [INFO ] Flatten gal took : 26 ms
[2024-05-29 18:12:30] [INFO ] Flatten gal took : 19 ms
[2024-05-29 18:12:30] [INFO ] Time to serialize gal into /tmp/LTL12148526327533858790.gal : 4 ms
[2024-05-29 18:12:30] [INFO ] Time to serialize properties into /tmp/LTL15107316740244927038.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/LTL12148526327533858790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15107316740244927038.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((X("(p964==1)"))||(("((p1586==1)&&(p1597==1))")&&(G(F("(((p338==1)&&(p349==1))&&(p375==1))")))))))
Formula 0 simplified : G(X!"(p964==1)" & (!"((p1586==1)&&(p1597==1))" | FG!"(((p338==1)&&(p349==1))&&(p375==1))"))
Detected timeout of ITS tools.
[2024-05-29 18:12:45] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:12:45] [INFO ] Applying decomposition
[2024-05-29 18:12:45] [INFO ] Flatten gal took : 20 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/graph14669837503825915301.txt' '-o' '/tmp/graph14669837503825915301.bin' '-w' '/tmp/graph14669837503825915301.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14669837503825915301.bin' '-l' '-1' '-v' '-w' '/tmp/graph14669837503825915301.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:12:45] [INFO ] Decomposing Gal with order
[2024-05-29 18:12:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:12:45] [INFO ] Removed a total of 835 redundant transitions.
[2024-05-29 18:12:45] [INFO ] Flatten gal took : 37 ms
[2024-05-29 18:12:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 884 labels/synchronizations in 8 ms.
[2024-05-29 18:12:45] [INFO ] Time to serialize gal into /tmp/LTL16897522460907533812.gal : 5 ms
[2024-05-29 18:12:45] [INFO ] Time to serialize properties into /tmp/LTL10532818299550417866.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/LTL16897522460907533812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10532818299550417866.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 : !((F((X("(i9.i0.u95.p964==1)"))||(("((i15.i2.u159.p1586==1)&&(i15.i2.u160.p1597==1))")&&(G(F("(((i2.i1.u31.p338==1)&&(i2.i1.u32.p349==...188
Formula 0 simplified : G(X!"(i9.i0.u95.p964==1)" & (!"((i15.i2.u159.p1586==1)&&(i15.i2.u160.p1597==1))" | FG!"(((i2.i1.u31.p338==1)&&(i2.i1.u32.p349==1))&&...178
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12043272010647485937
[2024-05-29 18:13:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12043272010647485937
Running compilation step : cd /tmp/ltsmin12043272010647485937;'/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 1297 ms.
Running link step : cd /tmp/ltsmin12043272010647485937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12043272010647485937;'/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((LTLAPp0==true))||([](<>((LTLAPp2==true)))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-040B-LTLFireability-11 finished in 174422 ms.
[2024-05-29 18:13:16] [INFO ] Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1412534800181259170
[2024-05-29 18:13:16] [INFO ] Too many transitions (1532) to apply POR reductions. Disabling POR matrices.
[2024-05-29 18:13:16] [INFO ] Applying decomposition
[2024-05-29 18:13:16] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1412534800181259170
Running compilation step : cd /tmp/ltsmin1412534800181259170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '144' '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'
[2024-05-29 18:13:16] [INFO ] Flatten gal took : 36 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/graph3946338605971303970.txt' '-o' '/tmp/graph3946338605971303970.bin' '-w' '/tmp/graph3946338605971303970.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3946338605971303970.bin' '-l' '-1' '-v' '-w' '/tmp/graph3946338605971303970.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:13:16] [INFO ] Decomposing Gal with order
[2024-05-29 18:13:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:13:16] [INFO ] Removed a total of 1431 redundant transitions.
[2024-05-29 18:13:16] [INFO ] Flatten gal took : 63 ms
[2024-05-29 18:13:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 18:13:16] [INFO ] Time to serialize gal into /tmp/LTLFireability658097084674844781.gal : 11 ms
[2024-05-29 18:13:16] [INFO ] Time to serialize properties into /tmp/LTLFireability4844786881366070798.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/LTLFireability658097084674844781.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4844786881366070798.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...275
Read 5 LTL properties
Checking formula 0 : !((F(G("(i1.u38.p106==0)"))))
Formula 0 simplified : GF!"(i1.u38.p106==0)"
Compilation finished in 2834 ms.
Running link step : cd /tmp/ltsmin1412534800181259170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1412534800181259170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin1412534800181259170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1412534800181259170;'/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' '[](<>((!(LTLAPp1==true)&&X((!(LTLAPp1==true) U ((LTLAPp2==true)||X((LTLAPp2==true))||[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin1412534800181259170;'/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' '[](<>((!(LTLAPp1==true)&&X((!(LTLAPp1==true) U ((LTLAPp2==true)||X((LTLAPp2==true))||[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1412534800181259170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 18:38:13] [INFO ] Applying decomposition
[2024-05-29 18:38:13] [INFO ] Flatten gal took : 596 ms
[2024-05-29 18:38:14] [INFO ] Decomposing Gal with order
[2024-05-29 18:38:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:38:15] [INFO ] Removed a total of 837 redundant transitions.
[2024-05-29 18:38:15] [INFO ] Flatten gal took : 681 ms
[2024-05-29 18:38:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1272 labels/synchronizations in 330 ms.
[2024-05-29 18:38:17] [INFO ] Time to serialize gal into /tmp/LTLFireability16842138695395342125.gal : 86 ms
[2024-05-29 18:38:17] [INFO ] Time to serialize properties into /tmp/LTLFireability7999119963320055729.ltl : 11 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/LTLFireability16842138695395342125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7999119963320055729.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 5 LTL properties
Checking formula 0 : !((F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u53.p...167
Formula 0 simplified : GF!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u53.p10...161
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin1412534800181259170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1412534800181259170;'/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(((LTLAPp4==true)&&<>(([]((LTLAPp5==true))||((LTLAPp6==true) U (LTLAPp7==true))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7577732 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15884472 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="ShieldRVs-PT-040B"
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 ShieldRVs-PT-040B, 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 r373-tall-171683789500528"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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