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.r109-tall-171624208500403.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 DES-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 08:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 08:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 08:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-02b-LTLFireability-00
FORMULA_NAME DES-PT-02b-LTLFireability-01
FORMULA_NAME DES-PT-02b-LTLFireability-02
FORMULA_NAME DES-PT-02b-LTLFireability-03
FORMULA_NAME DES-PT-02b-LTLFireability-04
FORMULA_NAME DES-PT-02b-LTLFireability-05
FORMULA_NAME DES-PT-02b-LTLFireability-06
FORMULA_NAME DES-PT-02b-LTLFireability-07
FORMULA_NAME DES-PT-02b-LTLFireability-08
FORMULA_NAME DES-PT-02b-LTLFireability-09
FORMULA_NAME DES-PT-02b-LTLFireability-10
FORMULA_NAME DES-PT-02b-LTLFireability-11
FORMULA_NAME DES-PT-02b-LTLFireability-12
FORMULA_NAME DES-PT-02b-LTLFireability-13
FORMULA_NAME DES-PT-02b-LTLFireability-14
FORMULA_NAME DES-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716332839920

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=DES-PT-02b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 23:07:21] [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-21 23:07:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:07:21] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-21 23:07:21] [INFO ] Transformed 288 places.
[2024-05-21 23:07:21] [INFO ] Transformed 239 transitions.
[2024-05-21 23:07:21] [INFO ] Found NUPN structural information;
[2024-05-21 23:07:21] [INFO ] Parsed PT model containing 288 places and 239 transitions and 699 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 45 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 285 transition count 239
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 265 transition count 219
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 265 transition count 219
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 254 transition count 208
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 254 transition count 208
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 74 place count 254 transition count 199
Applied a total of 74 rules in 52 ms. Remains 254 /288 variables (removed 34) and now considering 199/239 (removed 40) transitions.
// Phase 1: matrix 199 rows 254 cols
[2024-05-21 23:07:21] [INFO ] Computed 62 invariants in 27 ms
[2024-05-21 23:07:22] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-21 23:07:22] [INFO ] Invariant cache hit.
[2024-05-21 23:07:22] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 764 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 253/288 places, 199/239 transitions.
Applied a total of 0 rules in 10 ms. Remains 253 /253 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 827 ms. Remains : 253/288 places, 199/239 transitions.
Support contains 45 out of 253 places after structural reductions.
[2024-05-21 23:07:22] [INFO ] Flatten gal took : 44 ms
[2024-05-21 23:07:22] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:07:22] [INFO ] Input system was already deterministic with 199 transitions.
Support contains 44 out of 253 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 36) seen :35
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 199 rows 253 cols
[2024-05-21 23:07:23] [INFO ] Computed 61 invariants in 14 ms
[2024-05-21 23:07:23] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2024-05-21 23:07:23] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 10 ms returned sat
[2024-05-21 23:07:23] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:07:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-21 23:07:23] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 10 ms returned sat
[2024-05-21 23:07:23] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:07:23] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-21 23:07:23] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 69 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 6 ms.
FORMULA DES-PT-02b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 66 stabilizing places and 59 stable transitions
Graph (complete) has 454 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 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 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Graph (complete) has 454 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 245 transition count 179
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 231 transition count 179
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 231 transition count 168
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 220 transition count 168
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 214 transition count 162
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 214 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 214 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 65 place count 214 transition count 159
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 213 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 211 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 211 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 211 transition count 154
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 76 place count 210 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 76 place count 210 transition count 152
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 209 transition count 152
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 226 place count 135 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 230 place count 133 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 131 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 130 transition count 78
Applied a total of 233 rules in 77 ms. Remains 130 /253 variables (removed 123) and now considering 78/199 (removed 121) transitions.
// Phase 1: matrix 78 rows 130 cols
[2024-05-21 23:07:24] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 23:07:24] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-21 23:07:24] [INFO ] Invariant cache hit.
[2024-05-21 23:07:24] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2024-05-21 23:07:24] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:07:24] [INFO ] Invariant cache hit.
[2024-05-21 23:07:24] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/253 places, 78/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 650 ms. Remains : 130/253 places, 78/199 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 197 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-00 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 (EQ s49 0) (EQ s123 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 8071 reset in 393 ms.
Product exploration explored 100000 steps with 8119 reset in 289 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 202 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 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 206 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 10 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 23:07:26] [INFO ] Invariant cache hit.
[2024-05-21 23:07:26] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-21 23:07:26] [INFO ] Invariant cache hit.
[2024-05-21 23:07:26] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2024-05-21 23:07:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:07:26] [INFO ] Invariant cache hit.
[2024-05-21 23:07:26] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 767 ms. Remains : 130/130 places, 78/78 transitions.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 159 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 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 228 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8172 reset in 228 ms.
Product exploration explored 100000 steps with 8140 reset in 263 ms.
Built C files in :
/tmp/ltsmin2866965005484522800
[2024-05-21 23:07:28] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2024-05-21 23:07:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:07:28] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2024-05-21 23:07:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:07:28] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2024-05-21 23:07:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:07:28] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2866965005484522800
Running compilation step : cd /tmp/ltsmin2866965005484522800;'/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 422 ms.
Running link step : cd /tmp/ltsmin2866965005484522800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2866965005484522800;'/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/stateBased17108936140706867171.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 8 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 23:07:43] [INFO ] Invariant cache hit.
[2024-05-21 23:07:43] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 23:07:43] [INFO ] Invariant cache hit.
[2024-05-21 23:07:43] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-21 23:07:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:07:43] [INFO ] Invariant cache hit.
[2024-05-21 23:07:43] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 ms. Remains : 130/130 places, 78/78 transitions.
Built C files in :
/tmp/ltsmin11774107083022980363
[2024-05-21 23:07:43] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2024-05-21 23:07:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:07:43] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2024-05-21 23:07:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:07:43] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2024-05-21 23:07:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:07:43] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11774107083022980363
Running compilation step : cd /tmp/ltsmin11774107083022980363;'/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 196 ms.
Running link step : cd /tmp/ltsmin11774107083022980363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11774107083022980363;'/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/stateBased10565043414066265094.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:07:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:07:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:07:58] [INFO ] Time to serialize gal into /tmp/LTL6991791449459282197.gal : 2 ms
[2024-05-21 23:07:58] [INFO ] Time to serialize properties into /tmp/LTL11353013281286213186.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/LTL6991791449459282197.gal' '-t' 'CGAL' '-hoa' '/tmp/aut458502772102979880.hoa' '-atoms' '/tmp/LTL11353013281286213186.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/LTL11353013281286213186.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut458502772102979880.hoa
Detected timeout of ITS tools.
[2024-05-21 23:08:13] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:08:13] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:08:13] [INFO ] Time to serialize gal into /tmp/LTL16556450372123103848.gal : 2 ms
[2024-05-21 23:08:13] [INFO ] Time to serialize properties into /tmp/LTL14320428079840468902.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/LTL16556450372123103848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14320428079840468902.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p163==0)||(p277==1))"))))
Formula 0 simplified : FG!"((p163==0)||(p277==1))"
Detected timeout of ITS tools.
[2024-05-21 23:08:28] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:08:28] [INFO ] Applying decomposition
[2024-05-21 23:08:28] [INFO ] Flatten gal took : 6 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/graph10010632402405718708.txt' '-o' '/tmp/graph10010632402405718708.bin' '-w' '/tmp/graph10010632402405718708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10010632402405718708.bin' '-l' '-1' '-v' '-w' '/tmp/graph10010632402405718708.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:08:29] [INFO ] Decomposing Gal with order
[2024-05-21 23:08:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:08:29] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-21 23:08:29] [INFO ] Flatten gal took : 34 ms
[2024-05-21 23:08:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 8 ms.
[2024-05-21 23:08:29] [INFO ] Time to serialize gal into /tmp/LTL1119005282847538162.gal : 3 ms
[2024-05-21 23:08:29] [INFO ] Time to serialize properties into /tmp/LTL939304156337468521.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/LTL1119005282847538162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL939304156337468521.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F("((i9.i1.u17.p163==0)||(i12.u43.p277==1))"))))
Formula 0 simplified : FG!"((i9.i1.u17.p163==0)||(i12.u43.p277==1))"
Reverse transition relation is NOT exact ! Due to transitions t7_t48_t39, t9_t34, t10_t34, t157_t34, t156_t25, t111_t112_t129_t198_t134_t132_t133_t121_t122...405
Computing Next relation with stutter on 89695 deadlock states
130 unique states visited
0 strongly connected components in search stack
132 transitions explored
67 items max in DFS search stack
846 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.49828,302796,1,0,721028,1508,1398,549021,523,6733,1012878
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-02b-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DES-PT-02b-LTLFireability-00 finished in 75561 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||G(p1)))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Graph (complete) has 454 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 245 transition count 178
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 230 transition count 178
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 230 transition count 167
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 219 transition count 167
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 213 transition count 161
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 213 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 213 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 211 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 211 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 211 transition count 154
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 76 place count 210 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 76 place count 210 transition count 152
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 209 transition count 152
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 226 place count 135 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 230 place count 133 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 131 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 130 transition count 78
Applied a total of 233 rules in 46 ms. Remains 130 /253 variables (removed 123) and now considering 78/199 (removed 121) transitions.
// Phase 1: matrix 78 rows 130 cols
[2024-05-21 23:08:39] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:08:39] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 23:08:39] [INFO ] Invariant cache hit.
[2024-05-21 23:08:39] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-21 23:08:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:08:39] [INFO ] Invariant cache hit.
[2024-05-21 23:08:39] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/253 places, 78/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 328 ms. Remains : 130/253 places, 78/199 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s17 0), p0:(AND (EQ s78 1) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5048 reset in 275 ms.
Product exploration explored 100000 steps with 4982 reset in 289 ms.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 226 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 23:08:41] [INFO ] Invariant cache hit.
[2024-05-21 23:08:41] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 23:08:41] [INFO ] Invariant cache hit.
[2024-05-21 23:08:41] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-21 23:08:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:08:41] [INFO ] Invariant cache hit.
[2024-05-21 23:08:41] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 130/130 places, 78/78 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5028 reset in 245 ms.
Product exploration explored 100000 steps with 5005 reset in 258 ms.
Built C files in :
/tmp/ltsmin15707440336346033254
[2024-05-21 23:08:42] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2024-05-21 23:08:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:08:42] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2024-05-21 23:08:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:08:42] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2024-05-21 23:08:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:08:42] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15707440336346033254
Running compilation step : cd /tmp/ltsmin15707440336346033254;'/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 263 ms.
Running link step : cd /tmp/ltsmin15707440336346033254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15707440336346033254;'/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/stateBased3495912393357737077.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 12 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 23:08:57] [INFO ] Invariant cache hit.
[2024-05-21 23:08:57] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 23:08:58] [INFO ] Invariant cache hit.
[2024-05-21 23:08:58] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-21 23:08:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:08:58] [INFO ] Invariant cache hit.
[2024-05-21 23:08:58] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 299 ms. Remains : 130/130 places, 78/78 transitions.
Built C files in :
/tmp/ltsmin4304065469759286006
[2024-05-21 23:08:58] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2024-05-21 23:08:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:08:58] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2024-05-21 23:08:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:08:58] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2024-05-21 23:08:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:08:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4304065469759286006
Running compilation step : cd /tmp/ltsmin4304065469759286006;'/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 203 ms.
Running link step : cd /tmp/ltsmin4304065469759286006;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4304065469759286006;'/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/stateBased10056722570399089544.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:09:13] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:09:13] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:09:13] [INFO ] Time to serialize gal into /tmp/LTL915173327402012596.gal : 2 ms
[2024-05-21 23:09:13] [INFO ] Time to serialize properties into /tmp/LTL12162894403033147356.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL915173327402012596.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11709011107314134525.hoa' '-atoms' '/tmp/LTL12162894403033147356.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/LTL12162894403033147356.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11709011107314134525.hoa
Detected timeout of ITS tools.
[2024-05-21 23:09:28] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:09:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:09:28] [INFO ] Time to serialize gal into /tmp/LTL810096495703132996.gal : 2 ms
[2024-05-21 23:09:28] [INFO ] Time to serialize properties into /tmp/LTL16075244399572918432.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/LTL810096495703132996.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16075244399572918432.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((G("(p62==0)"))||("((p207==1)&&(p235==1))")))))
Formula 0 simplified : G(F!"(p62==0)" & FG!"((p207==1)&&(p235==1))")
Detected timeout of ITS tools.
[2024-05-21 23:09:43] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:09:43] [INFO ] Applying decomposition
[2024-05-21 23:09:43] [INFO ] Flatten gal took : 5 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/graph2489991537526837119.txt' '-o' '/tmp/graph2489991537526837119.bin' '-w' '/tmp/graph2489991537526837119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2489991537526837119.bin' '-l' '-1' '-v' '-w' '/tmp/graph2489991537526837119.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:09:43] [INFO ] Decomposing Gal with order
[2024-05-21 23:09:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:09:43] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-21 23:09:43] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:09:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2024-05-21 23:09:43] [INFO ] Time to serialize gal into /tmp/LTL4351687855106657720.gal : 3 ms
[2024-05-21 23:09:43] [INFO ] Time to serialize properties into /tmp/LTL10744971448545803141.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/LTL4351687855106657720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10744971448545803141.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((G("(i1.i0.u3.p62==0)"))||("((i11.u27.p207==1)&&(i11.u35.p235==1))")))))
Formula 0 simplified : G(F!"(i1.i0.u3.p62==0)" & FG!"((i11.u27.p207==1)&&(i11.u35.p235==1))")
Reverse transition relation is NOT exact ! Due to transitions t52_t54_t56_t58_t60_t62, t7_t48_t39, t9_t34, t10_t34, t157_t34, t156_t25, t111_t112_t129_t198...438
Computing Next relation with stutter on 89695 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12639615152991193862
[2024-05-21 23:09:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12639615152991193862
Running compilation step : cd /tmp/ltsmin12639615152991193862;'/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 193 ms.
Running link step : cd /tmp/ltsmin12639615152991193862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12639615152991193862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-02b-LTLFireability-01 finished in 94169 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' '!((p0 U X((!p1||G(!p0)))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 246 transition count 192
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 246 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 246 transition count 190
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 243 transition count 187
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 243 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 243 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 242 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 242 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 242 transition count 183
Applied a total of 27 rules in 15 ms. Remains 242 /253 variables (removed 11) and now considering 183/199 (removed 16) transitions.
// Phase 1: matrix 183 rows 242 cols
[2024-05-21 23:10:13] [INFO ] Computed 61 invariants in 7 ms
[2024-05-21 23:10:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 23:10:13] [INFO ] Invariant cache hit.
[2024-05-21 23:10:14] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-21 23:10:14] [INFO ] Invariant cache hit.
[2024-05-21 23:10:14] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 242/253 places, 183/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 242/253 places, 183/199 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
Running random walk in product with property : DES-PT-02b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s70 1), p1:(AND (EQ s108 1) (EQ s208 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 432 edges and 242 vertex of which 237 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-02b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-02b-LTLFireability-02 finished in 1103 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((G(p1)||p0))))'
Support contains 5 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Graph (complete) has 454 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 245 transition count 178
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 230 transition count 178
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 230 transition count 168
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 220 transition count 168
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 215 transition count 163
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 215 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 215 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 213 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 213 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 213 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 71 place count 212 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 71 place count 212 transition count 155
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 211 transition count 155
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 219 place count 138 transition count 82
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 225 place count 135 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 133 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 132 transition count 83
Applied a total of 228 rules in 37 ms. Remains 132 /253 variables (removed 121) and now considering 83/199 (removed 116) transitions.
// Phase 1: matrix 83 rows 132 cols
[2024-05-21 23:10:14] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 23:10:14] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 23:10:14] [INFO ] Invariant cache hit.
[2024-05-21 23:10:15] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-21 23:10:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:10:15] [INFO ] Invariant cache hit.
[2024-05-21 23:10:15] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/253 places, 83/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 132/253 places, 83/199 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s105 1), p0:(OR (NEQ s16 1) (NEQ s107 1) (AND (EQ s1 1) (EQ s42 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5640 reset in 219 ms.
Product exploration explored 100000 steps with 5715 reset in 246 ms.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 326 steps, including 17 resets, run visited all 2 properties in 12 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 83/83 transitions.
Applied a total of 0 rules in 8 ms. Remains 132 /132 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-21 23:10:16] [INFO ] Invariant cache hit.
[2024-05-21 23:10:16] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 23:10:16] [INFO ] Invariant cache hit.
[2024-05-21 23:10:16] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-21 23:10:16] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:10:16] [INFO ] Invariant cache hit.
[2024-05-21 23:10:16] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 132/132 places, 83/83 transitions.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 70 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 758 steps, including 30 resets, run visited all 2 properties in 9 ms. (steps per millisecond=84 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5633 reset in 212 ms.
Product exploration explored 100000 steps with 5661 reset in 228 ms.
Built C files in :
/tmp/ltsmin12783955178422098555
[2024-05-21 23:10:17] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2024-05-21 23:10:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:10:17] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2024-05-21 23:10:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:10:17] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2024-05-21 23:10:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:10:17] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12783955178422098555
Running compilation step : cd /tmp/ltsmin12783955178422098555;'/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 204 ms.
Running link step : cd /tmp/ltsmin12783955178422098555;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12783955178422098555;'/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/stateBased12211368363663064282.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 83/83 transitions.
Applied a total of 0 rules in 14 ms. Remains 132 /132 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-21 23:10:32] [INFO ] Invariant cache hit.
[2024-05-21 23:10:32] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 23:10:32] [INFO ] Invariant cache hit.
[2024-05-21 23:10:32] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-21 23:10:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:10:32] [INFO ] Invariant cache hit.
[2024-05-21 23:10:32] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 132/132 places, 83/83 transitions.
Built C files in :
/tmp/ltsmin17852981560375805287
[2024-05-21 23:10:32] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2024-05-21 23:10:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:10:32] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2024-05-21 23:10:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:10:32] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2024-05-21 23:10:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:10:32] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17852981560375805287
Running compilation step : cd /tmp/ltsmin17852981560375805287;'/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 205 ms.
Running link step : cd /tmp/ltsmin17852981560375805287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17852981560375805287;'/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/stateBased15315498057372470760.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:10:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:10:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:10:47] [INFO ] Time to serialize gal into /tmp/LTL15132710897106690953.gal : 1 ms
[2024-05-21 23:10:47] [INFO ] Time to serialize properties into /tmp/LTL16307973736383492901.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/LTL15132710897106690953.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2197359476849571682.hoa' '-atoms' '/tmp/LTL16307973736383492901.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16307973736383492901.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2197359476849571682.hoa
Detected timeout of ITS tools.
[2024-05-21 23:11:02] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:11:02] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:11:02] [INFO ] Time to serialize gal into /tmp/LTL2276860725709310808.gal : 1 ms
[2024-05-21 23:11:03] [INFO ] Time to serialize properties into /tmp/LTL2014424855800979405.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/LTL2276860725709310808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2014424855800979405.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(("((p57!=1)||(p246!=1))")||((G("(p244==1)"))||("((p7==1)&&(p139==1))"))))))
Formula 0 simplified : G(F!"(p244==1)" & FG(!"((p7==1)&&(p139==1))" & !"((p57!=1)||(p246!=1))"))
Detected timeout of ITS tools.
[2024-05-21 23:11:18] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:11:18] [INFO ] Applying decomposition
[2024-05-21 23:11:18] [INFO ] Flatten gal took : 8 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/graph7433382177777563432.txt' '-o' '/tmp/graph7433382177777563432.bin' '-w' '/tmp/graph7433382177777563432.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7433382177777563432.bin' '-l' '-1' '-v' '-w' '/tmp/graph7433382177777563432.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:11:18] [INFO ] Decomposing Gal with order
[2024-05-21 23:11:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:11:18] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-21 23:11:18] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:11:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2024-05-21 23:11:18] [INFO ] Time to serialize gal into /tmp/LTL5984985307561221806.gal : 2 ms
[2024-05-21 23:11:18] [INFO ] Time to serialize properties into /tmp/LTL8251807132685198683.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/LTL5984985307561221806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8251807132685198683.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(("((u39.p57!=1)||(u39.p246!=1))")||((G("(i13.u38.p244==1)"))||("((u9.p7==1)&&(u9.p139==1))"))))))
Formula 0 simplified : G(F!"(i13.u38.p244==1)" & FG(!"((u9.p7==1)&&(u9.p139==1))" & !"((u39.p57!=1)||(u39.p246!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t157, t7_t48_t39, t26_t35_t73_t36_t38_t49_t65_t66_t67_t68_t69_t70_t71_t50_t52_t54_t5...493
Computing Next relation with stutter on 144064 deadlock states
91 unique states visited
0 strongly connected components in search stack
124 transitions explored
63 items max in DFS search stack
176 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.79602,92204,1,0,214311,3467,1572,173006,625,19864,346824
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-02b-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-02b-LTLFireability-03 finished in 65552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((p0&&F((G(p1)&&F(p2)))))) U G(p0))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 245 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 245 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 245 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 243 transition count 187
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 243 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 243 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 242 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 242 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 242 transition count 184
Applied a total of 26 rules in 13 ms. Remains 242 /253 variables (removed 11) and now considering 184/199 (removed 15) transitions.
// Phase 1: matrix 184 rows 242 cols
[2024-05-21 23:11:20] [INFO ] Computed 61 invariants in 5 ms
[2024-05-21 23:11:20] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 23:11:20] [INFO ] Invariant cache hit.
[2024-05-21 23:11:20] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-21 23:11:20] [INFO ] Invariant cache hit.
[2024-05-21 23:11:20] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 242/253 places, 184/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 242/253 places, 184/199 transitions.
Stuttering acceptance computed with spot in 446 ms :[(NOT p0), (NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-02b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s161 1), p1:(AND (EQ s76 1) (EQ s83 1)), p2:(EQ s85 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25003 reset in 141 ms.
Product exploration explored 100000 steps with 24950 reset in 151 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 434 edges and 242 vertex of which 237 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 96 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 91 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 23:11:22] [INFO ] Invariant cache hit.
[2024-05-21 23:11:22] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2024-05-21 23:11:22] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 9 ms returned sat
[2024-05-21 23:11:22] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:11:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-21 23:11:22] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 9 ms returned sat
[2024-05-21 23:11:22] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 23:11:22] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-21 23:11:22] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 271 steps, including 1 resets, run visited all 2 properties in 5 ms. (steps per millisecond=54 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND p1 p0 (NOT p2))), (F p2), (F (AND p1 (NOT p2))), (F p0), (F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 321 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
[2024-05-21 23:11:23] [INFO ] Invariant cache hit.
[2024-05-21 23:11:23] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-21 23:11:23] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 23 ms returned sat
[2024-05-21 23:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:11:23] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2024-05-21 23:11:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:11:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 23:11:23] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 22 ms returned sat
[2024-05-21 23:11:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:11:24] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-05-21 23:11:24] [INFO ] Computed and/alt/rep : 182/310/182 causal constraints (skipped 1 transitions) in 16 ms.
[2024-05-21 23:11:24] [INFO ] Added : 168 causal constraints over 34 iterations in 807 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 184/184 transitions.
Graph (complete) has 434 edges and 242 vertex of which 237 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 236 transition count 168
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 224 transition count 168
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 25 place count 224 transition count 156
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 212 transition count 156
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 199 place count 137 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 203 place count 135 transition count 83
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 135 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 206 place count 133 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 207 place count 132 transition count 81
Applied a total of 207 rules in 23 ms. Remains 132 /242 variables (removed 110) and now considering 81/184 (removed 103) transitions.
// Phase 1: matrix 81 rows 132 cols
[2024-05-21 23:11:24] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:11:24] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 23:11:24] [INFO ] Invariant cache hit.
[2024-05-21 23:11:25] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-21 23:11:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:11:25] [INFO ] Invariant cache hit.
[2024-05-21 23:11:25] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/242 places, 81/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 132/242 places, 81/184 transitions.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 121 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Finished random walk after 686 steps, including 33 resets, run visited all 7 properties in 17 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1 (NOT p2))), (F p2), (F (AND p1 (NOT p2))), (F p0), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 392 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
[2024-05-21 23:11:26] [INFO ] Invariant cache hit.
[2024-05-21 23:11:26] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-21 23:11:26] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 23:11:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:11:26] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-21 23:11:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:11:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-21 23:11:26] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-21 23:11:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:11:26] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-21 23:11:26] [INFO ] Computed and/alt/rep : 77/205/77 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 23:11:26] [INFO ] Added : 64 causal constraints over 13 iterations in 132 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Stuttering criterion allowed to conclude after 8153 steps with 2734 reset in 19 ms.
FORMULA DES-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-05 finished in 6796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p1||G(p2)))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 245 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 245 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 245 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 242 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 242 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 241 transition count 182
Applied a total of 29 rules in 10 ms. Remains 241 /253 variables (removed 12) and now considering 182/199 (removed 17) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-21 23:11:27] [INFO ] Computed 61 invariants in 8 ms
[2024-05-21 23:11:27] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-21 23:11:27] [INFO ] Invariant cache hit.
[2024-05-21 23:11:27] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 23:11:27] [INFO ] Invariant cache hit.
[2024-05-21 23:11:27] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/253 places, 182/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 241/253 places, 182/199 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-02b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s15 1), p2:(EQ s172 0), p0:(EQ s115 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-06 finished in 629 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(p0)||(F(p1)&&(F(p3)||p2)))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 245 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 245 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 245 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 242 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 242 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 241 transition count 182
Applied a total of 29 rules in 9 ms. Remains 241 /253 variables (removed 12) and now considering 182/199 (removed 17) transitions.
[2024-05-21 23:11:27] [INFO ] Invariant cache hit.
[2024-05-21 23:11:27] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 23:11:27] [INFO ] Invariant cache hit.
[2024-05-21 23:11:28] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-21 23:11:28] [INFO ] Invariant cache hit.
[2024-05-21 23:11:28] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/253 places, 182/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 241/253 places, 182/199 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DES-PT-02b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s91 1), p1:(OR (EQ s100 0) (EQ s225 0)), p2:(OR (EQ s100 0) (EQ s225 0)), p3:(EQ s113 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Detected a total of 64/241 stabilizing places and 57/182 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-02b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-02b-LTLFireability-07 finished in 1088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&X((G(p1) U p2))))))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 246 transition count 192
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 246 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 246 transition count 190
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 243 transition count 187
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 243 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 243 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 242 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 242 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 242 transition count 183
Applied a total of 27 rules in 8 ms. Remains 242 /253 variables (removed 11) and now considering 183/199 (removed 16) transitions.
// Phase 1: matrix 183 rows 242 cols
[2024-05-21 23:11:28] [INFO ] Computed 61 invariants in 1 ms
[2024-05-21 23:11:29] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-21 23:11:29] [INFO ] Invariant cache hit.
[2024-05-21 23:11:29] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-05-21 23:11:29] [INFO ] Invariant cache hit.
[2024-05-21 23:11:29] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 242/253 places, 183/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 489 ms. Remains : 242/253 places, 183/199 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s113 1), p2:(AND (EQ s110 1) (EQ s227 1)), p1:(NEQ s212 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-08 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 245 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 245 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 245 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 242 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 242 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 241 transition count 182
Applied a total of 29 rules in 13 ms. Remains 241 /253 variables (removed 12) and now considering 182/199 (removed 17) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-21 23:11:29] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:11:29] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 23:11:29] [INFO ] Invariant cache hit.
[2024-05-21 23:11:29] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-05-21 23:11:29] [INFO ] Invariant cache hit.
[2024-05-21 23:11:30] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/253 places, 182/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 241/253 places, 182/199 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s73 1) (EQ s75 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 94 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-09 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Graph (complete) has 454 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 245 transition count 178
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 230 transition count 178
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 230 transition count 168
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 220 transition count 168
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 215 transition count 163
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 215 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 215 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 63 place count 215 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 214 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 213 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 213 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 213 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 213 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 212 transition count 157
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 228 place count 133 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 133 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 233 place count 131 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 129 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 128 transition count 80
Applied a total of 236 rules in 25 ms. Remains 128 /253 variables (removed 125) and now considering 80/199 (removed 119) transitions.
// Phase 1: matrix 80 rows 128 cols
[2024-05-21 23:11:30] [INFO ] Computed 58 invariants in 0 ms
[2024-05-21 23:11:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 23:11:30] [INFO ] Invariant cache hit.
[2024-05-21 23:11:30] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-21 23:11:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:11:30] [INFO ] Invariant cache hit.
[2024-05-21 23:11:30] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/253 places, 80/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 128/253 places, 80/199 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s114 1) (EQ s116 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-10 finished in 350 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(p0)&&G(p1))))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 245 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 245 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 245 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 242 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 242 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 242 transition count 184
Applied a total of 26 rules in 6 ms. Remains 242 /253 variables (removed 11) and now considering 184/199 (removed 15) transitions.
// Phase 1: matrix 184 rows 242 cols
[2024-05-21 23:11:30] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 23:11:30] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 23:11:30] [INFO ] Invariant cache hit.
[2024-05-21 23:11:30] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 23:11:30] [INFO ] Invariant cache hit.
[2024-05-21 23:11:30] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 242/253 places, 184/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 242/253 places, 184/199 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s34 1), p0:(EQ s152 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-11 finished in 628 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||G(p1)))||X(p2)||F((p0&&X(F(p2))))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 245 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 245 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 245 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 242 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 242 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 241 transition count 182
Applied a total of 29 rules in 15 ms. Remains 241 /253 variables (removed 12) and now considering 182/199 (removed 17) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-21 23:11:31] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:11:31] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 23:11:31] [INFO ] Invariant cache hit.
[2024-05-21 23:11:31] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-05-21 23:11:31] [INFO ] Invariant cache hit.
[2024-05-21 23:11:31] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/253 places, 182/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 241/253 places, 182/199 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Running random walk in product with property : DES-PT-02b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}]], initial=1, aps=[p0:(EQ s179 1), p1:(EQ s35 1), p2:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-12 finished in 750 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&&(p1||(G((p2||F(p3))) U p3))))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Graph (complete) has 454 edges and 253 vertex of which 247 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 246 transition count 179
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 231 transition count 179
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 231 transition count 168
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 220 transition count 168
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 215 transition count 163
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 215 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 215 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 65 place count 215 transition count 160
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 214 transition count 160
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 213 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 213 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 213 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 73 place count 212 transition count 156
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 219 place count 139 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 223 place count 137 transition count 85
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 137 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 135 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 134 transition count 83
Applied a total of 227 rules in 79 ms. Remains 134 /253 variables (removed 119) and now considering 83/199 (removed 116) transitions.
// Phase 1: matrix 83 rows 134 cols
[2024-05-21 23:11:31] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:11:32] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 23:11:32] [INFO ] Invariant cache hit.
[2024-05-21 23:11:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:11:32] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-21 23:11:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:11:32] [INFO ] Invariant cache hit.
[2024-05-21 23:11:32] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/253 places, 83/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 377 ms. Remains : 134/253 places, 83/199 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : DES-PT-02b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) p1 p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s74 1), p3:(EQ s9 1), p1:(EQ s27 1), p2:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-13 finished in 576 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||X(F((p0&&F(p1))))))))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Graph (complete) has 454 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 245 transition count 180
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 232 transition count 180
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 232 transition count 169
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 221 transition count 169
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 215 transition count 163
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 215 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 215 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 63 place count 215 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 214 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 212 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 212 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 72 place count 212 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 211 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 74 place count 211 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 76 place count 210 transition count 153
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 228 place count 134 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 232 place count 132 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 130 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 235 place count 129 transition count 77
Applied a total of 235 rules in 24 ms. Remains 129 /253 variables (removed 124) and now considering 77/199 (removed 122) transitions.
// Phase 1: matrix 77 rows 129 cols
[2024-05-21 23:11:32] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:11:32] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 23:11:32] [INFO ] Invariant cache hit.
[2024-05-21 23:11:32] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-21 23:11:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:11:32] [INFO ] Invariant cache hit.
[2024-05-21 23:11:32] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/253 places, 77/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 129/253 places, 77/199 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s20 1), p0:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-14 finished in 436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0&&F(G(p1)))))))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 199/199 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 247 transition count 193
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 247 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 247 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 245 transition count 190
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 245 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 245 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 244 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 244 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 244 transition count 186
Applied a total of 22 rules in 15 ms. Remains 244 /253 variables (removed 9) and now considering 186/199 (removed 13) transitions.
// Phase 1: matrix 186 rows 244 cols
[2024-05-21 23:11:32] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:11:33] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 23:11:33] [INFO ] Invariant cache hit.
[2024-05-21 23:11:33] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-21 23:11:33] [INFO ] Invariant cache hit.
[2024-05-21 23:11:33] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 244/253 places, 186/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 472 ms. Remains : 244/253 places, 186/199 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s69 1), p1:(AND (EQ s78 1) (EQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, 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 4 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-15 finished in 713 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||G(p1)))))'
[2024-05-21 23:11:33] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
[2024-05-21 23:11:33] [INFO ] Applying decomposition
[2024-05-21 23:11:33] [INFO ] Flatten gal took : 6 ms
Built C files in :
/tmp/ltsmin1549280021161903260
[2024-05-21 23:11:33] [INFO ] Computing symmetric may disable matrix : 199 transitions.
[2024-05-21 23:11:33] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:11:33] [INFO ] Computing symmetric may enable matrix : 199 transitions.
[2024-05-21 23:11:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:11:33] [INFO ] Computing Do-Not-Accords matrix : 199 transitions.
[2024-05-21 23:11:33] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:11:33] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1549280021161903260
Running compilation step : cd /tmp/ltsmin1549280021161903260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph5606177877085730908.txt' '-o' '/tmp/graph5606177877085730908.bin' '-w' '/tmp/graph5606177877085730908.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5606177877085730908.bin' '-l' '-1' '-v' '-w' '/tmp/graph5606177877085730908.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:11:33] [INFO ] Decomposing Gal with order
[2024-05-21 23:11:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:11:33] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-21 23:11:33] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:11:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2024-05-21 23:11:33] [INFO ] Time to serialize gal into /tmp/LTLFireability13943489199796727817.gal : 4 ms
[2024-05-21 23:11:33] [INFO ] Time to serialize properties into /tmp/LTLFireability10864829105040446938.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/LTLFireability13943489199796727817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10864829105040446938.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...278
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i10.i1.u63.p207==1)&&(i12.i2.u67.p235==1))")||(G("(i3.i0.u16.p62==0)"))))))
Formula 0 simplified : G(F!"(i3.i0.u16.p62==0)" & FG!"((i10.i1.u63.p207==1)&&(i12.i2.u67.p235==1))")
Compilation finished in 393 ms.
Running link step : cd /tmp/ltsmin1549280021161903260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1549280021161903260;'/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)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t58, t145, t156, t157, i0.i1.u17.t115, i1.t130, i1.u9.t135, i1.u9.t136, i1.u10.t132,...817
Computing Next relation with stutter on 254022 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Initializing POR dependencies: labels 201, guards 199
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.332: LTL layer: formula: [](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 0/ 8), 0.332: "[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.332: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.354: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 0.404: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.415: There are 202 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.415: State length is 254, there are 205 groups
pins2lts-mc-linux64( 0/ 8), 0.415: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.415: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.415: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.415: Visible groups: 0 / 205, labels: 2 / 202
pins2lts-mc-linux64( 0/ 8), 0.415: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.415: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.445: [Blue] ~120 levels ~960 states ~1376 transitions
pins2lts-mc-linux64( 3/ 8), 0.455: [Blue] ~114 levels ~1920 states ~2504 transitions
pins2lts-mc-linux64( 7/ 8), 0.468: [Blue] ~100 levels ~3840 states ~4776 transitions
pins2lts-mc-linux64( 7/ 8), 0.499: [Blue] ~100 levels ~7680 states ~9432 transitions
pins2lts-mc-linux64( 7/ 8), 0.595: [Blue] ~119 levels ~15360 states ~19608 transitions
pins2lts-mc-linux64( 7/ 8), 0.747: [Blue] ~119 levels ~30720 states ~39992 transitions
pins2lts-mc-linux64( 7/ 8), 1.071: [Blue] ~119 levels ~61440 states ~80776 transitions
pins2lts-mc-linux64( 7/ 8), 1.709: [Blue] ~123 levels ~122880 states ~166152 transitions
pins2lts-mc-linux64( 5/ 8), 2.756: [Blue] ~212 levels ~245760 states ~302672 transitions
pins2lts-mc-linux64( 5/ 8), 4.459: [Blue] ~212 levels ~491520 states ~610536 transitions
pins2lts-mc-linux64( 5/ 8), 7.199: [Blue] ~212 levels ~983040 states ~1251464 transitions
pins2lts-mc-linux64( 5/ 8), 12.353: [Blue] ~229 levels ~1966080 states ~2515472 transitions
pins2lts-mc-linux64( 6/ 8), 22.489: [Blue] ~240 levels ~3932160 states ~5099968 transitions
pins2lts-mc-linux64( 5/ 8), 42.811: [Blue] ~246 levels ~7864320 states ~10587472 transitions
pins2lts-mc-linux64( 6/ 8), 82.006: [Blue] ~246 levels ~15728640 states ~20612688 transitions
pins2lts-mc-linux64( 6/ 8), 164.323: [Blue] ~246 levels ~31457280 states ~42053712 transitions
pins2lts-mc-linux64( 6/ 8), 322.542: [Blue] ~67181 levels ~62914560 states ~87786352 transitions
pins2lts-mc-linux64( 0/ 8), 626.497: [Blue] ~468 levels ~125829120 states ~178466296 transitions
pins2lts-mc-linux64( 2/ 8), 809.003: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 809.179:
pins2lts-mc-linux64( 0/ 8), 809.179: Explored 123372038 states 155357828 transitions, fanout: 1.259
pins2lts-mc-linux64( 0/ 8), 809.179: Total exploration time 808.750 sec (808.580 sec minimum, 808.621 sec on average)
pins2lts-mc-linux64( 0/ 8), 809.179: States per second: 152547, Transitions per second: 192096
pins2lts-mc-linux64( 0/ 8), 809.179:
pins2lts-mc-linux64( 0/ 8), 809.179: State space has 134217330 states, 23925926 are accepting
pins2lts-mc-linux64( 0/ 8), 809.179: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 809.179: blue states: 123372038 (91.92%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 809.179: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 809.179: all-red states: 41359348 (30.82%), bogus 11058 (0.01%)
pins2lts-mc-linux64( 0/ 8), 809.179:
pins2lts-mc-linux64( 0/ 8), 809.179: Total memory used for local state coloring: 203.9MB
pins2lts-mc-linux64( 0/ 8), 809.179:
pins2lts-mc-linux64( 0/ 8), 809.179: Queue width: 8B, total height: 13361666, memory: 101.94MB
pins2lts-mc-linux64( 0/ 8), 809.179: Tree memory: 1063.2MB, 8.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 809.179: Tree fill ratio (roots/leafs): 99.0%/15.0%
pins2lts-mc-linux64( 0/ 8), 809.179: Stored 200 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 809.179: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 809.179: Est. total memory use: 1165.1MB (~1125.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1549280021161903260;'/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)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1549280021161903260;'/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)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-21 23:32:58] [INFO ] Applying decomposition
[2024-05-21 23:32:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:32:58] [INFO ] Decomposing Gal with order
[2024-05-21 23:32:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:32:58] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-21 23:32:58] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:32:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 8 ms.
[2024-05-21 23:32:58] [INFO ] Time to serialize gal into /tmp/LTLFireability404967100688026302.gal : 4 ms
[2024-05-21 23:32:58] [INFO ] Time to serialize properties into /tmp/LTLFireability17412163515314949101.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/LTLFireability404967100688026302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17412163515314949101.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.u78.p207==1)&&(i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.u93.p235==1))")||(G("(i1.i0.i0.i0.i0.u18.p62=...165
Formula 0 simplified : G(F!"(i1.i0.i0.i0.i0.u18.p62==0)" & FG!"((i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.u78.p207==1)&&(i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.u93.p235==1)...158
Reverse transition relation is NOT exact ! Due to transitions t145, i0.t0, i1.i0.i0.i0.u19.t115, i1.i0.i0.i0.i0.u18.t119, i1.i0.i0.i0.i0.i0.u17.t122, i1.i0...1778
Detected timeout of ITS tools.
[2024-05-21 23:54:49] [INFO ] Flatten gal took : 197 ms
[2024-05-21 23:54:49] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-21 23:54:50] [INFO ] Transformed 253 places.
[2024-05-21 23:54:50] [INFO ] Transformed 199 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 23:54:50] [INFO ] Time to serialize gal into /tmp/LTLFireability9990592158194876647.gal : 4 ms
[2024-05-21 23:54:50] [INFO ] Time to serialize properties into /tmp/LTLFireability2137214962238359111.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/LTLFireability9990592158194876647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2137214962238359111.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p207==1)&&(p235==1))")||(G("(p62==0)"))))))
Formula 0 simplified : G(F!"(p62==0)" & FG!"((p207==1)&&(p235==1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t10, t17, t25, t34, t37, t48, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, ...441
Computing Next relation with stutter on 254022 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12505856 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16140532 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="DES-PT-02b"
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 DES-PT-02b, 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 r109-tall-171624208500403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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