Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477500276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HirschbergSinclair-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477500276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 8.1K Apr 29 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 29 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 9 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 136K May 10 09:34 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 HirschbergSinclair-PT-10-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652736498993

Running Version 202205111006
[2022-05-16 21:28:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 21:28:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 21:28:21] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2022-05-16 21:28:21] [INFO ] Transformed 260 places.
[2022-05-16 21:28:21] [INFO ] Transformed 236 transitions.
[2022-05-16 21:28:21] [INFO ] Parsed PT model containing 260 places and 236 transitions in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 236/236 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 250 transition count 236
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 17 place count 243 transition count 229
Iterating global reduction 1 with 7 rules applied. Total rules applied 24 place count 243 transition count 229
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 239 transition count 225
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 239 transition count 225
Applied a total of 32 rules in 83 ms. Remains 239 /260 variables (removed 21) and now considering 225/236 (removed 11) transitions.
// Phase 1: matrix 225 rows 239 cols
[2022-05-16 21:28:21] [INFO ] Computed 14 place invariants in 27 ms
[2022-05-16 21:28:22] [INFO ] Implicit Places using invariants in 517 ms returned []
// Phase 1: matrix 225 rows 239 cols
[2022-05-16 21:28:22] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-16 21:28:22] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 239 cols
[2022-05-16 21:28:22] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-16 21:28:23] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/260 places, 225/236 transitions.
Finished structural reductions, in 1 iterations. Remains : 239/260 places, 225/236 transitions.
Support contains 35 out of 239 places after structural reductions.
[2022-05-16 21:28:23] [INFO ] Flatten gal took : 103 ms
[2022-05-16 21:28:23] [INFO ] Flatten gal took : 50 ms
[2022-05-16 21:28:23] [INFO ] Input system was already deterministic with 225 transitions.
Support contains 34 out of 239 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 778 ms. (steps per millisecond=12 ) properties (out of 31) seen :29
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 239 cols
[2022-05-16 21:28:24] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-16 21:28:24] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 42 ms returned sat
[2022-05-16 21:28:24] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 239 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 239 transition count 225
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F(!(p1 U p1))&&F(!p1)&&G(!p1))))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 233 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 233 transition count 219
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 230 transition count 216
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 230 transition count 216
Applied a total of 18 rules in 47 ms. Remains 230 /239 variables (removed 9) and now considering 216/225 (removed 9) transitions.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:28:25] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 21:28:25] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:28:25] [INFO ] Computed 14 place invariants in 12 ms
[2022-05-16 21:28:26] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:28:26] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-16 21:28:26] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/239 places, 216/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/239 places, 216/225 transitions.
Stuttering acceptance computed with spot in 493 ms :[true, (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), p1]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s13 1) (GEQ s90 1)), p1:(AND (GEQ s5 1) (GEQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 102 steps with 0 reset in 7 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-00 finished in 1947 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||(G(!p2)&&p1)) U X(X(p3))))'
Support contains 7 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 233 transition count 219
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 233 transition count 219
Applied a total of 12 rules in 30 ms. Remains 233 /239 variables (removed 6) and now considering 219/225 (removed 6) transitions.
// Phase 1: matrix 219 rows 233 cols
[2022-05-16 21:28:27] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-16 21:28:27] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 219 rows 233 cols
[2022-05-16 21:28:27] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 21:28:28] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 233 cols
[2022-05-16 21:28:28] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 21:28:28] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 233/239 places, 219/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 233/239 places, 219/225 transitions.
Stuttering acceptance computed with spot in 1123 ms :[(NOT p3), (NOT p3), (AND (NOT p3) p2), (NOT p3), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) p2), (NOT p3), true, (AND p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (NOT p3), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p2 (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p2 (NOT p3)), p2, (NOT p0), (AND p2 (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR p0 (AND p1 (NOT p2))), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=p2, acceptance={} source=2 dest: 6}, { cond=(NOT p2), acceptance={} source=2 dest: 8}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 10}, { cond=(OR p0 (AND p1 (NOT p2))), acceptance={} source=3 dest: 11}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={} source=3 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 13}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}, { cond=p0, acceptance={} source=4 dest: 14}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND p0 p2), acceptance={} source=5 dest: 14}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 15}], [{ cond=(NOT p3), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=8 dest: 16}], [{ cond=(NOT p3), acceptance={} source=9 dest: 6}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=10 dest: 8}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3))), acceptance={0} source=11 dest: 9}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0} source=11 dest: 10}, { cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={0} source=11 dest: 11}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={0} source=11 dest: 12}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=11 dest: 13}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=12 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=12 dest: 14}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=13 dest: 8}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=13 dest: 14}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=13 dest: 15}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=14 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={} source=14 dest: 17}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=15 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=15 dest: 16}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=15 dest: 17}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=15 dest: 18}], [{ cond=p2, acceptance={} source=16 dest: 7}, { cond=(NOT p2), acceptance={} source=16 dest: 16}], [{ cond=(NOT p0), acceptance={} source=17 dest: 7}, { cond=p0, acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p0) p2), acceptance={} source=18 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=18 dest: 16}, { cond=(AND p0 p2), acceptance={} source=18 dest: 17}, { cond=(AND p0 (NOT p2)), acceptance={} source=18 dest: 18}]], initial=0, aps=[p0:(GEQ s39 1), p1:(AND (GEQ s17 1) (GEQ s56 1)), p2:(AND (GEQ s11 1) (GEQ s162 1)), p3:(OR (NOT (AND (GEQ s3 1) (GEQ s133 1))) (AND (GEQ s11 1) (GEQ s162...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 974 ms.
Product exploration explored 100000 steps with 33333 reset in 518 ms.
Computed a total of 233 stabilizing places and 219 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 233 transition count 219
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT p0)), (X (NOT (OR p0 (AND p1 (NOT p2))))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X p3)), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2 (NOT p3)))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3)))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p3))
Knowledge based reduction with 30 factoid took 1603 ms. Reduced automaton from 19 states, 51 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-02 finished in 5580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(p1))&&p0))))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 234 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 234 transition count 220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 232 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 232 transition count 218
Applied a total of 14 rules in 28 ms. Remains 232 /239 variables (removed 7) and now considering 218/225 (removed 7) transitions.
// Phase 1: matrix 218 rows 232 cols
[2022-05-16 21:28:32] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:28:33] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 218 rows 232 cols
[2022-05-16 21:28:33] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 21:28:33] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 974 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 232 cols
[2022-05-16 21:28:33] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-16 21:28:34] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/239 places, 218/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/239 places, 218/225 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s13 1) (GEQ s92 1) (OR (GEQ s51 1) (GEQ s35 1))), p1:(LT s51 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 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-04 finished in 1532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&p1)))'
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Reduce places removed 10 places and 10 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 229 transition count 121
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 135 transition count 121
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 194 place count 129 transition count 115
Iterating global reduction 2 with 6 rules applied. Total rules applied 200 place count 129 transition count 115
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 203 place count 129 transition count 112
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 206 place count 126 transition count 112
Applied a total of 206 rules in 33 ms. Remains 126 /239 variables (removed 113) and now considering 112/225 (removed 113) transitions.
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 21:28:34] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:28:34] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 21:28:34] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:28:34] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2022-05-16 21:28:35] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 21:28:35] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:28:35] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/239 places, 112/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/239 places, 112/225 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LT s50 1), p0:(LT s103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 820 reset in 470 ms.
Product exploration explored 100000 steps with 820 reset in 310 ms.
Computed a total of 126 stabilizing places and 112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 126 transition count 112
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 472 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 107 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 9 factoid took 508 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 112/112 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 21:28:37] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:28:37] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 21:28:37] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:28:38] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2022-05-16 21:28:38] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 21:28:38] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 21:28:38] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 112/112 transitions.
Computed a total of 126 stabilizing places and 112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 126 transition count 112
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 376 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 113 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X p0), (X (NOT (OR (NOT p1) (NOT p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (OR (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (OR (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 9 factoid took 559 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 819 reset in 213 ms.
Product exploration explored 100000 steps with 819 reset in 407 ms.
Built C files in :
/tmp/ltsmin14425606599181298014
[2022-05-16 21:28:40] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2022-05-16 21:28:40] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:28:40] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2022-05-16 21:28:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:28:40] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2022-05-16 21:28:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:28:40] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14425606599181298014
Running compilation step : cd /tmp/ltsmin14425606599181298014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 722 ms.
Running link step : cd /tmp/ltsmin14425606599181298014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14425606599181298014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16950381101437585088.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 112/112 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 21:28:55] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:28:55] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 21:28:55] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:28:55] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2022-05-16 21:28:55] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 21:28:55] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:28:56] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 112/112 transitions.
Built C files in :
/tmp/ltsmin4521078944664920995
[2022-05-16 21:28:56] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2022-05-16 21:28:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:28:56] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2022-05-16 21:28:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:28:56] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2022-05-16 21:28:56] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:28:56] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4521078944664920995
Running compilation step : cd /tmp/ltsmin4521078944664920995;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 381 ms.
Running link step : cd /tmp/ltsmin4521078944664920995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4521078944664920995;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16149309560609414810.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 21:29:11] [INFO ] Flatten gal took : 13 ms
[2022-05-16 21:29:11] [INFO ] Flatten gal took : 11 ms
[2022-05-16 21:29:11] [INFO ] Time to serialize gal into /tmp/LTL16934629958456508809.gal : 4 ms
[2022-05-16 21:29:11] [INFO ] Time to serialize properties into /tmp/LTL15284065814283606667.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16934629958456508809.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15284065814283606667.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1693462...268
Read 1 LTL properties
Checking formula 0 : !((F((G("(rcv_right_election_10_4_7_3<1)"))&&("(rcv_left_reply_10_2_9<1)"))))
Formula 0 simplified : !F("(rcv_left_reply_10_2_9<1)" & G"(rcv_right_election_10_4_7_3<1)")
Reverse transition relation is NOT exact ! Due to transitions t12.t13, t16.t17, t22.t23, t28.t29, t34.t35, t39.t40, t43.t44, t47.t48, t192.t193, t212.t213,...256
Computing Next relation with stutter on 2.34375e+07 deadlock states
Detected timeout of ITS tools.
[2022-05-16 21:29:26] [INFO ] Flatten gal took : 11 ms
[2022-05-16 21:29:26] [INFO ] Applying decomposition
[2022-05-16 21:29:26] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7373424575266729100.txt' '-o' '/tmp/graph7373424575266729100.bin' '-w' '/tmp/graph7373424575266729100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7373424575266729100.bin' '-l' '-1' '-v' '-w' '/tmp/graph7373424575266729100.weights' '-q' '0' '-e' '0.001'
[2022-05-16 21:29:26] [INFO ] Decomposing Gal with order
[2022-05-16 21:29:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 21:29:26] [INFO ] Removed a total of 77 redundant transitions.
[2022-05-16 21:29:26] [INFO ] Flatten gal took : 111 ms
[2022-05-16 21:29:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 14 ms.
[2022-05-16 21:29:26] [INFO ] Time to serialize gal into /tmp/LTL17778756390438943888.gal : 8 ms
[2022-05-16 21:29:26] [INFO ] Time to serialize properties into /tmp/LTL8431049970977333757.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17778756390438943888.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8431049970977333757.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1777875...246
Read 1 LTL properties
Checking formula 0 : !((F((G("(i3.i0.u42.rcv_right_election_10_4_7_3<1)"))&&("(i1.u18.rcv_left_reply_10_2_9<1)"))))
Formula 0 simplified : !F("(i1.u18.rcv_left_reply_10_2_9<1)" & G"(i3.i0.u42.rcv_right_election_10_4_7_3<1)")
Reverse transition relation is NOT exact ! Due to transitions t16_t17, t28_t29, t43_t44, t133_t134, t192_t193, t212_t213, i1.t47_t48, i2.t12_t13, i3.t22_t2...269
Computing Next relation with stutter on 2.34375e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8291879559291303049
[2022-05-16 21:29:41] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8291879559291303049
Running compilation step : cd /tmp/ltsmin8291879559291303049;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin8291879559291303049;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8291879559291303049;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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 HirschbergSinclair-PT-10-LTLFireability-06 finished in 82420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U p1))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 233 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 233 transition count 219
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 230 transition count 216
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 230 transition count 216
Applied a total of 18 rules in 12 ms. Remains 230 /239 variables (removed 9) and now considering 216/225 (removed 9) transitions.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:29:56] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:29:57] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:29:57] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:29:57] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:29:57] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-16 21:29:58] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/239 places, 216/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/239 places, 216/225 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s13 1) (GEQ s222 1)), p0:(AND (GEQ s17 1) (GEQ s68 1))], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-07 finished in 1403 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F((p1&&F((G(p2)||X(p3))))))||p0))))'
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 233 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 233 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 231 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 231 transition count 217
Applied a total of 16 rules in 14 ms. Remains 231 /239 variables (removed 8) and now considering 217/225 (removed 8) transitions.
// Phase 1: matrix 217 rows 231 cols
[2022-05-16 21:29:58] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:29:58] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 217 rows 231 cols
[2022-05-16 21:29:58] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:29:59] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 231 cols
[2022-05-16 21:29:59] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:29:59] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 231/239 places, 217/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/239 places, 217/225 transitions.
Stuttering acceptance computed with spot in 155 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))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s34 1)), p1:(OR (LT s7 1) (LT s34 1)), p2:(OR (LT s13 1) (LT s166 1)), p3:(AND (GEQ s11 1) (GEQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 595 reset in 424 ms.
Product exploration explored 100000 steps with 599 reset in 310 ms.
Computed a total of 231 stabilizing places and 217 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 217
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2 (NOT p3)), (X p0), true, (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1)), (F (G p2)), (F (G (NOT p3)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 9 factoid took 542 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-10-LTLFireability-08 finished in 2852 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0||(!F(p2)&&p1)) U X(!X(p3)))))'
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 233 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 233 transition count 219
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 230 transition count 216
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 230 transition count 216
Applied a total of 18 rules in 18 ms. Remains 230 /239 variables (removed 9) and now considering 216/225 (removed 9) transitions.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:30:01] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:30:01] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:30:01] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:30:02] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:30:02] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:30:02] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/239 places, 216/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/239 places, 216/225 transitions.
Stuttering acceptance computed with spot in 596 ms :[p3, p3, (AND p3 p2), p3, p3, true, (AND p2 p3), p3, (AND p3 p2), p3, p2]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR p0 (AND p1 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(OR p0 (AND p1 (NOT p2))), acceptance={} source=3 dest: 9}], [{ cond=p3, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 p3), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=6 dest: 10}], [{ cond=p3, acceptance={} source=7 dest: 4}], [{ cond=(AND p2 p3), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=8 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3)), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={0} source=9 dest: 8}, { cond=(OR (AND p0 p3) (AND p1 (NOT p2) p3)), acceptance={0} source=9 dest: 9}], [{ cond=p2, acceptance={} source=10 dest: 5}, { cond=(NOT p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(LT s33 1), p1:(AND (GEQ s3 1) (GEQ s196 1)), p2:(AND (GEQ s11 1) (GEQ s167 1)), p3:(AND (GEQ s3 1) (GEQ s196 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 496 ms.
Product exploration explored 100000 steps with 25057 reset in 373 ms.
Computed a total of 230 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p0 (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3))))), (X (X (NOT (OR (AND p0 p3) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1012 ms. Reduced automaton from 11 states, 22 edges and 4 AP to 11 states, 22 edges and 4 AP.
Stuttering acceptance computed with spot in 634 ms :[p3, p3, (AND p3 p2), p3, p3, true, (AND p2 p3), p3, (AND p3 p2), p3, p2]
Incomplete random walk after 10000 steps, including 42 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:30:06] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:30:06] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 63 ms returned sat
[2022-05-16 21:30:07] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-05-16 21:30:07] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 65 ms returned sat
[2022-05-16 21:30:07] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-05-16 21:30:07] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-16 21:30:07] [INFO ] After 696ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 216/216 transitions.
Graph (complete) has 439 edges and 230 vertex of which 228 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 228 transition count 140
Reduce places removed 74 places and 0 transitions.
Graph (complete) has 280 edges and 154 vertex of which 144 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 144 transition count 140
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 162 place count 144 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 142 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 142 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 140 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 140 transition count 126
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 178 place count 140 transition count 118
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 186 place count 132 transition count 118
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 194 place count 124 transition count 110
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 6 rules applied. Total rules applied 200 place count 122 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 204 place count 118 transition count 106
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 204 place count 118 transition count 93
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 230 place count 105 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 234 place count 103 transition count 91
Applied a total of 234 rules in 78 ms. Remains 103 /230 variables (removed 127) and now considering 91/216 (removed 125) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/230 places, 91/216 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Finished probabilistic random walk after 10707 steps, run visited all 2 properties in 140 ms. (steps per millisecond=76 )
Probabilistic random walk after 10707 steps, saw 3251 distinct states, run finished after 140 ms. (steps per millisecond=76 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p0 (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3))))), (X (X (NOT (OR (AND p0 p3) (AND p1 (NOT p2) p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (G (NOT (AND p3 p2))), (G (NOT (OR (AND (NOT p0) p3 p2) (AND (NOT p0) p3 (NOT p1)))))]
False Knowledge obtained : [(F p3), (F p2), (F (AND p3 (NOT p2))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (AND (NOT p2) p1)))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) p3 (NOT p2) p1)), (F (OR (AND p0 p3) (AND p3 (NOT p2) p1)))]
Knowledge based reduction with 17 factoid took 2094 ms. Reduced automaton from 11 states, 22 edges and 4 AP to 10 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 515 ms :[p3, p3, (AND p3 p2), (OR (AND p1 (NOT p2) p3) (AND p0 p3)), p3, true, (AND p3 p2), (AND p2 p3), p3, p2]
Stuttering acceptance computed with spot in 514 ms :[p3, p3, (AND p3 p2), (OR (AND p1 (NOT p2) p3) (AND p0 p3)), p3, true, (AND p3 p2), (AND p2 p3), p3, p2]
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:30:11] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:30:11] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:30:11] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:30:12] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:30:12] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-16 21:30:12] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 216/216 transitions.
Computed a total of 230 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (OR (AND (NOT p2) p1) p0)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3)))), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 1000 ms. Reduced automaton from 10 states, 17 edges and 4 AP to 10 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 509 ms :[p3, p3, (AND p3 p2), (OR (AND p1 (NOT p2) p3) (AND p0 p3)), p3, true, (AND p3 p2), (AND p2 p3), p3, p2]
Incomplete random walk after 10000 steps, including 42 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:30:14] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:30:15] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 67 ms returned sat
[2022-05-16 21:30:15] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 21:30:15] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 65 ms returned sat
[2022-05-16 21:30:15] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 21:30:15] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-05-16 21:30:15] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 216/216 transitions.
Graph (complete) has 439 edges and 230 vertex of which 228 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 228 transition count 140
Reduce places removed 74 places and 0 transitions.
Graph (complete) has 280 edges and 154 vertex of which 144 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 144 transition count 140
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 162 place count 144 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 142 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 142 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 140 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 140 transition count 126
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 178 place count 140 transition count 118
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 186 place count 132 transition count 118
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 194 place count 124 transition count 110
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 6 rules applied. Total rules applied 200 place count 122 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 204 place count 118 transition count 106
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 204 place count 118 transition count 93
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 230 place count 105 transition count 93
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 6 with 4 rules applied. Total rules applied 234 place count 103 transition count 91
Applied a total of 234 rules in 48 ms. Remains 103 /230 variables (removed 127) and now considering 91/216 (removed 125) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/230 places, 91/216 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Finished probabilistic random walk after 10707 steps, run visited all 2 properties in 163 ms. (steps per millisecond=65 )
Probabilistic random walk after 10707 steps, saw 3251 distinct states, run finished after 163 ms. (steps per millisecond=65 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (OR (AND (NOT p2) p1) p0)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3)))), (F (G (NOT p2))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p3)))]
False Knowledge obtained : [(F p3), (F p2), (F (AND (NOT p0) p3)), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (F (NOT (OR p0 (AND p1 (NOT p2))))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 10 factoid took 1170 ms. Reduced automaton from 10 states, 17 edges and 4 AP to 10 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 490 ms :[p3, p3, (AND p3 p2), (OR (AND p1 (NOT p2) p3) (AND p0 p3)), p3, true, (AND p3 p2), (AND p2 p3), p3, p2]
Stuttering acceptance computed with spot in 477 ms :[p3, p3, (AND p3 p2), (OR (AND p1 (NOT p2) p3) (AND p0 p3)), p3, true, (AND p3 p2), (AND p2 p3), p3, p2]
Stuttering acceptance computed with spot in 493 ms :[p3, p3, (AND p3 p2), (OR (AND p1 (NOT p2) p3) (AND p0 p3)), p3, true, (AND p3 p2), (AND p2 p3), p3, p2]
Product exploration explored 100000 steps with 24991 reset in 540 ms.
Product exploration explored 100000 steps with 24952 reset in 409 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false, false, true]
Stuttering acceptance computed with spot in 601 ms :[p3, p3, (AND p3 p2), (OR (AND p1 (NOT p2) p3) (AND p0 p3)), p3, true, (AND p3 p2), (AND p2 p3), p3, p2]
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 216/216 transitions.
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 230 transition count 216
Deduced a syphon composed of 74 places in 1 ms
Applied a total of 74 rules in 33 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2022-05-16 21:30:21] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:30:21] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:30:21] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/230 places, 216/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 216/216 transitions.
Product exploration explored 100000 steps with 25038 reset in 603 ms.
Product exploration explored 100000 steps with 25021 reset in 552 ms.
Built C files in :
/tmp/ltsmin1021697999163479411
[2022-05-16 21:30:22] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1021697999163479411
Running compilation step : cd /tmp/ltsmin1021697999163479411;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 492 ms.
Running link step : cd /tmp/ltsmin1021697999163479411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1021697999163479411;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2516360862029882274.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 230 /230 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:30:37] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:30:37] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:30:37] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:30:38] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:30:38] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:30:38] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin12093077048972289740
[2022-05-16 21:30:38] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12093077048972289740
Running compilation step : cd /tmp/ltsmin12093077048972289740;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 764 ms.
Running link step : cd /tmp/ltsmin12093077048972289740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12093077048972289740;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17290535052749992074.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 21:30:54] [INFO ] Flatten gal took : 32 ms
[2022-05-16 21:30:54] [INFO ] Flatten gal took : 28 ms
[2022-05-16 21:30:54] [INFO ] Time to serialize gal into /tmp/LTL3531390573902326483.gal : 7 ms
[2022-05-16 21:30:54] [INFO ] Time to serialize properties into /tmp/LTL13466742668133799251.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3531390573902326483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13466742668133799251.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3531390...267
Read 1 LTL properties
Checking formula 0 : !((G((("(rcv_right_election_4_0_1_3<1)")||(((!(F("((newmsg6>=1)&&(reply_10_3_to_left_7>=1))")))&&("(newmsg2>=1)"))&&("(election_10_4_8...236
Formula 0 simplified : !G(("(rcv_right_election_4_0_1_3<1)" | ("(election_10_4_8_to_left_3>=1)" & "(newmsg2>=1)" & !F"((newmsg6>=1)&&(reply_10_3_to_left_7>...217
Detected timeout of ITS tools.
[2022-05-16 21:31:09] [INFO ] Flatten gal took : 16 ms
[2022-05-16 21:31:09] [INFO ] Applying decomposition
[2022-05-16 21:31:09] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph86672663608915158.txt' '-o' '/tmp/graph86672663608915158.bin' '-w' '/tmp/graph86672663608915158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph86672663608915158.bin' '-l' '-1' '-v' '-w' '/tmp/graph86672663608915158.weights' '-q' '0' '-e' '0.001'
[2022-05-16 21:31:09] [INFO ] Decomposing Gal with order
[2022-05-16 21:31:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 21:31:09] [INFO ] Removed a total of 31 redundant transitions.
[2022-05-16 21:31:09] [INFO ] Flatten gal took : 35 ms
[2022-05-16 21:31:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 21:31:09] [INFO ] Time to serialize gal into /tmp/LTL3647645472956588773.gal : 6 ms
[2022-05-16 21:31:09] [INFO ] Time to serialize properties into /tmp/LTL8734684348251324305.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3647645472956588773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8734684348251324305.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3647645...245
Read 1 LTL properties
Checking formula 0 : !((G((("(i2.u10.rcv_right_election_4_0_1_3<1)")||(((!(F("((i4.u4.newmsg6>=1)&&(i4.u21.reply_10_3_to_left_7>=1))")))&&("(i0.u1.newmsg2>...280
Formula 0 simplified : !G(("(i2.u10.rcv_right_election_4_0_1_3<1)" | ("(i0.u1.election_10_4_8_to_left_3>=1)" & "(i0.u1.newmsg2>=1)" & !F"((i4.u4.newmsg6>=1...261
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, t8, t9, t19, t31, t37, t193, t224, i0.t15, i0.u1.t13, i1.t50, i1....398
Computing Next relation with stutter on 2.34375e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11904324061381561984
[2022-05-16 21:31:24] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11904324061381561984
Running compilation step : cd /tmp/ltsmin11904324061381561984;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 469 ms.
Running link step : cd /tmp/ltsmin11904324061381561984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11904324061381561984;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((((LTLAPp0==true)||(!<>((LTLAPp2==true))&&(LTLAPp1==true))) U X(!X((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-10-LTLFireability-09 finished in 98369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((false U X(p0))||p0))))'
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 233 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 233 transition count 219
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 230 transition count 216
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 230 transition count 216
Applied a total of 18 rules in 28 ms. Remains 230 /239 variables (removed 9) and now considering 216/225 (removed 9) transitions.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:31:39] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:31:39] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:31:39] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:31:40] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:31:40] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 21:31:40] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/239 places, 216/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/239 places, 216/225 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s13 1) (GEQ s140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 228 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-10 finished in 1274 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(!(X(!p0)||p1))) U p0)))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 233 transition count 219
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 233 transition count 219
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 230 transition count 216
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 230 transition count 216
Applied a total of 18 rules in 14 ms. Remains 230 /239 variables (removed 9) and now considering 216/225 (removed 9) transitions.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:31:40] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:31:40] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:31:40] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:31:41] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:31:41] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:31:42] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/239 places, 216/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/239 places, 216/225 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s175 1)), p1:(AND (GEQ s5 1) (GEQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 576 reset in 360 ms.
Product exploration explored 100000 steps with 576 reset in 402 ms.
Computed a total of 230 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 230 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 616 ms. Reduced automaton from 5 states, 14 edges and 2 AP to 6 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 316 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (NOT p0), false]
Finished random walk after 207 steps, including 0 resets, run visited all 5 properties in 13 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F p0)]
Knowledge based reduction with 11 factoid took 800 ms. Reduced automaton from 6 states, 17 edges and 2 AP to 6 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (NOT p0), false]
// Phase 1: matrix 216 rows 230 cols
[2022-05-16 21:31:45] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:31:45] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 33 ms returned sat
[2022-05-16 21:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:31:46] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2022-05-16 21:31:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:31:46] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 31 ms returned sat
[2022-05-16 21:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:31:47] [INFO ] [Nat]Absence check using state equation in 854 ms returned sat
[2022-05-16 21:31:47] [INFO ] Computed and/alt/rep : 100/104/100 causal constraints (skipped 106 transitions) in 16 ms.
[2022-05-16 21:31:48] [INFO ] Added : 74 causal constraints over 15 iterations in 1208 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 216/216 transitions.
Reduce places removed 8 places and 8 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 222 transition count 133
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 147 transition count 133
Applied a total of 150 rules in 19 ms. Remains 147 /230 variables (removed 83) and now considering 133/216 (removed 83) transitions.
// Phase 1: matrix 133 rows 147 cols
[2022-05-16 21:31:48] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:31:49] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 133 rows 147 cols
[2022-05-16 21:31:49] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:31:49] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2022-05-16 21:31:49] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 133 rows 147 cols
[2022-05-16 21:31:49] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:31:49] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/230 places, 133/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/230 places, 133/216 transitions.
Computed a total of 147 stabilizing places and 133 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 133
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 873 ms. Reduced automaton from 6 states, 17 edges and 2 AP to 6 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (NOT p0), false]
Finished random walk after 129 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F p0)]
Knowledge based reduction with 14 factoid took 976 ms. Reduced automaton from 6 states, 17 edges and 2 AP to 6 states, 17 edges and 2 AP.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (NOT p0), false]
// Phase 1: matrix 133 rows 147 cols
[2022-05-16 21:31:52] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:31:52] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 25 ms returned sat
[2022-05-16 21:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:31:53] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2022-05-16 21:31:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:31:53] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 25 ms returned sat
[2022-05-16 21:31:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:31:53] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2022-05-16 21:31:53] [INFO ] Computed and/alt/rep : 96/102/96 causal constraints (skipped 22 transitions) in 18 ms.
[2022-05-16 21:31:53] [INFO ] Added : 53 causal constraints over 11 iterations in 310 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 359 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (NOT p0), false]
Product exploration explored 100000 steps with 982 reset in 310 ms.
Product exploration explored 100000 steps with 982 reset in 351 ms.
Built C files in :
/tmp/ltsmin13433823992403896014
[2022-05-16 21:31:54] [INFO ] Computing symmetric may disable matrix : 133 transitions.
[2022-05-16 21:31:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:31:54] [INFO ] Computing symmetric may enable matrix : 133 transitions.
[2022-05-16 21:31:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:31:55] [INFO ] Computing Do-Not-Accords matrix : 133 transitions.
[2022-05-16 21:31:55] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:31:55] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13433823992403896014
Running compilation step : cd /tmp/ltsmin13433823992403896014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 625 ms.
Running link step : cd /tmp/ltsmin13433823992403896014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13433823992403896014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10562078325124259279.hoa' '--buchi-type=spotba'
LTSmin run took 611 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-10-LTLFireability-11 finished in 15611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Reduce places removed 10 places and 10 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 229 transition count 120
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 134 transition count 120
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 195 place count 129 transition count 115
Iterating global reduction 2 with 5 rules applied. Total rules applied 200 place count 129 transition count 115
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 203 place count 129 transition count 112
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 206 place count 126 transition count 112
Applied a total of 206 rules in 25 ms. Remains 126 /239 variables (removed 113) and now considering 112/225 (removed 113) transitions.
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 21:31:56] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:31:56] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 21:31:56] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:31:56] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2022-05-16 21:31:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 112 rows 126 cols
[2022-05-16 21:31:56] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:31:57] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/239 places, 112/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/239 places, 112/225 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-12 finished in 933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 234 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 234 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 231 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 231 transition count 217
Applied a total of 16 rules in 15 ms. Remains 231 /239 variables (removed 8) and now considering 217/225 (removed 8) transitions.
// Phase 1: matrix 217 rows 231 cols
[2022-05-16 21:31:57] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:31:57] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 217 rows 231 cols
[2022-05-16 21:31:57] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:31:58] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 231 cols
[2022-05-16 21:31:58] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:31:58] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 231/239 places, 217/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/239 places, 217/225 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s19 1) (GEQ s220 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-13 finished in 1489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((X(p1)||X(p2)))&&p0)))'
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 234 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 234 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 231 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 231 transition count 217
Applied a total of 16 rules in 15 ms. Remains 231 /239 variables (removed 8) and now considering 217/225 (removed 8) transitions.
// Phase 1: matrix 217 rows 231 cols
[2022-05-16 21:31:58] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:31:59] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 217 rows 231 cols
[2022-05-16 21:31:59] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:31:59] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 231 cols
[2022-05-16 21:31:59] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 21:32:00] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 231/239 places, 217/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/239 places, 217/225 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s227 1)), p1:(AND (OR (LT s5 1) (LT s227 1)) (OR (LT s11 1) (LT s42 1))), p2:(OR (LT s11 1) (LT s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 431 reset in 275 ms.
Product exploration explored 100000 steps with 431 reset in 344 ms.
Computed a total of 231 stabilizing places and 217 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 217
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 391 ms. Reduced automaton from 2 states, 3 edges and 3 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 230 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=115 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 398 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
// Phase 1: matrix 217 rows 231 cols
[2022-05-16 21:32:01] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:32:02] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 33 ms returned sat
[2022-05-16 21:32:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:32:05] [INFO ] [Real]Absence check using state equation in 3150 ms returned sat
[2022-05-16 21:32:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:32:05] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 33 ms returned sat
[2022-05-16 21:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:32:06] [INFO ] [Nat]Absence check using state equation in 1070 ms returned sat
[2022-05-16 21:32:06] [INFO ] Computed and/alt/rep : 100/105/100 causal constraints (skipped 107 transitions) in 30 ms.
[2022-05-16 21:32:08] [INFO ] Added : 98 causal constraints over 20 iterations in 1901 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 231 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 217/217 transitions.
Reduce places removed 8 places and 8 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 223 transition count 133
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 147 transition count 133
Applied a total of 152 rules in 27 ms. Remains 147 /231 variables (removed 84) and now considering 133/217 (removed 84) transitions.
// Phase 1: matrix 133 rows 147 cols
[2022-05-16 21:32:08] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:32:08] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 133 rows 147 cols
[2022-05-16 21:32:08] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:32:09] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2022-05-16 21:32:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 133 rows 147 cols
[2022-05-16 21:32:09] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:32:09] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/231 places, 133/217 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/231 places, 133/217 transitions.
Computed a total of 147 stabilizing places and 133 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 133
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 141 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=141 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
// Phase 1: matrix 133 rows 147 cols
[2022-05-16 21:32:10] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:32:10] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 22 ms returned sat
[2022-05-16 21:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 21:32:10] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2022-05-16 21:32:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 21:32:11] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 23 ms returned sat
[2022-05-16 21:32:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 21:32:11] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2022-05-16 21:32:11] [INFO ] Computed and/alt/rep : 98/106/98 causal constraints (skipped 22 transitions) in 34 ms.
[2022-05-16 21:32:11] [INFO ] Added : 91 causal constraints over 19 iterations in 588 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 716 reset in 237 ms.
Product exploration explored 100000 steps with 715 reset in 270 ms.
Built C files in :
/tmp/ltsmin14806662122385605224
[2022-05-16 21:32:12] [INFO ] Computing symmetric may disable matrix : 133 transitions.
[2022-05-16 21:32:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:32:12] [INFO ] Computing symmetric may enable matrix : 133 transitions.
[2022-05-16 21:32:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:32:12] [INFO ] Computing Do-Not-Accords matrix : 133 transitions.
[2022-05-16 21:32:12] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:32:12] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14806662122385605224
Running compilation step : cd /tmp/ltsmin14806662122385605224;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 628 ms.
Running link step : cd /tmp/ltsmin14806662122385605224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14806662122385605224;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4142717726194501262.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 133/133 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 146 transition count 123
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 136 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 136 transition count 122
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 136 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 135 transition count 121
Applied a total of 22 rules in 13 ms. Remains 135 /147 variables (removed 12) and now considering 121/133 (removed 12) transitions.
// Phase 1: matrix 121 rows 135 cols
[2022-05-16 21:32:27] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:32:27] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 121 rows 135 cols
[2022-05-16 21:32:27] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:32:28] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2022-05-16 21:32:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 121 rows 135 cols
[2022-05-16 21:32:28] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 21:32:28] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/147 places, 121/133 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/147 places, 121/133 transitions.
Built C files in :
/tmp/ltsmin11719293423097630334
[2022-05-16 21:32:28] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2022-05-16 21:32:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:32:28] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2022-05-16 21:32:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:32:28] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2022-05-16 21:32:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:32:28] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11719293423097630334
Running compilation step : cd /tmp/ltsmin11719293423097630334;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 562 ms.
Running link step : cd /tmp/ltsmin11719293423097630334;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11719293423097630334;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12490877596562866069.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 21:32:43] [INFO ] Flatten gal took : 18 ms
[2022-05-16 21:32:43] [INFO ] Flatten gal took : 9 ms
[2022-05-16 21:32:43] [INFO ] Time to serialize gal into /tmp/LTL1256688200490252307.gal : 2 ms
[2022-05-16 21:32:43] [INFO ] Time to serialize properties into /tmp/LTL7809253344233464013.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1256688200490252307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7809253344233464013.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1256688...266
Read 1 LTL properties
Checking formula 0 : !((F(((F((X("(((newmsg3<1)||(elected_10_to_left_4<1))&&((newmsg6<1)||(reply_6_0_to_right_5<1)))"))||(X("((newmsg6<1)||(reply_6_0_to_ri...222
Formula 0 simplified : !F("(elected_10_to_left_4>=1)" & "(newmsg3>=1)" & F(X"(((newmsg3<1)||(elected_10_to_left_4<1))&&((newmsg6<1)||(reply_6_0_to_right_5<...207
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t12.t13, t17, t18.t19, t22.t23, t25, t28.t29, t35, t38, t39.t40, t42, t43.t44, t47.t4...280
Computing Next relation with stutter on 2.8125e+07 deadlock states
187 unique states visited
0 strongly connected components in search stack
280 transitions explored
142 items max in DFS search stack
906 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,9.08773,249516,1,0,935,1.08589e+06,309,739,4197,1.26616e+06,2410
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-10-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HirschbergSinclair-PT-10-LTLFireability-14 finished in 55334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1))))'
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 225/225 transitions.
Reduce places removed 9 places and 9 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 230 transition count 131
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 170 place count 145 transition count 131
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 176 place count 139 transition count 125
Iterating global reduction 2 with 6 rules applied. Total rules applied 182 place count 139 transition count 125
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 184 place count 139 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 186 place count 137 transition count 123
Applied a total of 186 rules in 13 ms. Remains 137 /239 variables (removed 102) and now considering 123/225 (removed 102) transitions.
// Phase 1: matrix 123 rows 137 cols
[2022-05-16 21:32:54] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 21:32:54] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 123 rows 137 cols
[2022-05-16 21:32:54] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-16 21:32:54] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2022-05-16 21:32:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 123 rows 137 cols
[2022-05-16 21:32:54] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 21:32:54] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/239 places, 123/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/239 places, 123/225 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LT s78 1), p0:(OR (GEQ s78 1) (AND (GEQ s9 1) (GEQ s125 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 298 steps with 2 reset in 0 ms.
FORMULA HirschbergSinclair-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-10-LTLFireability-15 finished in 853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0||(!F(p2)&&p1)) U X(!X(p3)))))'
[2022-05-16 21:32:55] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17546950911121990544
[2022-05-16 21:32:55] [INFO ] Computing symmetric may disable matrix : 225 transitions.
[2022-05-16 21:32:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:32:55] [INFO ] Computing symmetric may enable matrix : 225 transitions.
[2022-05-16 21:32:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 21:32:55] [INFO ] Applying decomposition
[2022-05-16 21:32:55] [INFO ] Computing Do-Not-Accords matrix : 225 transitions.
[2022-05-16 21:32:55] [INFO ] Flatten gal took : 22 ms
[2022-05-16 21:32:55] [INFO ] Computation of Completed DNA matrix. took 57 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10726344119586454933.txt' '-o' '/tmp/graph10726344119586454933.bin' '-w' '/tmp/graph10726344119586454933.weights'
[2022-05-16 21:32:55] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17546950911121990544
Running compilation step : cd /tmp/ltsmin17546950911121990544;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10726344119586454933.bin' '-l' '-1' '-v' '-w' '/tmp/graph10726344119586454933.weights' '-q' '0' '-e' '0.001'
[2022-05-16 21:32:55] [INFO ] Decomposing Gal with order
[2022-05-16 21:32:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 21:32:55] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-16 21:32:55] [INFO ] Flatten gal took : 34 ms
[2022-05-16 21:32:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 21:32:55] [INFO ] Time to serialize gal into /tmp/LTLFireability4168988754988498345.gal : 4 ms
[2022-05-16 21:32:55] [INFO ] Time to serialize properties into /tmp/LTLFireability14231715534522508335.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4168988754988498345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14231715534522508335.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((F((G("(i1.u2.rcv_right_election_10_4_7_3<1)"))&&("(i3.u7.rcv_left_reply_10_2_9<1)"))))
Formula 0 simplified : !F("(i3.u7.rcv_left_reply_10_2_9<1)" & G"(i1.u2.rcv_right_election_10_4_7_3<1)")
Compilation finished in 669 ms.
Running link step : cd /tmp/ltsmin17546950911121990544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17546950911121990544;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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, t1, t2, t3, t4, t5, t7, t8, t9, t38, t194, t224, i0.u0.t15, i0.u1.t13, i1.u2.t17, i1.u2.t...421
Computing Next relation with stutter on 6.1236e+07 deadlock states
Detected timeout of ITS tools.
[2022-05-16 21:54:27] [INFO ] Flatten gal took : 46 ms
[2022-05-16 21:54:27] [INFO ] Time to serialize gal into /tmp/LTLFireability4002173402568443930.gal : 3 ms
[2022-05-16 21:54:27] [INFO ] Time to serialize properties into /tmp/LTLFireability2909654372408617050.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4002173402568443930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2909654372408617050.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 2 LTL properties
Checking formula 0 : !((F((G("(rcv_right_election_10_4_7_3<1)"))&&("(rcv_left_reply_10_2_9<1)"))))
Formula 0 simplified : !F("(rcv_left_reply_10_2_9<1)" & G"(rcv_right_election_10_4_7_3<1)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t21, t23, t27, t29, t33, t35, t38...305
Computing Next relation with stutter on 6.1236e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.108: LTL layer: formula: <>(([]((LTLAPp0==true))&&(LTLAPp1==true)))
pins2lts-mc-linux64( 6/ 8), 0.109: "<>(([]((LTLAPp0==true))&&(LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.117: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.122: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.123: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.141: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.149: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.169: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.169: Initializing POR dependencies: labels 231, guards 225
pins2lts-mc-linux64( 0/ 8), 0.269: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.283: There are 232 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.283: State length is 240, there are 230 groups
pins2lts-mc-linux64( 0/ 8), 0.283: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.283: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.283: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.283: Visible groups: 0 / 230, labels: 2 / 232
pins2lts-mc-linux64( 0/ 8), 0.283: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.283: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.435: [Blue] ~120 levels ~960 states ~3232 transitions
pins2lts-mc-linux64( 1/ 8), 0.562: [Blue] ~231 levels ~1920 states ~4528 transitions
pins2lts-mc-linux64( 1/ 8), 0.681: [Blue] ~235 levels ~3840 states ~7200 transitions
pins2lts-mc-linux64( 7/ 8), 0.872: [Blue] ~237 levels ~7680 states ~13392 transitions
pins2lts-mc-linux64( 7/ 8), 1.012: [Blue] ~237 levels ~15360 states ~25552 transitions
pins2lts-mc-linux64( 7/ 8), 1.339: [Blue] ~237 levels ~30720 states ~50120 transitions
pins2lts-mc-linux64( 7/ 8), 2.498: [Blue] ~237 levels ~61440 states ~98896 transitions
pins2lts-mc-linux64( 5/ 8), 4.143: [Blue] ~235 levels ~122880 states ~207296 transitions
pins2lts-mc-linux64( 5/ 8), 6.562: [Blue] ~235 levels ~245760 states ~416104 transitions
pins2lts-mc-linux64( 5/ 8), 10.419: [Blue] ~235 levels ~491520 states ~841456 transitions
pins2lts-mc-linux64( 5/ 8), 20.043: [Blue] ~235 levels ~983040 states ~1696704 transitions
pins2lts-mc-linux64( 1/ 8), 31.200: [Blue] ~235 levels ~1966080 states ~3358456 transitions
pins2lts-mc-linux64( 1/ 8), 51.923: [Blue] ~235 levels ~3932160 states ~6783264 transitions
pins2lts-mc-linux64( 1/ 8), 95.446: [Blue] ~235 levels ~7864320 states ~13750936 transitions
pins2lts-mc-linux64( 4/ 8), 182.417: [Blue] ~235 levels ~15728640 states ~27436416 transitions
pins2lts-mc-linux64( 4/ 8), 357.017: [Blue] ~235 levels ~31457280 states ~55402008 transitions
pins2lts-mc-linux64( 1/ 8), 714.975: [Blue] ~235 levels ~62914560 states ~112850832 transitions
pins2lts-mc-linux64( 4/ 8), 1439.140: [Blue] ~235 levels ~125829120 states ~226358720 transitions
pins2lts-mc-linux64( 2/ 8), 1617.279: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1617.334:
pins2lts-mc-linux64( 0/ 8), 1617.334: Explored 134215422 states 241739146 transitions, fanout: 1.801
pins2lts-mc-linux64( 0/ 8), 1617.334: Total exploration time 1617.030 sec (1616.960 sec minimum, 1616.990 sec on average)
pins2lts-mc-linux64( 0/ 8), 1617.334: States per second: 83001, Transitions per second: 149496
pins2lts-mc-linux64( 0/ 8), 1617.334:
pins2lts-mc-linux64( 0/ 8), 1617.334: State space has 134216821 states, 1097296 are accepting
pins2lts-mc-linux64( 0/ 8), 1617.334: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1617.334: blue states: 134215422 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1617.334: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1617.334: all-red states: 1342202 (1.00%), bogus 17 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1617.334:
pins2lts-mc-linux64( 0/ 8), 1617.334: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1617.334:
pins2lts-mc-linux64( 0/ 8), 1617.334: Queue width: 8B, total height: 1880, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1617.334: Tree memory: 1246.0MB, 9.7 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 1617.334: Tree fill ratio (roots/leafs): 99.0%/86.0%
pins2lts-mc-linux64( 0/ 8), 1617.334: Stored 226 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1617.334: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1617.334: Est. total memory use: 1246.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17546950911121990544;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin17546950911121990544;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 22:15:58] [INFO ] Flatten gal took : 17 ms
[2022-05-16 22:15:58] [INFO ] Input system was already deterministic with 225 transitions.
[2022-05-16 22:15:58] [INFO ] Transformed 239 places.
[2022-05-16 22:15:58] [INFO ] Transformed 225 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-16 22:15:58] [INFO ] Time to serialize gal into /tmp/LTLFireability16769753806106355137.gal : 11 ms
[2022-05-16 22:15:58] [INFO ] Time to serialize properties into /tmp/LTLFireability14216342153074306798.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16769753806106355137.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14216342153074306798.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("(rcv_right_election_10_4_7_3<1)"))&&("(rcv_left_reply_10_2_9<1)"))))
Formula 0 simplified : !F("(rcv_left_reply_10_2_9<1)" & G"(rcv_right_election_10_4_7_3<1)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t15, t17, t21, t23, t27, t29, t33, t35, t38...305
Computing Next relation with stutter on 6.1236e+07 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="HirschbergSinclair-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-10, 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 r114-smll-165264477500276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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