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-165264477500308.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-30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477500308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 8.7K Apr 29 16:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 16:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 29 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 16:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 9 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:02 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 357K 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-30-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652753371173

Running Version 202205111006
[2022-05-17 02:09:33] [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-17 02:09:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 02:09:34] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2022-05-17 02:09:34] [INFO ] Transformed 670 places.
[2022-05-17 02:09:34] [INFO ] Transformed 605 transitions.
[2022-05-17 02:09:34] [INFO ] Parsed PT model containing 670 places and 605 transitions in 552 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HirschbergSinclair-PT-30-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 605/605 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 640 transition count 605
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 56 place count 614 transition count 579
Iterating global reduction 1 with 26 rules applied. Total rules applied 82 place count 614 transition count 579
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 104 place count 592 transition count 557
Iterating global reduction 1 with 22 rules applied. Total rules applied 126 place count 592 transition count 557
Applied a total of 126 rules in 315 ms. Remains 592 /670 variables (removed 78) and now considering 557/605 (removed 48) transitions.
// Phase 1: matrix 557 rows 592 cols
[2022-05-17 02:09:34] [INFO ] Computed 35 place invariants in 39 ms
[2022-05-17 02:09:35] [INFO ] Implicit Places using invariants in 924 ms returned []
// Phase 1: matrix 557 rows 592 cols
[2022-05-17 02:09:35] [INFO ] Computed 35 place invariants in 12 ms
[2022-05-17 02:09:38] [INFO ] Implicit Places using invariants and state equation in 2402 ms returned []
Implicit Place search using SMT with State Equation took 3408 ms to find 0 implicit places.
// Phase 1: matrix 557 rows 592 cols
[2022-05-17 02:09:38] [INFO ] Computed 35 place invariants in 9 ms
[2022-05-17 02:09:38] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 592/670 places, 557/605 transitions.
Finished structural reductions, in 1 iterations. Remains : 592/670 places, 557/605 transitions.
Support contains 36 out of 592 places after structural reductions.
[2022-05-17 02:09:39] [INFO ] Flatten gal took : 157 ms
[2022-05-17 02:09:39] [INFO ] Flatten gal took : 88 ms
[2022-05-17 02:09:39] [INFO ] Input system was already deterministic with 557 transitions.
Support contains 34 out of 592 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 557 rows 592 cols
[2022-05-17 02:09:40] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-17 02:09:40] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 111 ms returned sat
[2022-05-17 02:09:40] [INFO ] After 788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:09:41] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 103 ms returned sat
[2022-05-17 02:09:41] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 02:09:41] [INFO ] After 715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-05-17 02:09:41] [INFO ] After 1076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 592 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 592/592 places, 557/557 transitions.
Graph (complete) has 1115 edges and 592 vertex of which 565 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.8 ms
Discarding 27 places :
Also discarding 0 output transitions
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 228 transitions
Trivial Post-agglo rules discarded 228 transitions
Performed 228 trivial Post agglomeration. Transition count delta: 228
Iterating post reduction 0 with 255 rules applied. Total rules applied 256 place count 565 transition count 302
Reduce places removed 228 places and 0 transitions.
Graph (complete) has 577 edges and 337 vertex of which 286 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 229 rules applied. Total rules applied 485 place count 286 transition count 302
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 536 place count 286 transition count 251
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 541 place count 281 transition count 246
Iterating global reduction 3 with 5 rules applied. Total rules applied 546 place count 281 transition count 246
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 550 place count 281 transition count 242
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 465 edges and 277 vertex of which 270 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 5 rules applied. Total rules applied 555 place count 270 transition count 242
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 562 place count 270 transition count 235
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 563 place count 269 transition count 234
Iterating global reduction 6 with 1 rules applied. Total rules applied 564 place count 269 transition count 234
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 567 place count 269 transition count 231
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 570 place count 266 transition count 231
Reduce places removed 29 places and 29 transitions.
Iterating global reduction 7 with 29 rules applied. Total rules applied 599 place count 237 transition count 202
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 7 with 157 rules applied. Total rules applied 756 place count 211 transition count 71
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 8 with 131 rules applied. Total rules applied 887 place count 80 transition count 71
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 19 Pre rules applied. Total rules applied 887 place count 80 transition count 52
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 925 place count 61 transition count 52
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 926 place count 60 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 926 place count 60 transition count 51
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 928 place count 59 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 934 place count 56 transition count 48
Applied a total of 934 rules in 178 ms. Remains 56 /592 variables (removed 536) and now considering 48/557 (removed 509) transitions.
Finished structural reductions, in 1 iterations. Remains : 56/592 places, 48/557 transitions.
Finished random walk after 92 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=30 )
Computed a total of 592 stabilizing places and 557 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 592 transition count 557
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(F((G((p0 U G(p1)))&&X(X(p2))))))'
Support contains 4 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 557/557 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 585 transition count 550
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 585 transition count 550
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 582 transition count 547
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 582 transition count 547
Applied a total of 20 rules in 112 ms. Remains 582 /592 variables (removed 10) and now considering 547/557 (removed 10) transitions.
// Phase 1: matrix 547 rows 582 cols
[2022-05-17 02:09:42] [INFO ] Computed 35 place invariants in 7 ms
[2022-05-17 02:09:43] [INFO ] Implicit Places using invariants in 684 ms returned []
// Phase 1: matrix 547 rows 582 cols
[2022-05-17 02:09:43] [INFO ] Computed 35 place invariants in 21 ms
[2022-05-17 02:09:46] [INFO ] Implicit Places using invariants and state equation in 2967 ms returned []
Implicit Place search using SMT with State Equation took 3660 ms to find 0 implicit places.
// Phase 1: matrix 547 rows 582 cols
[2022-05-17 02:09:46] [INFO ] Computed 35 place invariants in 6 ms
[2022-05-17 02:09:47] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 582/592 places, 547/557 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/592 places, 547/557 transitions.
Stuttering acceptance computed with spot in 960 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 6}, { cond=(OR p1 p0), acceptance={0} source=3 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=7 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=8 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=9 dest: 5}, { cond=(AND p1 p0), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=9 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=9 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p0), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=10 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=10 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=10 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=10 dest: 8}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(OR (GEQ s151 1) (AND (GEQ s47 1) (GEQ s256 1))), p0:(AND (GEQ s47 1) (GEQ s256 1)), p2:(LT s274 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 911 steps with 1 reset in 37 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-00 finished in 5550 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 4 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 557/557 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 584 transition count 549
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 584 transition count 549
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 580 transition count 545
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 580 transition count 545
Applied a total of 24 rules in 68 ms. Remains 580 /592 variables (removed 12) and now considering 545/557 (removed 12) transitions.
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:09:48] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-17 02:09:48] [INFO ] Implicit Places using invariants in 540 ms returned []
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:09:48] [INFO ] Computed 35 place invariants in 6 ms
[2022-05-17 02:09:51] [INFO ] Implicit Places using invariants and state equation in 2592 ms returned []
Implicit Place search using SMT with State Equation took 3139 ms to find 0 implicit places.
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:09:51] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-17 02:09:52] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/592 places, 545/557 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/592 places, 545/557 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s51 1) (GEQ s553 1)), p1:(OR (LT s53 1) (LT s240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 174 reset in 773 ms.
Product exploration explored 100000 steps with 174 reset in 745 ms.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 363 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 578 steps, including 0 resets, run visited all 3 properties in 27 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 484 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Applied a total of 0 rules in 18 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:09:55] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-17 02:09:55] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:09:55] [INFO ] Computed 35 place invariants in 7 ms
[2022-05-17 02:09:58] [INFO ] Implicit Places using invariants and state equation in 2284 ms returned []
Implicit Place search using SMT with State Equation took 2770 ms to find 0 implicit places.
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:09:58] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-17 02:09:58] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 545/545 transitions.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 340 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 578 steps, including 0 resets, run visited all 3 properties in 18 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 720 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 174 reset in 529 ms.
Product exploration explored 100000 steps with 174 reset in 528 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Performed 220 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 580 transition count 545
Deduced a syphon composed of 220 places in 2 ms
Applied a total of 220 rules in 110 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2022-05-17 02:10:02] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:10:02] [INFO ] Computed 35 place invariants in 14 ms
[2022-05-17 02:10:03] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/580 places, 545/545 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 545/545 transitions.
Product exploration explored 100000 steps with 305 reset in 387 ms.
Product exploration explored 100000 steps with 305 reset in 479 ms.
Built C files in :
/tmp/ltsmin15311369253334387544
[2022-05-17 02:10:04] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15311369253334387544
Running compilation step : cd /tmp/ltsmin15311369253334387544;'/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 1786 ms.
Running link step : cd /tmp/ltsmin15311369253334387544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin15311369253334387544;'/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/stateBased11101573767750761119.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Applied a total of 0 rules in 19 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:10:19] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-17 02:10:19] [INFO ] Implicit Places using invariants in 440 ms returned []
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:10:19] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-17 02:10:21] [INFO ] Implicit Places using invariants and state equation in 2189 ms returned []
Implicit Place search using SMT with State Equation took 2634 ms to find 0 implicit places.
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:10:21] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-17 02:10:22] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 545/545 transitions.
Built C files in :
/tmp/ltsmin10600870270665432954
[2022-05-17 02:10:22] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10600870270665432954
Running compilation step : cd /tmp/ltsmin10600870270665432954;'/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 1654 ms.
Running link step : cd /tmp/ltsmin10600870270665432954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10600870270665432954;'/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/stateBased10594100186101222757.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 02:10:38] [INFO ] Flatten gal took : 48 ms
[2022-05-17 02:10:38] [INFO ] Flatten gal took : 44 ms
[2022-05-17 02:10:38] [INFO ] Time to serialize gal into /tmp/LTL9820261587032573005.gal : 10 ms
[2022-05-17 02:10:38] [INFO ] Time to serialize properties into /tmp/LTL14369601026433065322.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/LTL9820261587032573005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14369601026433065322.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/LTL9820261...267
Read 1 LTL properties
Checking formula 0 : !(((F("((newmsg26>=1)&&(elected_30_to_left_27>=1))"))||(X(G("((newmsg27<1)||(election_30_3_3_to_left_28<1))")))))
Formula 0 simplified : !(F"((newmsg26>=1)&&(elected_30_to_left_27>=1))" | XG"((newmsg27<1)||(election_30_3_3_to_left_28<1))")
Detected timeout of ITS tools.
[2022-05-17 02:10:53] [INFO ] Flatten gal took : 42 ms
[2022-05-17 02:10:53] [INFO ] Applying decomposition
[2022-05-17 02:10:53] [INFO ] Flatten gal took : 53 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/graph1549944304828575803.txt' '-o' '/tmp/graph1549944304828575803.bin' '-w' '/tmp/graph1549944304828575803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1549944304828575803.bin' '-l' '-1' '-v' '-w' '/tmp/graph1549944304828575803.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:10:53] [INFO ] Decomposing Gal with order
[2022-05-17 02:10:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:10:53] [INFO ] Removed a total of 71 redundant transitions.
[2022-05-17 02:10:53] [INFO ] Flatten gal took : 177 ms
[2022-05-17 02:10:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-17 02:10:53] [INFO ] Time to serialize gal into /tmp/LTL15037800328686843725.gal : 13 ms
[2022-05-17 02:10:53] [INFO ] Time to serialize properties into /tmp/LTL16309420870173513665.ltl : 0 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/LTL15037800328686843725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16309420870173513665.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/LTL1503780...247
Read 1 LTL properties
Checking formula 0 : !(((F("((i9.u22.newmsg26>=1)&&(i9.u68.elected_30_to_left_27>=1))"))||(X(G("((i9.u23.newmsg27<1)||(i9.u23.election_30_3_3_to_left_28<1)...162
Formula 0 simplified : !(F"((i9.u22.newmsg26>=1)&&(i9.u68.elected_30_to_left_27>=1))" | XG"((i9.u23.newmsg27<1)||(i9.u23.election_30_3_3_to_left_28<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14666783581758956391
[2022-05-17 02:11:08] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14666783581758956391
Running compilation step : cd /tmp/ltsmin14666783581758956391;'/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 1453 ms.
Running link step : cd /tmp/ltsmin14666783581758956391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14666783581758956391;'/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))||X([]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-30-LTLFireability-02 finished in 95880 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(!X(X(p0)))))'
Support contains 2 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 557/557 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 584 transition count 549
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 584 transition count 549
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 580 transition count 545
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 580 transition count 545
Applied a total of 24 rules in 67 ms. Remains 580 /592 variables (removed 12) and now considering 545/557 (removed 12) transitions.
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:11:24] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:11:24] [INFO ] Implicit Places using invariants in 464 ms returned []
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:11:24] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-17 02:11:27] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned []
Implicit Place search using SMT with State Equation took 3130 ms to find 0 implicit places.
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:11:27] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-17 02:11:27] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/592 places, 545/557 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/592 places, 545/557 transitions.
Stuttering acceptance computed with spot in 116 ms :[p0, true, p0, p0]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s15 1) (GEQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-03 finished in 3909 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G((F(p0)||p1)))))'
Support contains 6 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 557/557 transitions.
Reduce places removed 26 places and 26 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 566 transition count 315
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 1 with 216 rules applied. Total rules applied 432 place count 350 transition count 315
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 438 place count 344 transition count 309
Iterating global reduction 2 with 6 rules applied. Total rules applied 444 place count 344 transition count 309
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 446 place count 344 transition count 307
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 448 place count 342 transition count 307
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 449 place count 341 transition count 306
Iterating global reduction 4 with 1 rules applied. Total rules applied 450 place count 341 transition count 306
Applied a total of 450 rules in 56 ms. Remains 341 /592 variables (removed 251) and now considering 306/557 (removed 251) transitions.
// Phase 1: matrix 306 rows 341 cols
[2022-05-17 02:11:28] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:11:28] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 306 rows 341 cols
[2022-05-17 02:11:28] [INFO ] Computed 35 place invariants in 6 ms
[2022-05-17 02:11:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-17 02:11:30] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2022-05-17 02:11:30] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 306 rows 341 cols
[2022-05-17 02:11:30] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:11:30] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 341/592 places, 306/557 transitions.
Finished structural reductions, in 1 iterations. Remains : 341/592 places, 306/557 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s29 1) (LT s92 1)) (OR (LT s21 1) (LT s71 1))), p0:(OR (LT s5 1) (LT s272 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 297 reset in 428 ms.
Product exploration explored 100000 steps with 297 reset in 512 ms.
Computed a total of 341 stabilizing places and 306 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 341 transition count 306
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 (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-30-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLFireability-04 finished in 3840 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 557/557 transitions.
Reduce places removed 29 places and 29 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 232 place count 563 transition count 296
Reduce places removed 232 places and 0 transitions.
Iterating post reduction 1 with 232 rules applied. Total rules applied 464 place count 331 transition count 296
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 472 place count 323 transition count 288
Iterating global reduction 2 with 8 rules applied. Total rules applied 480 place count 323 transition count 288
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 484 place count 323 transition count 284
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 488 place count 319 transition count 284
Applied a total of 488 rules in 38 ms. Remains 319 /592 variables (removed 273) and now considering 284/557 (removed 273) transitions.
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:11:31] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:11:32] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:11:32] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:11:33] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
[2022-05-17 02:11:33] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:11:33] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:11:33] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 319/592 places, 284/557 transitions.
Finished structural reductions, in 1 iterations. Remains : 319/592 places, 284/557 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s16 1) (LT s172 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 437 reset in 746 ms.
Product exploration explored 100000 steps with 427 reset in 426 ms.
Computed a total of 319 stabilizing places and 284 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 319 transition count 284
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-30-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLFireability-06 finished in 3552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p1)||G(F(p2))||p0)))'
Support contains 5 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 557/557 transitions.
Reduce places removed 28 places and 28 transitions.
Drop transitions removed 223 transitions
Trivial Post-agglo rules discarded 223 transitions
Performed 223 trivial Post agglomeration. Transition count delta: 223
Iterating post reduction 0 with 223 rules applied. Total rules applied 223 place count 564 transition count 306
Reduce places removed 223 places and 0 transitions.
Iterating post reduction 1 with 223 rules applied. Total rules applied 446 place count 341 transition count 306
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 453 place count 334 transition count 299
Iterating global reduction 2 with 7 rules applied. Total rules applied 460 place count 334 transition count 299
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 463 place count 334 transition count 296
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 466 place count 331 transition count 296
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 467 place count 330 transition count 295
Iterating global reduction 4 with 1 rules applied. Total rules applied 468 place count 330 transition count 295
Applied a total of 468 rules in 48 ms. Remains 330 /592 variables (removed 262) and now considering 295/557 (removed 262) transitions.
// Phase 1: matrix 295 rows 330 cols
[2022-05-17 02:11:35] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:11:35] [INFO ] Implicit Places using invariants in 318 ms returned []
// Phase 1: matrix 295 rows 330 cols
[2022-05-17 02:11:35] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-17 02:11:36] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
[2022-05-17 02:11:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 295 rows 330 cols
[2022-05-17 02:11:36] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:11:37] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 330/592 places, 295/557 transitions.
Finished structural reductions, in 1 iterations. Remains : 330/592 places, 295/557 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s243 1) (AND (GEQ s22 1) (GEQ s77 1))), p1:(AND (GEQ s5 1) (GEQ s228 1)), p2:(AND (GEQ s22 1) (GEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2438 reset in 569 ms.
Product exploration explored 100000 steps with 2500 reset in 666 ms.
Computed a total of 330 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 330 transition count 295
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)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 425 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 259 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 518 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 295 rows 330 cols
[2022-05-17 02:11:40] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:11:40] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 86 ms returned sat
[2022-05-17 02:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:43] [INFO ] [Real]Absence check using state equation in 3411 ms returned sat
[2022-05-17 02:11:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:11:44] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 138 ms returned sat
[2022-05-17 02:11:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:45] [INFO ] [Nat]Absence check using state equation in 1106 ms returned sat
[2022-05-17 02:11:45] [INFO ] Computed and/alt/rep : 235/314/235 causal constraints (skipped 7 transitions) in 22 ms.
[2022-05-17 02:11:46] [INFO ] Added : 123 causal constraints over 25 iterations in 1170 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 5 out of 330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 330/330 places, 295/295 transitions.
Applied a total of 0 rules in 16 ms. Remains 330 /330 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 330 cols
[2022-05-17 02:11:46] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:11:47] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 295 rows 330 cols
[2022-05-17 02:11:47] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:11:48] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
[2022-05-17 02:11:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 295 rows 330 cols
[2022-05-17 02:11:48] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:11:48] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 330/330 places, 295/295 transitions.
Computed a total of 330 stabilizing places and 295 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 330 transition count 295
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)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 538 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 255 steps, including 0 resets, run visited all 5 properties in 9 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 572 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 295 rows 330 cols
[2022-05-17 02:11:50] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:11:50] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 75 ms returned sat
[2022-05-17 02:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:54] [INFO ] [Real]Absence check using state equation in 3502 ms returned sat
[2022-05-17 02:11:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:11:54] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 87 ms returned sat
[2022-05-17 02:11:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:55] [INFO ] [Nat]Absence check using state equation in 1048 ms returned sat
[2022-05-17 02:11:55] [INFO ] Computed and/alt/rep : 235/314/235 causal constraints (skipped 7 transitions) in 37 ms.
[2022-05-17 02:11:57] [INFO ] Added : 123 causal constraints over 25 iterations in 1615 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2437 reset in 859 ms.
Product exploration explored 100000 steps with 2411 reset in 713 ms.
Built C files in :
/tmp/ltsmin2680680965620447818
[2022-05-17 02:11:59] [INFO ] Computing symmetric may disable matrix : 295 transitions.
[2022-05-17 02:11:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:11:59] [INFO ] Computing symmetric may enable matrix : 295 transitions.
[2022-05-17 02:11:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:11:59] [INFO ] Computing Do-Not-Accords matrix : 295 transitions.
[2022-05-17 02:11:59] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:11:59] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2680680965620447818
Running compilation step : cd /tmp/ltsmin2680680965620447818;'/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 975 ms.
Running link step : cd /tmp/ltsmin2680680965620447818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin2680680965620447818;'/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/stateBased3212540473763141388.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 330/330 places, 295/295 transitions.
Applied a total of 0 rules in 22 ms. Remains 330 /330 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 330 cols
[2022-05-17 02:12:14] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:12:14] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 295 rows 330 cols
[2022-05-17 02:12:14] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-17 02:12:15] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
[2022-05-17 02:12:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 295 rows 330 cols
[2022-05-17 02:12:15] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-17 02:12:16] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 330/330 places, 295/295 transitions.
Built C files in :
/tmp/ltsmin13318446100326903394
[2022-05-17 02:12:16] [INFO ] Computing symmetric may disable matrix : 295 transitions.
[2022-05-17 02:12:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:12:16] [INFO ] Computing symmetric may enable matrix : 295 transitions.
[2022-05-17 02:12:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:12:16] [INFO ] Computing Do-Not-Accords matrix : 295 transitions.
[2022-05-17 02:12:16] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:12:16] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13318446100326903394
Running compilation step : cd /tmp/ltsmin13318446100326903394;'/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 961 ms.
Running link step : cd /tmp/ltsmin13318446100326903394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13318446100326903394;'/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/stateBased10319568936346664675.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 02:12:31] [INFO ] Flatten gal took : 18 ms
[2022-05-17 02:12:31] [INFO ] Flatten gal took : 16 ms
[2022-05-17 02:12:31] [INFO ] Time to serialize gal into /tmp/LTL7692249549372065735.gal : 2 ms
[2022-05-17 02:12:31] [INFO ] Time to serialize properties into /tmp/LTL11422697494208890124.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/LTL7692249549372065735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11422697494208890124.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/LTL7692249...267
Read 1 LTL properties
Checking formula 0 : !((G(((F("((newmsg5>=1)&&(reply_30_4_to_left_6>=1))"))||(G(F("((newmsg21>=1)&&(reply_21_0_to_right_20>=1))"))))||("((rcv_right_electio...222
Formula 0 simplified : !G("((rcv_right_election_30_5_7_23>=1)||((newmsg21>=1)&&(reply_21_0_to_right_20>=1)))" | F"((newmsg5>=1)&&(reply_30_4_to_left_6>=1))...208
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t32.t33, t36.t37, t40.t41, t45, t46.t47, t50.t51, t53, t54.t55, t58.t59, t62.t63, t6...484
Computing Next relation with stutter on 8.04663e+21 deadlock states
Detected timeout of ITS tools.
[2022-05-17 02:12:46] [INFO ] Flatten gal took : 18 ms
[2022-05-17 02:12:46] [INFO ] Applying decomposition
[2022-05-17 02:12:46] [INFO ] Flatten gal took : 15 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/graph10266355371811101324.txt' '-o' '/tmp/graph10266355371811101324.bin' '-w' '/tmp/graph10266355371811101324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10266355371811101324.bin' '-l' '-1' '-v' '-w' '/tmp/graph10266355371811101324.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:12:46] [INFO ] Decomposing Gal with order
[2022-05-17 02:12:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:12:46] [INFO ] Removed a total of 167 redundant transitions.
[2022-05-17 02:12:46] [INFO ] Flatten gal took : 42 ms
[2022-05-17 02:12:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 12 ms.
[2022-05-17 02:12:46] [INFO ] Time to serialize gal into /tmp/LTL5606125287241420270.gal : 5 ms
[2022-05-17 02:12:46] [INFO ] Time to serialize properties into /tmp/LTL5737809271345212380.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/LTL5606125287241420270.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5737809271345212380.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/LTL5606125...245
Read 1 LTL properties
Checking formula 0 : !((G(((F("((i0.u0.newmsg5>=1)&&(i4.i1.u1.reply_30_4_to_left_6>=1))"))||(G(F("((i3.i1.u25.newmsg21>=1)&&(i3.i1.u26.reply_21_0_to_right_...287
Formula 0 simplified : !G("((i6.i1.u88.rcv_right_election_30_5_7_23>=1)||((i3.i1.u25.newmsg21>=1)&&(i3.i1.u26.reply_21_0_to_right_20>=1)))" | F"((i0.u0.new...273
Reverse transition relation is NOT exact ! Due to transitions t36_t37, t50_t51, t94_t95, t116_t117, t136_t137, t364_t365, t465_t466, i0.t40_t41, i0.t4, i0....631
Computing Next relation with stutter on 8.04663e+21 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12918364686335089695
[2022-05-17 02:13:01] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12918364686335089695
Running compilation step : cd /tmp/ltsmin12918364686335089695;'/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 793 ms.
Running link step : cd /tmp/ltsmin12918364686335089695;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12918364686335089695;'/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' '[]((<>((LTLAPp1==true))||[](<>((LTLAPp2==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-30-LTLFireability-07 finished in 101470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(G(p0))))))'
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 557/557 transitions.
Reduce places removed 30 places and 30 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 562 transition count 288
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 323 transition count 288
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 485 place count 316 transition count 281
Iterating global reduction 2 with 7 rules applied. Total rules applied 492 place count 316 transition count 281
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 496 place count 316 transition count 277
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 500 place count 312 transition count 277
Applied a total of 500 rules in 51 ms. Remains 312 /592 variables (removed 280) and now considering 277/557 (removed 280) transitions.
// Phase 1: matrix 277 rows 312 cols
[2022-05-17 02:13:16] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:13:17] [INFO ] Implicit Places using invariants in 407 ms returned []
// Phase 1: matrix 277 rows 312 cols
[2022-05-17 02:13:17] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:13:18] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
[2022-05-17 02:13:18] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 277 rows 312 cols
[2022-05-17 02:13:18] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:13:19] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/592 places, 277/557 transitions.
Finished structural reductions, in 1 iterations. Remains : 312/592 places, 277/557 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-08 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 s38 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 306 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLFireability-08 finished in 2323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&!(p1 U (p2 U p3))))'
Support contains 7 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 557/557 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 584 transition count 549
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 584 transition count 549
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 580 transition count 545
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 580 transition count 545
Applied a total of 24 rules in 58 ms. Remains 580 /592 variables (removed 12) and now considering 545/557 (removed 12) transitions.
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:13:19] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:13:19] [INFO ] Implicit Places using invariants in 591 ms returned []
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:13:19] [INFO ] Computed 35 place invariants in 8 ms
[2022-05-17 02:13:22] [INFO ] Implicit Places using invariants and state equation in 2868 ms returned []
Implicit Place search using SMT with State Equation took 3461 ms to find 0 implicit places.
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:13:22] [INFO ] Computed 35 place invariants in 6 ms
[2022-05-17 02:13:23] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 580/592 places, 545/557 transitions.
Finished structural reductions, in 1 iterations. Remains : 580/592 places, 545/557 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p3), true, p3, p3, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s47 1) (GEQ s254 1)), p1:(AND (GEQ s27 1) (GEQ s393 1)), p2:(AND (GEQ s53 1) (GEQ s436 1) (GEQ s533 1)), p0:(AND (GEQ s53 1) (GEQ s436 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 215 reset in 305 ms.
Product exploration explored 100000 steps with 215 reset in 444 ms.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
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 p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p3)), (X (NOT p0)), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), true, (X (X (NOT p3))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (F (G (NOT p3))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 995 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 462 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=92 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p3)), (X (NOT p0)), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), true, (X (X (NOT p3))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (F (G (NOT p3))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 16 factoid took 1010 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 545 rows 580 cols
[2022-05-17 02:13:26] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-17 02:13:27] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 209 ms returned sat
[2022-05-17 02:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:32] [INFO ] [Real]Absence check using state equation in 5089 ms returned sat
[2022-05-17 02:13:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:33] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 213 ms returned sat
[2022-05-17 02:13:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:38] [INFO ] [Nat]Absence check using state equation in 4585 ms returned sat
[2022-05-17 02:13:38] [INFO ] Computed and/alt/rep : 343/1072/343 causal constraints (skipped 172 transitions) in 50 ms.
[2022-05-17 02:13:43] [INFO ] Added : 284 causal constraints over 57 iterations in 5663 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 580 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 : 580/580 places, 545/545 transitions.
Reduce places removed 27 places and 27 transitions.
Drop transitions removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 553 transition count 307
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 342 transition count 307
Applied a total of 422 rules in 27 ms. Remains 342 /580 variables (removed 238) and now considering 307/545 (removed 238) transitions.
// Phase 1: matrix 307 rows 342 cols
[2022-05-17 02:13:43] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:13:44] [INFO ] Implicit Places using invariants in 406 ms returned []
// Phase 1: matrix 307 rows 342 cols
[2022-05-17 02:13:44] [INFO ] Computed 35 place invariants in 8 ms
[2022-05-17 02:13:45] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1720 ms to find 0 implicit places.
[2022-05-17 02:13:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 307 rows 342 cols
[2022-05-17 02:13:45] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:13:45] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 342/580 places, 307/545 transitions.
Finished structural reductions, in 1 iterations. Remains : 342/580 places, 307/545 transitions.
Computed a total of 342 stabilizing places and 307 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 342 transition count 307
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 275 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 47 ms :[(NOT p0)]
Finished random walk after 260 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=130 )
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 190 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 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 307 rows 342 cols
[2022-05-17 02:13:46] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:13:47] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 194 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:50] [INFO ] [Real]Absence check using state equation in 3151 ms returned sat
[2022-05-17 02:13:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:50] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 114 ms returned sat
[2022-05-17 02:13:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:51] [INFO ] [Nat]Absence check using state equation in 1106 ms returned sat
[2022-05-17 02:13:51] [INFO ] Computed and/alt/rep : 239/326/239 causal constraints (skipped 18 transitions) in 61 ms.
[2022-05-17 02:13:53] [INFO ] Added : 177 causal constraints over 36 iterations in 1701 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 401 reset in 476 ms.
Product exploration explored 100000 steps with 401 reset in 356 ms.
Built C files in :
/tmp/ltsmin13521700128981234684
[2022-05-17 02:13:54] [INFO ] Computing symmetric may disable matrix : 307 transitions.
[2022-05-17 02:13:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:13:54] [INFO ] Computing symmetric may enable matrix : 307 transitions.
[2022-05-17 02:13:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:13:54] [INFO ] Computing Do-Not-Accords matrix : 307 transitions.
[2022-05-17 02:13:54] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:13:54] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13521700128981234684
Running compilation step : cd /tmp/ltsmin13521700128981234684;'/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 1004 ms.
Running link step : cd /tmp/ltsmin13521700128981234684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin13521700128981234684;'/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/stateBased7324784047649717067.hoa' '--buchi-type=spotba'
LTSmin run took 5512 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-30-LTLFireability-09 finished in 41988 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
Support contains 3 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 557/557 transitions.
Reduce places removed 28 places and 28 transitions.
Drop transitions removed 228 transitions
Trivial Post-agglo rules discarded 228 transitions
Performed 228 trivial Post agglomeration. Transition count delta: 228
Iterating post reduction 0 with 228 rules applied. Total rules applied 228 place count 564 transition count 301
Reduce places removed 228 places and 0 transitions.
Iterating post reduction 1 with 228 rules applied. Total rules applied 456 place count 336 transition count 301
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 462 place count 330 transition count 295
Iterating global reduction 2 with 6 rules applied. Total rules applied 468 place count 330 transition count 295
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 471 place count 330 transition count 292
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 474 place count 327 transition count 292
Applied a total of 474 rules in 31 ms. Remains 327 /592 variables (removed 265) and now considering 292/557 (removed 265) transitions.
// Phase 1: matrix 292 rows 327 cols
[2022-05-17 02:14:01] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:14:01] [INFO ] Implicit Places using invariants in 604 ms returned []
// Phase 1: matrix 292 rows 327 cols
[2022-05-17 02:14:01] [INFO ] Computed 35 place invariants in 12 ms
[2022-05-17 02:14:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:03] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2022-05-17 02:14:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 292 rows 327 cols
[2022-05-17 02:14:03] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-17 02:14:03] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 327/592 places, 292/557 transitions.
Finished structural reductions, in 1 iterations. Remains : 327/592 places, 292/557 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s91 1), p1:(AND (GEQ s31 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1998 reset in 586 ms.
Product exploration explored 100000 steps with 1953 reset in 634 ms.
Computed a total of 327 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 327 transition count 292
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))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 331 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 55 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 307 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 292 rows 327 cols
[2022-05-17 02:14:05] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:14:06] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 122 ms returned sat
[2022-05-17 02:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:10] [INFO ] [Real]Absence check using state equation in 4743 ms returned sat
[2022-05-17 02:14:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:11] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 64 ms returned sat
[2022-05-17 02:14:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:17] [INFO ] [Nat]Absence check using state equation in 6495 ms returned sat
[2022-05-17 02:14:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:17] [INFO ] [Nat]Added 12 Read/Feed constraints in 62 ms returned sat
[2022-05-17 02:14:17] [INFO ] Computed and/alt/rep : 222/241/222 causal constraints (skipped 14 transitions) in 21 ms.
[2022-05-17 02:14:24] [INFO ] Added : 217 causal constraints over 44 iterations in 6952 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 292/292 transitions.
Applied a total of 0 rules in 13 ms. Remains 327 /327 variables (removed 0) and now considering 292/292 (removed 0) transitions.
// Phase 1: matrix 292 rows 327 cols
[2022-05-17 02:14:24] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-17 02:14:25] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 292 rows 327 cols
[2022-05-17 02:14:25] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:14:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:26] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
[2022-05-17 02:14:26] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 292 rows 327 cols
[2022-05-17 02:14:26] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:14:27] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 327/327 places, 292/292 transitions.
Computed a total of 327 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 327 transition count 292
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))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 358 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 45 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 538 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 292 rows 327 cols
[2022-05-17 02:14:28] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:14:28] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 121 ms returned sat
[2022-05-17 02:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:33] [INFO ] [Real]Absence check using state equation in 4976 ms returned sat
[2022-05-17 02:14:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:34] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 64 ms returned sat
[2022-05-17 02:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:41] [INFO ] [Nat]Absence check using state equation in 7087 ms returned sat
[2022-05-17 02:14:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:41] [INFO ] [Nat]Added 12 Read/Feed constraints in 59 ms returned sat
[2022-05-17 02:14:41] [INFO ] Computed and/alt/rep : 222/241/222 causal constraints (skipped 14 transitions) in 23 ms.
[2022-05-17 02:14:48] [INFO ] Added : 217 causal constraints over 44 iterations in 7509 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1991 reset in 793 ms.
Product exploration explored 100000 steps with 1979 reset in 728 ms.
Built C files in :
/tmp/ltsmin13461879451987206988
[2022-05-17 02:14:50] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2022-05-17 02:14:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:14:50] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2022-05-17 02:14:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:14:50] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2022-05-17 02:14:50] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:14:50] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13461879451987206988
Running compilation step : cd /tmp/ltsmin13461879451987206988;'/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 923 ms.
Running link step : cd /tmp/ltsmin13461879451987206988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13461879451987206988;'/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/stateBased1195499717459748267.hoa' '--buchi-type=spotba'
LTSmin run took 11888 ms.
FORMULA HirschbergSinclair-PT-30-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-30-LTLFireability-10 finished in 62196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 557/557 transitions.
Reduce places removed 29 places and 29 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 232 place count 563 transition count 296
Reduce places removed 232 places and 0 transitions.
Iterating post reduction 1 with 232 rules applied. Total rules applied 464 place count 331 transition count 296
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 472 place count 323 transition count 288
Iterating global reduction 2 with 8 rules applied. Total rules applied 480 place count 323 transition count 288
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 484 place count 323 transition count 284
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 488 place count 319 transition count 284
Applied a total of 488 rules in 31 ms. Remains 319 /592 variables (removed 273) and now considering 284/557 (removed 273) transitions.
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:15:03] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:15:03] [INFO ] Implicit Places using invariants in 391 ms returned []
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:15:03] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:15:04] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
[2022-05-17 02:15:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:15:04] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:15:05] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 319/592 places, 284/557 transitions.
Finished structural reductions, in 1 iterations. Remains : 319/592 places, 284/557 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 581 reset in 326 ms.
Product exploration explored 100000 steps with 581 reset in 372 ms.
Computed a total of 319 stabilizing places and 284 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 319 transition count 284
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 150 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 47 ms :[(NOT p0)]
Finished random walk after 180 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=90 )
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 179 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:15:06] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:15:06] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 102 ms returned sat
[2022-05-17 02:15:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:15:09] [INFO ] [Real]Absence check using state equation in 3086 ms returned sat
[2022-05-17 02:15:09] [INFO ] Computed and/alt/rep : 228/297/228 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-17 02:15:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:15:10] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 72 ms returned sat
[2022-05-17 02:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:15:11] [INFO ] [Nat]Absence check using state equation in 1041 ms returned sat
[2022-05-17 02:15:11] [INFO ] Computed and/alt/rep : 228/297/228 causal constraints (skipped 0 transitions) in 29 ms.
[2022-05-17 02:15:12] [INFO ] Added : 107 causal constraints over 22 iterations in 1055 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 284/284 transitions.
Applied a total of 0 rules in 11 ms. Remains 319 /319 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:15:12] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:15:13] [INFO ] Implicit Places using invariants in 518 ms returned []
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:15:13] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-17 02:15:14] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
[2022-05-17 02:15:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:15:14] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:15:14] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 319/319 places, 284/284 transitions.
Computed a total of 319 stabilizing places and 284 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 319 transition count 284
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 203 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 50 ms :[(NOT p0)]
Finished random walk after 181 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=90 )
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 164 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:15:15] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:15:15] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 167 ms returned sat
[2022-05-17 02:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:15:18] [INFO ] [Real]Absence check using state equation in 2868 ms returned sat
[2022-05-17 02:15:18] [INFO ] Computed and/alt/rep : 228/297/228 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-17 02:15:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:15:19] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 74 ms returned sat
[2022-05-17 02:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:15:20] [INFO ] [Nat]Absence check using state equation in 1030 ms returned sat
[2022-05-17 02:15:20] [INFO ] Computed and/alt/rep : 228/297/228 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-17 02:15:21] [INFO ] Added : 107 causal constraints over 22 iterations in 1202 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 580 reset in 552 ms.
Product exploration explored 100000 steps with 581 reset in 421 ms.
Built C files in :
/tmp/ltsmin11794549581108429816
[2022-05-17 02:15:22] [INFO ] Computing symmetric may disable matrix : 284 transitions.
[2022-05-17 02:15:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:15:22] [INFO ] Computing symmetric may enable matrix : 284 transitions.
[2022-05-17 02:15:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:15:22] [INFO ] Computing Do-Not-Accords matrix : 284 transitions.
[2022-05-17 02:15:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:15:22] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11794549581108429816
Running compilation step : cd /tmp/ltsmin11794549581108429816;'/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 1060 ms.
Running link step : cd /tmp/ltsmin11794549581108429816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11794549581108429816;'/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/stateBased6919635700944673599.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 319 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 319/319 places, 284/284 transitions.
Applied a total of 0 rules in 16 ms. Remains 319 /319 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:15:37] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:15:38] [INFO ] Implicit Places using invariants in 432 ms returned []
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:15:38] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:15:39] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
[2022-05-17 02:15:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 284 rows 319 cols
[2022-05-17 02:15:39] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:15:39] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 319/319 places, 284/284 transitions.
Built C files in :
/tmp/ltsmin2550613570205335761
[2022-05-17 02:15:39] [INFO ] Computing symmetric may disable matrix : 284 transitions.
[2022-05-17 02:15:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:15:39] [INFO ] Computing symmetric may enable matrix : 284 transitions.
[2022-05-17 02:15:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:15:39] [INFO ] Computing Do-Not-Accords matrix : 284 transitions.
[2022-05-17 02:15:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:15:39] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2550613570205335761
Running compilation step : cd /tmp/ltsmin2550613570205335761;'/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 1306 ms.
Running link step : cd /tmp/ltsmin2550613570205335761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2550613570205335761;'/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/stateBased6848858804052178116.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 02:15:54] [INFO ] Flatten gal took : 13 ms
[2022-05-17 02:15:54] [INFO ] Flatten gal took : 13 ms
[2022-05-17 02:15:54] [INFO ] Time to serialize gal into /tmp/LTL6500087873052846438.gal : 2 ms
[2022-05-17 02:15:54] [INFO ] Time to serialize properties into /tmp/LTL3609617440078169748.ltl : 0 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/LTL6500087873052846438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3609617440078169748.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/LTL6500087...266
Read 1 LTL properties
Checking formula 0 : !((F("((newmsg8>=1)&&(election_30_4_8_to_right_7>=1))")))
Formula 0 simplified : !F"((newmsg8>=1)&&(election_30_4_8_to_right_7>=1))"
Reverse transition relation is NOT exact ! Due to transitions t7, t32.t33, t36.t37, t40.t41, t44.t45, t50.t51, t54.t55, t59, t60.t61, t62.t63, t65, t66.t67...472
Computing Next relation with stutter on 6.70552e+21 deadlock states
Detected timeout of ITS tools.
[2022-05-17 02:16:09] [INFO ] Flatten gal took : 12 ms
[2022-05-17 02:16:09] [INFO ] Applying decomposition
[2022-05-17 02:16:09] [INFO ] Flatten gal took : 11 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/graph5784825862848091728.txt' '-o' '/tmp/graph5784825862848091728.bin' '-w' '/tmp/graph5784825862848091728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5784825862848091728.bin' '-l' '-1' '-v' '-w' '/tmp/graph5784825862848091728.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:16:09] [INFO ] Decomposing Gal with order
[2022-05-17 02:16:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:16:09] [INFO ] Removed a total of 180 redundant transitions.
[2022-05-17 02:16:09] [INFO ] Flatten gal took : 54 ms
[2022-05-17 02:16:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 25 ms.
[2022-05-17 02:16:09] [INFO ] Time to serialize gal into /tmp/LTL10230550980043077917.gal : 6 ms
[2022-05-17 02:16:09] [INFO ] Time to serialize properties into /tmp/LTL1565472861645046688.ltl : 0 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/LTL10230550980043077917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1565472861645046688.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/LTL1023055...246
Read 1 LTL properties
Checking formula 0 : !((F("((i5.u1.newmsg8>=1)&&(i5.u0.election_30_4_8_to_right_7>=1))")))
Formula 0 simplified : !F"((i5.u1.newmsg8>=1)&&(i5.u0.election_30_4_8_to_right_7>=1))"
Reverse transition relation is NOT exact ! Due to transitions t44_t45, t62_t63, t86_t87, t94_t95, t116_t117, t141_t142, t465_t466, i1.t40_t41, i1.t36_t37, ...568
Computing Next relation with stutter on 6.70552e+21 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
826 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.34007,219380,1,0,365135,507,4825,1.47004e+06,215,2627,345892
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-30-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property HirschbergSinclair-PT-30-LTLFireability-14 finished in 76351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(X(p0))&&p1))||X((F(p2)||p1))))'
Support contains 4 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 557/557 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 585 transition count 550
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 585 transition count 550
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 582 transition count 547
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 582 transition count 547
Applied a total of 20 rules in 93 ms. Remains 582 /592 variables (removed 10) and now considering 547/557 (removed 10) transitions.
// Phase 1: matrix 547 rows 582 cols
[2022-05-17 02:16:19] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-17 02:16:20] [INFO ] Implicit Places using invariants in 613 ms returned []
// Phase 1: matrix 547 rows 582 cols
[2022-05-17 02:16:20] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-17 02:16:23] [INFO ] Implicit Places using invariants and state equation in 3172 ms returned []
Implicit Place search using SMT with State Equation took 3796 ms to find 0 implicit places.
// Phase 1: matrix 547 rows 582 cols
[2022-05-17 02:16:23] [INFO ] Computed 35 place invariants in 9 ms
[2022-05-17 02:16:24] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 582/592 places, 547/557 transitions.
Finished structural reductions, in 1 iterations. Remains : 582/592 places, 547/557 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p1:(GEQ s151 1), p2:(LT s101 1), p0:(AND (GEQ s21 1) (GEQ s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 604 ms.
Product exploration explored 100000 steps with 50000 reset in 644 ms.
Computed a total of 582 stabilizing places and 547 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 582 transition count 547
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 p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 9 factoid took 148 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-30-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLFireability-15 finished in 6622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Found a SL insensitive property : HirschbergSinclair-PT-30-LTLFireability-02
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 592 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 592/592 places, 557/557 transitions.
Reduce places removed 28 places and 28 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 564 transition count 308
Reduce places removed 221 places and 0 transitions.
Iterating post reduction 1 with 221 rules applied. Total rules applied 442 place count 343 transition count 308
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 450 place count 335 transition count 300
Iterating global reduction 2 with 8 rules applied. Total rules applied 458 place count 335 transition count 300
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 461 place count 335 transition count 297
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 464 place count 332 transition count 297
Applied a total of 464 rules in 52 ms. Remains 332 /592 variables (removed 260) and now considering 297/557 (removed 260) transitions.
// Phase 1: matrix 297 rows 332 cols
[2022-05-17 02:16:26] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:16:27] [INFO ] Implicit Places using invariants in 545 ms returned []
// Phase 1: matrix 297 rows 332 cols
[2022-05-17 02:16:27] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-17 02:16:28] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
// Phase 1: matrix 297 rows 332 cols
[2022-05-17 02:16:28] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-17 02:16:28] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 332/592 places, 297/557 transitions.
Finished structural reductions, in 1 iterations. Remains : 332/592 places, 297/557 transitions.
Running random walk in product with property : HirschbergSinclair-PT-30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s26 1) (GEQ s305 1)), p1:(OR (LT s28 1) (LT s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 334 reset in 473 ms.
Product exploration explored 100000 steps with 334 reset in 423 ms.
Computed a total of 332 stabilizing places and 297 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 332 transition count 297
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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 298 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 312 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 409 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 297/297 transitions.
Applied a total of 0 rules in 12 ms. Remains 332 /332 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 332 cols
[2022-05-17 02:16:31] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:16:31] [INFO ] Implicit Places using invariants in 579 ms returned []
// Phase 1: matrix 297 rows 332 cols
[2022-05-17 02:16:31] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:16:32] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
// Phase 1: matrix 297 rows 332 cols
[2022-05-17 02:16:32] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:16:33] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 332/332 places, 297/297 transitions.
Computed a total of 332 stabilizing places and 297 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 332 transition count 297
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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 322 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 322 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 385 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 334 reset in 471 ms.
Product exploration explored 100000 steps with 334 reset in 513 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 332/332 places, 297/297 transitions.
Applied a total of 0 rules in 25 ms. Remains 332 /332 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2022-05-17 02:16:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 297 rows 332 cols
[2022-05-17 02:16:36] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-17 02:16:36] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 332/332 places, 297/297 transitions.
Product exploration explored 100000 steps with 334 reset in 296 ms.
Product exploration explored 100000 steps with 334 reset in 334 ms.
Built C files in :
/tmp/ltsmin8757499949597180746
[2022-05-17 02:16:37] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8757499949597180746
Running compilation step : cd /tmp/ltsmin8757499949597180746;'/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 779 ms.
Running link step : cd /tmp/ltsmin8757499949597180746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8757499949597180746;'/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/stateBased1343283787970314143.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 332/332 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 332 /332 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 332 cols
[2022-05-17 02:16:52] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-17 02:16:52] [INFO ] Implicit Places using invariants in 397 ms returned []
// Phase 1: matrix 297 rows 332 cols
[2022-05-17 02:16:52] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-17 02:16:54] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1662 ms to find 0 implicit places.
// Phase 1: matrix 297 rows 332 cols
[2022-05-17 02:16:54] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-17 02:16:54] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 332/332 places, 297/297 transitions.
Built C files in :
/tmp/ltsmin4962901128292967973
[2022-05-17 02:16:54] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4962901128292967973
Running compilation step : cd /tmp/ltsmin4962901128292967973;'/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 692 ms.
Running link step : cd /tmp/ltsmin4962901128292967973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4962901128292967973;'/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/stateBased11463886325063557481.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 02:17:09] [INFO ] Flatten gal took : 15 ms
[2022-05-17 02:17:09] [INFO ] Flatten gal took : 11 ms
[2022-05-17 02:17:09] [INFO ] Time to serialize gal into /tmp/LTL12537095432843536383.gal : 3 ms
[2022-05-17 02:17:09] [INFO ] Time to serialize properties into /tmp/LTL8580484261651232876.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/LTL12537095432843536383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8580484261651232876.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/LTL1253709...267
Read 1 LTL properties
Checking formula 0 : !(((F("((newmsg26>=1)&&(elected_30_to_left_27>=1))"))||(X(G("((newmsg27<1)||(election_30_3_3_to_left_28<1))")))))
Formula 0 simplified : !(F"((newmsg26>=1)&&(elected_30_to_left_27>=1))" | XG"((newmsg27<1)||(election_30_3_3_to_left_28<1))")
Reverse transition relation is NOT exact ! Due to transitions t25, t26, t32.t33, t36.t37, t40.t41, t44.t45, t50.t51, t54.t55, t58.t59, t62.t63, t66.t67, t7...481
Computing Next relation with stutter on 6.70552e+21 deadlock states
Detected timeout of ITS tools.
[2022-05-17 02:17:24] [INFO ] Flatten gal took : 11 ms
[2022-05-17 02:17:24] [INFO ] Applying decomposition
[2022-05-17 02:17:24] [INFO ] Flatten gal took : 11 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/graph11249356784879223016.txt' '-o' '/tmp/graph11249356784879223016.bin' '-w' '/tmp/graph11249356784879223016.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11249356784879223016.bin' '-l' '-1' '-v' '-w' '/tmp/graph11249356784879223016.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:17:24] [INFO ] Decomposing Gal with order
[2022-05-17 02:17:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:17:24] [INFO ] Removed a total of 169 redundant transitions.
[2022-05-17 02:17:24] [INFO ] Flatten gal took : 47 ms
[2022-05-17 02:17:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 7 ms.
[2022-05-17 02:17:24] [INFO ] Time to serialize gal into /tmp/LTL1361194195804186447.gal : 5 ms
[2022-05-17 02:17:24] [INFO ] Time to serialize properties into /tmp/LTL4283554018164939284.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/LTL1361194195804186447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4283554018164939284.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/LTL1361194...245
Read 1 LTL properties
Checking formula 0 : !(((F("((i0.u1.newmsg26>=1)&&(i2.u114.elected_30_to_left_27>=1))"))||(X(G("((i0.u2.newmsg27<1)||(i2.u3.election_30_3_3_to_left_28<1))"...160
Formula 0 simplified : !(F"((i0.u1.newmsg26>=1)&&(i2.u114.elected_30_to_left_27>=1))" | XG"((i0.u2.newmsg27<1)||(i2.u3.election_30_3_3_to_left_28<1))")
Reverse transition relation is NOT exact ! Due to transitions t44_t45, t62_t63, t78_t79, t94_t95, t111_t112, t138_t139, t145_t146, t465_t466, i0.t144, i0.t...583
Computing Next relation with stutter on 6.70552e+21 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11562111809727136886
[2022-05-17 02:17:39] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11562111809727136886
Running compilation step : cd /tmp/ltsmin11562111809727136886;'/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 753 ms.
Running link step : cd /tmp/ltsmin11562111809727136886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11562111809727136886;'/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))||X([]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-30-LTLFireability-02 finished in 88621 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p1)||G(F(p2))||p0)))'
[2022-05-17 02:17:55] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9191819389363575254
[2022-05-17 02:17:55] [INFO ] Computing symmetric may disable matrix : 557 transitions.
[2022-05-17 02:17:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:17:55] [INFO ] Computing symmetric may enable matrix : 557 transitions.
[2022-05-17 02:17:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:17:55] [INFO ] Applying decomposition
[2022-05-17 02:17:55] [INFO ] Flatten gal took : 26 ms
[2022-05-17 02:17:55] [INFO ] Computing Do-Not-Accords matrix : 557 transitions.
[2022-05-17 02:17:55] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 02:17:55] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9191819389363575254
Running compilation step : cd /tmp/ltsmin9191819389363575254;'/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'
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/graph9692785694775782749.txt' '-o' '/tmp/graph9692785694775782749.bin' '-w' '/tmp/graph9692785694775782749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9692785694775782749.bin' '-l' '-1' '-v' '-w' '/tmp/graph9692785694775782749.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:17:55] [INFO ] Decomposing Gal with order
[2022-05-17 02:17:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:17:55] [INFO ] Removed a total of 49 redundant transitions.
[2022-05-17 02:17:55] [INFO ] Flatten gal took : 48 ms
[2022-05-17 02:17:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-17 02:17:55] [INFO ] Time to serialize gal into /tmp/LTLFireability393058961567892311.gal : 6 ms
[2022-05-17 02:17:55] [INFO ] Time to serialize properties into /tmp/LTLFireability5441989071677198028.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/LTLFireability393058961567892311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5441989071677198028.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...266
Read 2 LTL properties
Checking formula 0 : !(((F("((i10.u33.newmsg26>=1)&&(i8.i0.u58.elected_30_to_left_27>=1))"))||(X(G("((i8.i0.u34.newmsg27<1)||(i8.i0.u34.election_30_3_3_to_...172
Formula 0 simplified : !(F"((i10.u33.newmsg26>=1)&&(i8.i0.u58.elected_30_to_left_27>=1))" | XG"((i8.i0.u34.newmsg27<1)||(i8.i0.u34.election_30_3_3_to_left_...163
Compilation finished in 2122 ms.
Running link step : cd /tmp/ltsmin9191819389363575254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9191819389363575254;'/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))||X([]((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t6, t8, t12, t14, t17, t19, t20, t24, t26, t28, t29, t43, t115, t526, t556, i0.t0...1098
Computing Next relation with stutter on 3.20361e+22 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: LTL layer: formula: (<>((LTLAPp0==true))||X([]((LTLAPp1==true))))
pins2lts-mc-linux64( 6/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.037: "(<>((LTLAPp0==true))||X([]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.050: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.070: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.145: DFS-FIFO for weak LTL, using special progress label 563
pins2lts-mc-linux64( 0/ 8), 0.145: There are 564 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.145: State length is 593, there are 561 groups
pins2lts-mc-linux64( 0/ 8), 0.145: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.145: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.145: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.145: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.534: ~1 levels ~960 states ~26984 transitions
pins2lts-mc-linux64( 0/ 8), 0.780: ~1 levels ~1920 states ~53272 transitions
pins2lts-mc-linux64( 0/ 8), 1.224: ~1 levels ~3840 states ~106008 transitions
pins2lts-mc-linux64( 3/ 8), 1.782: ~1 levels ~7680 states ~211528 transitions
pins2lts-mc-linux64( 5/ 8), 2.835: ~1 levels ~15360 states ~411392 transitions
pins2lts-mc-linux64( 3/ 8), 4.667: ~1 levels ~30720 states ~835216 transitions
pins2lts-mc-linux64( 0/ 8), 7.440: ~1 levels ~61440 states ~1664976 transitions
pins2lts-mc-linux64( 5/ 8), 12.298: ~1 levels ~122880 states ~3264592 transitions
pins2lts-mc-linux64( 0/ 8), 20.425: ~1 levels ~245760 states ~6586720 transitions
pins2lts-mc-linux64( 0/ 8), 36.839: ~1 levels ~491520 states ~13065328 transitions
pins2lts-mc-linux64( 6/ 8), 70.308: ~1 levels ~983040 states ~26106392 transitions
pins2lts-mc-linux64( 6/ 8), 136.592: ~1 levels ~1966080 states ~51866904 transitions
pins2lts-mc-linux64( 1/ 8), 200.362: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 200.722:
pins2lts-mc-linux64( 0/ 8), 200.722: mean standard work distribution: 1.1% (states) 0.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 200.722:
pins2lts-mc-linux64( 0/ 8), 200.722: Explored 2779418 states 73912819 transitions, fanout: 26.593
pins2lts-mc-linux64( 0/ 8), 200.722: Total exploration time 200.560 sec (200.220 sec minimum, 200.351 sec on average)
pins2lts-mc-linux64( 0/ 8), 200.722: States per second: 13858, Transitions per second: 368532
pins2lts-mc-linux64( 0/ 8), 200.722:
pins2lts-mc-linux64( 0/ 8), 200.722: Progress states detected: 14727016
pins2lts-mc-linux64( 0/ 8), 200.722: Redundant explorations: -81.1274
pins2lts-mc-linux64( 0/ 8), 200.722:
pins2lts-mc-linux64( 0/ 8), 200.722: Queue width: 8B, total height: 15621640, memory: 119.18MB
pins2lts-mc-linux64( 0/ 8), 200.722: Tree memory: 368.4MB, 26.2 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 200.722: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 200.722: Stored 568 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 200.722: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 200.722: Est. total memory use: 487.5MB (~1143.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9191819389363575254;'/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))||X([]((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9191819389363575254;'/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))||X([]((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-17 02:40:42] [INFO ] Flatten gal took : 35 ms
[2022-05-17 02:40:42] [INFO ] Time to serialize gal into /tmp/LTLFireability913535492530779932.gal : 5 ms
[2022-05-17 02:40:42] [INFO ] Time to serialize properties into /tmp/LTLFireability3622486491937519698.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/LTLFireability913535492530779932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3622486491937519698.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...287
Read 2 LTL properties
Checking formula 0 : !(((F("((newmsg26>=1)&&(elected_30_to_left_27>=1))"))||(X(G("((newmsg27<1)||(election_30_3_3_to_left_28<1))")))))
Formula 0 simplified : !(F"((newmsg26>=1)&&(elected_30_to_left_27>=1))" | XG"((newmsg27<1)||(election_30_3_3_to_left_28<1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...639
Computing Next relation with stutter on 3.20361e+22 deadlock states
Detected timeout of ITS tools.
[2022-05-17 03:03:29] [INFO ] Flatten gal took : 32 ms
[2022-05-17 03:03:29] [INFO ] Input system was already deterministic with 557 transitions.
[2022-05-17 03:03:29] [INFO ] Transformed 592 places.
[2022-05-17 03:03:29] [INFO ] Transformed 557 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-17 03:03:29] [INFO ] Time to serialize gal into /tmp/LTLFireability14303633338326537544.gal : 5 ms
[2022-05-17 03:03:29] [INFO ] Time to serialize properties into /tmp/LTLFireability900584506811714102.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/LTLFireability14303633338326537544.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability900584506811714102.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...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("((newmsg26>=1)&&(elected_30_to_left_27>=1))"))||(X(G("((newmsg27<1)||(election_30_3_3_to_left_28<1))")))))
Formula 0 simplified : !(F"((newmsg26>=1)&&(elected_30_to_left_27>=1))" | XG"((newmsg27<1)||(election_30_3_3_to_left_28<1))")

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-30"
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-30, 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-165264477500308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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