Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 9.7K Feb 26 02:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 02:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 02:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 02:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 02:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 02:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 02:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 321K Mar 5 18:22 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-25-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-25-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678580471613

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-25
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-12 00:21:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-12 00:21:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 00:21:14] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-12 00:21:14] [INFO ] Transformed 600 places.
[2023-03-12 00:21:14] [INFO ] Transformed 545 transitions.
[2023-03-12 00:21:14] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-25-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 545/545 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 575 transition count 545
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 48 place count 552 transition count 522
Iterating global reduction 1 with 23 rules applied. Total rules applied 71 place count 552 transition count 522
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 91 place count 532 transition count 502
Iterating global reduction 1 with 20 rules applied. Total rules applied 111 place count 532 transition count 502
Applied a total of 111 rules in 183 ms. Remains 532 /600 variables (removed 68) and now considering 502/545 (removed 43) transitions.
// Phase 1: matrix 502 rows 532 cols
[2023-03-12 00:21:15] [INFO ] Computed 30 place invariants in 72 ms
[2023-03-12 00:21:16] [INFO ] Implicit Places using invariants in 786 ms returned []
[2023-03-12 00:21:16] [INFO ] Invariant cache hit.
[2023-03-12 00:21:19] [INFO ] Implicit Places using invariants and state equation in 3804 ms returned []
Implicit Place search using SMT with State Equation took 4640 ms to find 0 implicit places.
[2023-03-12 00:21:19] [INFO ] Invariant cache hit.
[2023-03-12 00:21:20] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/600 places, 502/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5458 ms. Remains : 532/600 places, 502/545 transitions.
Support contains 50 out of 532 places after structural reductions.
[2023-03-12 00:21:20] [INFO ] Flatten gal took : 138 ms
[2023-03-12 00:21:20] [INFO ] Flatten gal took : 69 ms
[2023-03-12 00:21:21] [INFO ] Input system was already deterministic with 502 transitions.
Support contains 49 out of 532 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 666 ms. (steps per millisecond=15 ) properties (out of 30) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 00:21:21] [INFO ] Invariant cache hit.
[2023-03-12 00:21:22] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 157 ms returned sat
[2023-03-12 00:21:22] [INFO ] After 1000ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA HirschbergSinclair-PT-25-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 532 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 532 transition count 502
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 525 transition count 495
Applied a total of 14 rules in 89 ms. Remains 525 /532 variables (removed 7) and now considering 495/502 (removed 7) transitions.
// Phase 1: matrix 495 rows 525 cols
[2023-03-12 00:21:23] [INFO ] Computed 30 place invariants in 5 ms
[2023-03-12 00:21:23] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-12 00:21:23] [INFO ] Invariant cache hit.
[2023-03-12 00:21:25] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned []
Implicit Place search using SMT with State Equation took 2425 ms to find 0 implicit places.
[2023-03-12 00:21:25] [INFO ] Invariant cache hit.
[2023-03-12 00:21:26] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/532 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3215 ms. Remains : 525/532 places, 495/502 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s9 1) (LT s519 1) (AND (GEQ s459 1) (OR (LT s23 1) (LT s375 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 539 steps with 0 reset in 13 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-00 finished in 3532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U (p2||X(p0))))'
Support contains 5 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 528 transition count 498
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 528 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 526 transition count 496
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 526 transition count 496
Applied a total of 12 rules in 55 ms. Remains 526 /532 variables (removed 6) and now considering 496/502 (removed 6) transitions.
// Phase 1: matrix 496 rows 526 cols
[2023-03-12 00:21:26] [INFO ] Computed 30 place invariants in 4 ms
[2023-03-12 00:21:27] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-12 00:21:27] [INFO ] Invariant cache hit.
[2023-03-12 00:21:29] [INFO ] Implicit Places using invariants and state equation in 1951 ms returned []
Implicit Place search using SMT with State Equation took 2407 ms to find 0 implicit places.
[2023-03-12 00:21:29] [INFO ] Invariant cache hit.
[2023-03-12 00:21:29] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 526/532 places, 496/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2981 ms. Remains : 526/532 places, 496/502 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s478 1), p0:(AND (GEQ s41 1) (GEQ s132 1)), p1:(AND (GEQ s1 1) (GEQ s268 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 355 reset in 717 ms.
Product exploration explored 100000 steps with 355 reset in 577 ms.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 538 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Finished random walk after 286 steps, including 0 resets, run visited all 4 properties in 15 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 653 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
[2023-03-12 00:21:33] [INFO ] Invariant cache hit.
[2023-03-12 00:21:33] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 106 ms returned sat
[2023-03-12 00:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:21:38] [INFO ] [Real]Absence check using state equation in 4964 ms returned sat
[2023-03-12 00:21:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:21:39] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 131 ms returned sat
[2023-03-12 00:21:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:21:42] [INFO ] [Nat]Absence check using state equation in 2857 ms returned sat
[2023-03-12 00:21:42] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 60 ms.
[2023-03-12 00:21:46] [INFO ] Added : 207 causal constraints over 42 iterations in 3528 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-12 00:21:46] [INFO ] Invariant cache hit.
[2023-03-12 00:21:46] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 189 ms returned sat
[2023-03-12 00:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:21:55] [INFO ] [Real]Absence check using state equation in 8658 ms returned sat
[2023-03-12 00:21:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:21:56] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 153 ms returned sat
[2023-03-12 00:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:22:00] [INFO ] [Nat]Absence check using state equation in 4164 ms returned sat
[2023-03-12 00:22:00] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 46 ms.
[2023-03-12 00:22:09] [INFO ] Added : 186 causal constraints over 38 iterations in 9511 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Applied a total of 0 rules in 19 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2023-03-12 00:22:09] [INFO ] Invariant cache hit.
[2023-03-12 00:22:10] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-12 00:22:10] [INFO ] Invariant cache hit.
[2023-03-12 00:22:12] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2295 ms to find 0 implicit places.
[2023-03-12 00:22:12] [INFO ] Invariant cache hit.
[2023-03-12 00:22:12] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2728 ms. Remains : 526/526 places, 496/496 transitions.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
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 (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 542 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Finished random walk after 286 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 11 factoid took 622 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
[2023-03-12 00:22:14] [INFO ] Invariant cache hit.
[2023-03-12 00:22:14] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 93 ms returned sat
[2023-03-12 00:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:22:19] [INFO ] [Real]Absence check using state equation in 4909 ms returned sat
[2023-03-12 00:22:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:22:20] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 123 ms returned sat
[2023-03-12 00:22:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:22:23] [INFO ] [Nat]Absence check using state equation in 2877 ms returned sat
[2023-03-12 00:22:23] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 45 ms.
[2023-03-12 00:22:26] [INFO ] Added : 207 causal constraints over 42 iterations in 2982 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-12 00:22:26] [INFO ] Invariant cache hit.
[2023-03-12 00:22:26] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 147 ms returned sat
[2023-03-12 00:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:22:35] [INFO ] [Real]Absence check using state equation in 8531 ms returned sat
[2023-03-12 00:22:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:22:36] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 148 ms returned sat
[2023-03-12 00:22:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:22:40] [INFO ] [Nat]Absence check using state equation in 4149 ms returned sat
[2023-03-12 00:22:40] [INFO ] Computed and/alt/rep : 253/483/253 causal constraints (skipped 218 transitions) in 49 ms.
[2023-03-12 00:22:48] [INFO ] Added : 186 causal constraints over 38 iterations in 8629 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 355 reset in 292 ms.
Product exploration explored 100000 steps with 354 reset in 332 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1)]
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 526 transition count 496
Deduced a syphon composed of 196 places in 1 ms
Applied a total of 196 rules in 169 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
[2023-03-12 00:22:50] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 496 rows 526 cols
[2023-03-12 00:22:50] [INFO ] Computed 30 place invariants in 6 ms
[2023-03-12 00:22:50] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/526 places, 496/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 680 ms. Remains : 526/526 places, 496/496 transitions.
Built C files in :
/tmp/ltsmin4747220806392506667
[2023-03-12 00:22:50] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4747220806392506667
Running compilation step : cd /tmp/ltsmin4747220806392506667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1314 ms.
Running link step : cd /tmp/ltsmin4747220806392506667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin4747220806392506667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4096972924196114777.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 496/496 transitions.
Applied a total of 0 rules in 16 ms. Remains 526 /526 variables (removed 0) and now considering 496/496 (removed 0) transitions.
// Phase 1: matrix 496 rows 526 cols
[2023-03-12 00:23:05] [INFO ] Computed 30 place invariants in 4 ms
[2023-03-12 00:23:06] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-12 00:23:06] [INFO ] Invariant cache hit.
[2023-03-12 00:23:08] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned []
Implicit Place search using SMT with State Equation took 2340 ms to find 0 implicit places.
[2023-03-12 00:23:08] [INFO ] Invariant cache hit.
[2023-03-12 00:23:08] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2945 ms. Remains : 526/526 places, 496/496 transitions.
Built C files in :
/tmp/ltsmin3595337197038596535
[2023-03-12 00:23:08] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3595337197038596535
Running compilation step : cd /tmp/ltsmin3595337197038596535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1171 ms.
Running link step : cd /tmp/ltsmin3595337197038596535;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3595337197038596535;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16756393968761559141.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-12 00:23:24] [INFO ] Flatten gal took : 46 ms
[2023-03-12 00:23:24] [INFO ] Flatten gal took : 43 ms
[2023-03-12 00:23:24] [INFO ] Time to serialize gal into /tmp/LTL1856258452322345747.gal : 11 ms
[2023-03-12 00:23:24] [INFO ] Time to serialize properties into /tmp/LTL806475145561629856.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1856258452322345747.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9282404107436978827.hoa' '-atoms' '/tmp/LTL806475145561629856.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL806475145561629856.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9282404107436978827.hoa
Detected timeout of ITS tools.
[2023-03-12 00:23:39] [INFO ] Flatten gal took : 34 ms
[2023-03-12 00:23:39] [INFO ] Flatten gal took : 31 ms
[2023-03-12 00:23:39] [INFO ] Time to serialize gal into /tmp/LTL1465885668407175677.gal : 6 ms
[2023-03-12 00:23:39] [INFO ] Time to serialize properties into /tmp/LTL2273068059124669641.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1465885668407175677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2273068059124669641.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((F("((newmsg1>=1)&&(reply_25_3_to_left_2>=1))"))||("((newmsg21>=1)&&(reply_21_0_to_right_20>=1))"))U(("(rcv_left_election_25_5_13_...219
Formula 0 simplified : (!"((newmsg21>=1)&&(reply_21_0_to_right_20>=1))" & G!"((newmsg1>=1)&&(reply_25_3_to_left_2>=1))") R (!"(rcv_left_election_25_5_13_13...212
Detected timeout of ITS tools.
[2023-03-12 00:23:54] [INFO ] Flatten gal took : 31 ms
[2023-03-12 00:23:54] [INFO ] Applying decomposition
[2023-03-12 00:23:54] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7695549006364714262.txt' '-o' '/tmp/graph7695549006364714262.bin' '-w' '/tmp/graph7695549006364714262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7695549006364714262.bin' '-l' '-1' '-v' '-w' '/tmp/graph7695549006364714262.weights' '-q' '0' '-e' '0.001'
[2023-03-12 00:23:54] [INFO ] Decomposing Gal with order
[2023-03-12 00:23:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-12 00:23:54] [INFO ] Removed a total of 35 redundant transitions.
[2023-03-12 00:23:54] [INFO ] Flatten gal took : 105 ms
[2023-03-12 00:23:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2023-03-12 00:23:54] [INFO ] Time to serialize gal into /tmp/LTL8415699665650302990.gal : 11 ms
[2023-03-12 00:23:54] [INFO ] Time to serialize properties into /tmp/LTL15878778077732528481.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8415699665650302990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15878778077732528481.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((F("((i0.u0.newmsg1>=1)&&(i0.u1.reply_25_3_to_left_2>=1))"))||("((i7.u15.newmsg21>=1)&&(i6.u27.reply_21_0_to_right_20>=1))"))U(("(...266
Formula 0 simplified : (!"((i7.u15.newmsg21>=1)&&(i6.u27.reply_21_0_to_right_20>=1))" & G!"((i0.u0.newmsg1>=1)&&(i0.u1.reply_25_3_to_left_2>=1))") R (!"(i3...259
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17609767454256753985
[2023-03-12 00:24:09] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17609767454256753985
Running compilation step : cd /tmp/ltsmin17609767454256753985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1167 ms.
Running link step : cd /tmp/ltsmin17609767454256753985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17609767454256753985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp0==true))||(LTLAPp1==true)) U ((LTLAPp2==true)||X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-01 finished in 178154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 508 transition count 266
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 296 transition count 266
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 429 place count 291 transition count 261
Iterating global reduction 2 with 5 rules applied. Total rules applied 434 place count 291 transition count 261
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 436 place count 291 transition count 259
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 438 place count 289 transition count 259
Applied a total of 438 rules in 80 ms. Remains 289 /532 variables (removed 243) and now considering 259/502 (removed 243) transitions.
// Phase 1: matrix 259 rows 289 cols
[2023-03-12 00:24:25] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-12 00:24:25] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-12 00:24:25] [INFO ] Invariant cache hit.
[2023-03-12 00:24:26] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
[2023-03-12 00:24:26] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 00:24:26] [INFO ] Invariant cache hit.
[2023-03-12 00:24:26] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/532 places, 259/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1398 ms. Remains : 289/532 places, 259/502 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s278 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 365 reset in 259 ms.
Product exploration explored 100000 steps with 365 reset in 336 ms.
Computed a total of 289 stabilizing places and 259 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 259
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 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 287 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=95 )
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 205 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-12 00:24:27] [INFO ] Invariant cache hit.
[2023-03-12 00:24:28] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 90 ms returned sat
[2023-03-12 00:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:24:30] [INFO ] [Real]Absence check using state equation in 2269 ms returned sat
[2023-03-12 00:24:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:24:30] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 82 ms returned sat
[2023-03-12 00:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:24:31] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2023-03-12 00:24:31] [INFO ] Computed and/alt/rep : 206/229/206 causal constraints (skipped 7 transitions) in 19 ms.
[2023-03-12 00:24:33] [INFO ] Added : 186 causal constraints over 38 iterations in 1917 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 259/259 transitions.
Applied a total of 0 rules in 29 ms. Remains 289 /289 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2023-03-12 00:24:33] [INFO ] Invariant cache hit.
[2023-03-12 00:24:33] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-12 00:24:33] [INFO ] Invariant cache hit.
[2023-03-12 00:24:34] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2023-03-12 00:24:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 00:24:34] [INFO ] Invariant cache hit.
[2023-03-12 00:24:34] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1592 ms. Remains : 289/289 places, 259/259 transitions.
Computed a total of 289 stabilizing places and 259 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 259
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 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 286 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=143 )
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 193 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-12 00:24:35] [INFO ] Invariant cache hit.
[2023-03-12 00:24:35] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 60 ms returned sat
[2023-03-12 00:24:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:24:38] [INFO ] [Real]Absence check using state equation in 2175 ms returned sat
[2023-03-12 00:24:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:24:38] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 87 ms returned sat
[2023-03-12 00:24:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:24:39] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2023-03-12 00:24:39] [INFO ] Computed and/alt/rep : 206/229/206 causal constraints (skipped 7 transitions) in 24 ms.
[2023-03-12 00:24:41] [INFO ] Added : 186 causal constraints over 38 iterations in 1917 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 365 reset in 259 ms.
Product exploration explored 100000 steps with 365 reset in 243 ms.
Built C files in :
/tmp/ltsmin10033789590067369984
[2023-03-12 00:24:41] [INFO ] Computing symmetric may disable matrix : 259 transitions.
[2023-03-12 00:24:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:24:41] [INFO ] Computing symmetric may enable matrix : 259 transitions.
[2023-03-12 00:24:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:24:41] [INFO ] Computing Do-Not-Accords matrix : 259 transitions.
[2023-03-12 00:24:41] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:24:41] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10033789590067369984
Running compilation step : cd /tmp/ltsmin10033789590067369984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 987 ms.
Running link step : cd /tmp/ltsmin10033789590067369984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10033789590067369984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14867891786818786938.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 259/259 transitions.
Applied a total of 0 rules in 21 ms. Remains 289 /289 variables (removed 0) and now considering 259/259 (removed 0) transitions.
[2023-03-12 00:24:56] [INFO ] Invariant cache hit.
[2023-03-12 00:24:57] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-12 00:24:57] [INFO ] Invariant cache hit.
[2023-03-12 00:24:58] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
[2023-03-12 00:24:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 00:24:58] [INFO ] Invariant cache hit.
[2023-03-12 00:24:58] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1558 ms. Remains : 289/289 places, 259/259 transitions.
Built C files in :
/tmp/ltsmin12497294256296886152
[2023-03-12 00:24:58] [INFO ] Computing symmetric may disable matrix : 259 transitions.
[2023-03-12 00:24:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:24:58] [INFO ] Computing symmetric may enable matrix : 259 transitions.
[2023-03-12 00:24:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:24:58] [INFO ] Computing Do-Not-Accords matrix : 259 transitions.
[2023-03-12 00:24:58] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:24:58] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12497294256296886152
Running compilation step : cd /tmp/ltsmin12497294256296886152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 812 ms.
Running link step : cd /tmp/ltsmin12497294256296886152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12497294256296886152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11772778607587037264.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-12 00:25:13] [INFO ] Flatten gal took : 13 ms
[2023-03-12 00:25:13] [INFO ] Flatten gal took : 12 ms
[2023-03-12 00:25:13] [INFO ] Time to serialize gal into /tmp/LTL5023408725660040989.gal : 2 ms
[2023-03-12 00:25:13] [INFO ] Time to serialize properties into /tmp/LTL9152359201053594317.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5023408725660040989.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13550608427042347825.hoa' '-atoms' '/tmp/LTL9152359201053594317.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9152359201053594317.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13550608427042347825.hoa
Reverse transition relation is NOT exact ! Due to transitions t9, t27.t28, t31.t32, t35.t36, t39.t40, t43.t44, t47.t48, t53.t54, t57.t58, t62, t63.t64, t66...416
Computing Next relation with stutter on 1.78814e+18 deadlock states
Detected timeout of ITS tools.
[2023-03-12 00:25:28] [INFO ] Flatten gal took : 20 ms
[2023-03-12 00:25:28] [INFO ] Flatten gal took : 18 ms
[2023-03-12 00:25:28] [INFO ] Time to serialize gal into /tmp/LTL1157827587973645615.gal : 3 ms
[2023-03-12 00:25:28] [INFO ] Time to serialize properties into /tmp/LTL11460021213707728673.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1157827587973645615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11460021213707728673.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("((newmsg10>=1)&&(elected_25_to_left_11>=1))")))
Formula 0 simplified : G!"((newmsg10>=1)&&(elected_25_to_left_11>=1))"
Reverse transition relation is NOT exact ! Due to transitions t9, t27.t28, t31.t32, t35.t36, t39.t40, t43.t44, t47.t48, t53.t54, t57.t58, t62, t63.t64, t66...416
Computing Next relation with stutter on 1.78814e+18 deadlock states
Detected timeout of ITS tools.
[2023-03-12 00:25:43] [INFO ] Flatten gal took : 16 ms
[2023-03-12 00:25:43] [INFO ] Applying decomposition
[2023-03-12 00:25:43] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7396218028153970600.txt' '-o' '/tmp/graph7396218028153970600.bin' '-w' '/tmp/graph7396218028153970600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7396218028153970600.bin' '-l' '-1' '-v' '-w' '/tmp/graph7396218028153970600.weights' '-q' '0' '-e' '0.001'
[2023-03-12 00:25:43] [INFO ] Decomposing Gal with order
[2023-03-12 00:25:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-12 00:25:43] [INFO ] Removed a total of 163 redundant transitions.
[2023-03-12 00:25:44] [INFO ] Flatten gal took : 46 ms
[2023-03-12 00:25:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 23 ms.
[2023-03-12 00:25:44] [INFO ] Time to serialize gal into /tmp/LTL3335188358071770536.gal : 8 ms
[2023-03-12 00:25:44] [INFO ] Time to serialize properties into /tmp/LTL8759388771481917330.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3335188358071770536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8759388771481917330.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F("((i0.u0.newmsg10>=1)&&(i7.u112.elected_25_to_left_11>=1))")))
Formula 0 simplified : G!"((i0.u0.newmsg10>=1)&&(i7.u112.elected_25_to_left_11>=1))"
Reverse transition relation is NOT exact ! Due to transitions t27_t28, t43_t44, t53_t54, t66_t67, t91_t92, t103_t104, t166_t167, t473_t474, i0.t57_t58, i0....495
Computing Next relation with stutter on 1.78814e+18 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4927491486824562651
[2023-03-12 00:25:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4927491486824562651
Running compilation step : cd /tmp/ltsmin4927491486824562651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 608 ms.
Running link step : cd /tmp/ltsmin4927491486824562651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4927491486824562651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-25-LTLFireability-02 finished in 109199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 5 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 525 transition count 495
Applied a total of 14 rules in 42 ms. Remains 525 /532 variables (removed 7) and now considering 495/502 (removed 7) transitions.
// Phase 1: matrix 495 rows 525 cols
[2023-03-12 00:26:14] [INFO ] Computed 30 place invariants in 4 ms
[2023-03-12 00:26:14] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-12 00:26:14] [INFO ] Invariant cache hit.
[2023-03-12 00:26:16] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned []
Implicit Place search using SMT with State Equation took 2619 ms to find 0 implicit places.
[2023-03-12 00:26:16] [INFO ] Invariant cache hit.
[2023-03-12 00:26:17] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/532 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3152 ms. Remains : 525/532 places, 495/502 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s15 1) (LT s82 1) (AND (GEQ s1 1) (GEQ s163 1))), p1:(LT s405 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-03 finished in 3315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F((G(p1)||G(!p1)))&&p0))))'
Support contains 4 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 526 transition count 496
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 526 transition count 496
Applied a total of 12 rules in 43 ms. Remains 526 /532 variables (removed 6) and now considering 496/502 (removed 6) transitions.
// Phase 1: matrix 496 rows 526 cols
[2023-03-12 00:26:17] [INFO ] Computed 30 place invariants in 6 ms
[2023-03-12 00:26:18] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-12 00:26:18] [INFO ] Invariant cache hit.
[2023-03-12 00:26:19] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2264 ms to find 0 implicit places.
[2023-03-12 00:26:19] [INFO ] Invariant cache hit.
[2023-03-12 00:26:20] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 526/532 places, 496/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2773 ms. Remains : 526/532 places, 496/502 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), false, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s49 1) (GEQ s500 1)), p1:(OR (LT s21 1) (LT s94 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1079 steps with 1 reset in 5 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-04 finished in 2952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(X(p0) U X(p1))||(G(!p0)&&X(p2)))))'
Support contains 4 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 530 transition count 500
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 530 transition count 500
Applied a total of 4 rules in 31 ms. Remains 530 /532 variables (removed 2) and now considering 500/502 (removed 2) transitions.
// Phase 1: matrix 500 rows 530 cols
[2023-03-12 00:26:20] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-12 00:26:21] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-12 00:26:21] [INFO ] Invariant cache hit.
[2023-03-12 00:26:22] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 2242 ms to find 0 implicit places.
[2023-03-12 00:26:22] [INFO ] Invariant cache hit.
[2023-03-12 00:26:23] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 530/532 places, 500/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2682 ms. Remains : 530/532 places, 500/502 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), (AND p0 p1), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s504 1), p1:(GEQ s77 1), p2:(OR (LT s19 1) (LT s90 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 850 ms.
Product exploration explored 100000 steps with 50000 reset in 837 ms.
Computed a total of 530 stabilizing places and 500 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 530 transition count 500
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) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 16 factoid took 570 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-05 finished in 5328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 525 transition count 495
Applied a total of 14 rules in 47 ms. Remains 525 /532 variables (removed 7) and now considering 495/502 (removed 7) transitions.
// Phase 1: matrix 495 rows 525 cols
[2023-03-12 00:26:25] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-12 00:26:26] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-12 00:26:26] [INFO ] Invariant cache hit.
[2023-03-12 00:26:28] [INFO ] Implicit Places using invariants and state equation in 2288 ms returned []
Implicit Place search using SMT with State Equation took 2802 ms to find 0 implicit places.
[2023-03-12 00:26:28] [INFO ] Invariant cache hit.
[2023-03-12 00:26:29] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/532 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3364 ms. Remains : 525/532 places, 495/502 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s29 1) (GEQ s480 1)), p0:(GEQ s400 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 209 reset in 239 ms.
Product exploration explored 100000 steps with 209 reset in 271 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
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) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 444 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Finished random walk after 474 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=94 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 358 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
[2023-03-12 00:26:30] [INFO ] Invariant cache hit.
[2023-03-12 00:26:31] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 142 ms returned sat
[2023-03-12 00:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:26:41] [INFO ] [Real]Absence check using state equation in 10131 ms returned sat
[2023-03-12 00:26:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:26:42] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 209 ms returned sat
[2023-03-12 00:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:26:46] [INFO ] [Nat]Absence check using state equation in 3886 ms returned sat
[2023-03-12 00:26:46] [INFO ] Computed and/alt/rep : 253/482/253 causal constraints (skipped 217 transitions) in 35 ms.
[2023-03-12 00:26:56] [INFO ] Added : 219 causal constraints over 44 iterations in 9766 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 525 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 : 525/525 places, 495/495 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 501 transition count 261
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 291 transition count 261
Applied a total of 420 rules in 22 ms. Remains 291 /525 variables (removed 234) and now considering 261/495 (removed 234) transitions.
// Phase 1: matrix 261 rows 291 cols
[2023-03-12 00:26:56] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-12 00:26:56] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-12 00:26:56] [INFO ] Invariant cache hit.
[2023-03-12 00:26:57] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
[2023-03-12 00:26:57] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 00:26:57] [INFO ] Invariant cache hit.
[2023-03-12 00:26:57] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/525 places, 261/495 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1583 ms. Remains : 291/525 places, 261/495 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
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 p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Finished random walk after 266 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=88 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
[2023-03-12 00:26:58] [INFO ] Invariant cache hit.
[2023-03-12 00:26:58] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 86 ms returned sat
[2023-03-12 00:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:27:00] [INFO ] [Real]Absence check using state equation in 1387 ms returned sat
[2023-03-12 00:27:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:27:00] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 83 ms returned sat
[2023-03-12 00:27:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:27:01] [INFO ] [Nat]Absence check using state equation in 1224 ms returned sat
[2023-03-12 00:27:01] [INFO ] Computed and/alt/rep : 208/231/208 causal constraints (skipped 7 transitions) in 17 ms.
[2023-03-12 00:27:03] [INFO ] Added : 157 causal constraints over 32 iterations in 1242 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Product exploration explored 100000 steps with 417 reset in 213 ms.
Product exploration explored 100000 steps with 417 reset in 248 ms.
Built C files in :
/tmp/ltsmin14553130900422338099
[2023-03-12 00:27:03] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2023-03-12 00:27:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:27:03] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2023-03-12 00:27:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:27:03] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2023-03-12 00:27:03] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:27:03] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14553130900422338099
Running compilation step : cd /tmp/ltsmin14553130900422338099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 781 ms.
Running link step : cd /tmp/ltsmin14553130900422338099;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14553130900422338099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18389990419797858954.hoa' '--buchi-type=spotba'
LTSmin run took 1419 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-25-LTLFireability-06 finished in 40000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((((X(p1) U p2)&&X(!p1))||p0))))'
Support contains 6 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 525 transition count 495
Applied a total of 14 rules in 45 ms. Remains 525 /532 variables (removed 7) and now considering 495/502 (removed 7) transitions.
// Phase 1: matrix 495 rows 525 cols
[2023-03-12 00:27:05] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-12 00:27:06] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-12 00:27:06] [INFO ] Invariant cache hit.
[2023-03-12 00:27:08] [INFO ] Implicit Places using invariants and state equation in 2028 ms returned []
Implicit Place search using SMT with State Equation took 2454 ms to find 0 implicit places.
[2023-03-12 00:27:08] [INFO ] Invariant cache hit.
[2023-03-12 00:27:08] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/532 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3054 ms. Remains : 525/532 places, 495/502 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s148 1) (LT s153 1)), p2:(AND (GEQ s336 1) (GEQ s401 1)), p1:(AND (GEQ s35 1) (GEQ s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 732 ms.
Product exploration explored 100000 steps with 50000 reset in 768 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 10 factoid took 326 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLFireability-07 finished in 5221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 525 transition count 495
Applied a total of 14 rules in 51 ms. Remains 525 /532 variables (removed 7) and now considering 495/502 (removed 7) transitions.
[2023-03-12 00:27:11] [INFO ] Invariant cache hit.
[2023-03-12 00:27:11] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-12 00:27:11] [INFO ] Invariant cache hit.
[2023-03-12 00:27:13] [INFO ] Implicit Places using invariants and state equation in 2007 ms returned []
Implicit Place search using SMT with State Equation took 2369 ms to find 0 implicit places.
[2023-03-12 00:27:13] [INFO ] Invariant cache hit.
[2023-03-12 00:27:13] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/532 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2831 ms. Remains : 525/532 places, 495/502 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s170 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-09 finished in 2965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 527 transition count 497
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 527 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 525 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 525 transition count 495
Applied a total of 14 rules in 52 ms. Remains 525 /532 variables (removed 7) and now considering 495/502 (removed 7) transitions.
[2023-03-12 00:27:14] [INFO ] Invariant cache hit.
[2023-03-12 00:27:14] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-12 00:27:14] [INFO ] Invariant cache hit.
[2023-03-12 00:27:16] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2290 ms to find 0 implicit places.
[2023-03-12 00:27:16] [INFO ] Invariant cache hit.
[2023-03-12 00:27:16] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/532 places, 495/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2929 ms. Remains : 525/532 places, 495/502 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s443 1), p1:(AND (GEQ s37 1) (GEQ s322 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-10 finished in 3195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 508 transition count 274
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 304 transition count 274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 413 place count 299 transition count 269
Iterating global reduction 2 with 5 rules applied. Total rules applied 418 place count 299 transition count 269
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 421 place count 299 transition count 266
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 424 place count 296 transition count 266
Applied a total of 424 rules in 37 ms. Remains 296 /532 variables (removed 236) and now considering 266/502 (removed 236) transitions.
// Phase 1: matrix 266 rows 296 cols
[2023-03-12 00:27:17] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-12 00:27:17] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-12 00:27:17] [INFO ] Invariant cache hit.
[2023-03-12 00:27:18] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
[2023-03-12 00:27:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 00:27:18] [INFO ] Invariant cache hit.
[2023-03-12 00:27:18] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/532 places, 266/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1544 ms. Remains : 296/532 places, 266/502 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s32 1), p1:(AND (GEQ s25 1) (GEQ s244 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 67446 steps with 254 reset in 155 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLFireability-11 finished in 1790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(p1) U X(p0))))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 528 transition count 498
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 528 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 526 transition count 496
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 526 transition count 496
Applied a total of 12 rules in 47 ms. Remains 526 /532 variables (removed 6) and now considering 496/502 (removed 6) transitions.
// Phase 1: matrix 496 rows 526 cols
[2023-03-12 00:27:19] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-12 00:27:19] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-12 00:27:19] [INFO ] Invariant cache hit.
[2023-03-12 00:27:21] [INFO ] Implicit Places using invariants and state equation in 2077 ms returned []
Implicit Place search using SMT with State Equation took 2443 ms to find 0 implicit places.
[2023-03-12 00:27:21] [INFO ] Invariant cache hit.
[2023-03-12 00:27:22] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 526/532 places, 496/502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3077 ms. Remains : 526/532 places, 496/502 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s359 1), p0:(AND (GEQ s21 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2649 reset in 407 ms.
Product exploration explored 100000 steps with 2617 reset in 448 ms.
Computed a total of 526 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 526 transition count 496
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) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 439 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 9 factoid took 430 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-12 00:27:24] [INFO ] Invariant cache hit.
[2023-03-12 00:27:25] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 99 ms returned sat
[2023-03-12 00:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:27:39] [INFO ] [Real]Absence check using state equation in 14436 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 526 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 : 526/526 places, 496/496 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 503 transition count 261
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 291 transition count 261
Applied a total of 424 rules in 21 ms. Remains 291 /526 variables (removed 235) and now considering 261/496 (removed 235) transitions.
// Phase 1: matrix 261 rows 291 cols
[2023-03-12 00:27:39] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-12 00:27:39] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-12 00:27:39] [INFO ] Invariant cache hit.
[2023-03-12 00:27:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 00:27:40] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1364 ms to find 0 implicit places.
[2023-03-12 00:27:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 00:27:40] [INFO ] Invariant cache hit.
[2023-03-12 00:27:41] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 291/526 places, 261/496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1772 ms. Remains : 291/526 places, 261/496 transitions.
Computed a total of 291 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 291 transition count 261
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)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-12 00:27:41] [INFO ] Invariant cache hit.
[2023-03-12 00:27:42] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 56 ms returned sat
[2023-03-12 00:27:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:27:43] [INFO ] [Real]Absence check using state equation in 1853 ms returned sat
[2023-03-12 00:27:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:27:44] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 60 ms returned sat
[2023-03-12 00:27:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:27:45] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2023-03-12 00:27:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 00:27:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-12 00:27:45] [INFO ] Computed and/alt/rep : 207/231/207 causal constraints (skipped 9 transitions) in 20 ms.
[2023-03-12 00:27:46] [INFO ] Added : 96 causal constraints over 20 iterations in 936 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2370 reset in 441 ms.
Product exploration explored 100000 steps with 2372 reset in 492 ms.
Built C files in :
/tmp/ltsmin2724153580738304054
[2023-03-12 00:27:47] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2023-03-12 00:27:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:27:47] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2023-03-12 00:27:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:27:47] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2023-03-12 00:27:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:27:47] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2724153580738304054
Running compilation step : cd /tmp/ltsmin2724153580738304054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 780 ms.
Running link step : cd /tmp/ltsmin2724153580738304054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2724153580738304054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14060957312695639429.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 261/261 transitions.
Applied a total of 0 rules in 13 ms. Remains 291 /291 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-12 00:28:02] [INFO ] Invariant cache hit.
[2023-03-12 00:28:02] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-12 00:28:02] [INFO ] Invariant cache hit.
[2023-03-12 00:28:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 00:28:03] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
[2023-03-12 00:28:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 00:28:03] [INFO ] Invariant cache hit.
[2023-03-12 00:28:03] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1718 ms. Remains : 291/291 places, 261/261 transitions.
Built C files in :
/tmp/ltsmin10250307648589455306
[2023-03-12 00:28:03] [INFO ] Computing symmetric may disable matrix : 261 transitions.
[2023-03-12 00:28:03] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:28:03] [INFO ] Computing symmetric may enable matrix : 261 transitions.
[2023-03-12 00:28:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:28:03] [INFO ] Computing Do-Not-Accords matrix : 261 transitions.
[2023-03-12 00:28:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:28:03] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10250307648589455306
Running compilation step : cd /tmp/ltsmin10250307648589455306;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 762 ms.
Running link step : cd /tmp/ltsmin10250307648589455306;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10250307648589455306;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17491595147700323106.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-12 00:28:18] [INFO ] Flatten gal took : 10 ms
[2023-03-12 00:28:18] [INFO ] Flatten gal took : 8 ms
[2023-03-12 00:28:18] [INFO ] Time to serialize gal into /tmp/LTL6684167059329933344.gal : 3 ms
[2023-03-12 00:28:18] [INFO ] Time to serialize properties into /tmp/LTL1630905761377539250.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6684167059329933344.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10141373621819299838.hoa' '-atoms' '/tmp/LTL1630905761377539250.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1630905761377539250.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10141373621819299838.hoa
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t27.t28, t31.t32, t35.t36, t39.t40, t43.t44, t47.t48, t53.t54, t57.t58, t61.t62, t63...426
Computing Next relation with stutter on 2.14577e+18 deadlock states
Detected timeout of ITS tools.
[2023-03-12 00:28:34] [INFO ] Flatten gal took : 14 ms
[2023-03-12 00:28:34] [INFO ] Flatten gal took : 19 ms
[2023-03-12 00:28:34] [INFO ] Time to serialize gal into /tmp/LTL18086129610487356849.gal : 3 ms
[2023-03-12 00:28:34] [INFO ] Time to serialize properties into /tmp/LTL7948654794246860204.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18086129610487356849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7948654794246860204.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((!("((newmsg11>=1)&&(election_10_0_1_to_right_10>=1))"))U((G("(rcv_left_election_25_4_11_11>=1)"))U(X("((newmsg11>=1)&&(election_10...182
Formula 0 simplified : "((newmsg11>=1)&&(election_10_0_1_to_right_10>=1))" R (F!"(rcv_left_election_25_4_11_11>=1)" R X!"((newmsg11>=1)&&(election_10_0_1_t...172
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t27.t28, t31.t32, t35.t36, t39.t40, t43.t44, t47.t48, t53.t54, t57.t58, t61.t62, t63...426
Computing Next relation with stutter on 2.14577e+18 deadlock states
Detected timeout of ITS tools.
[2023-03-12 00:28:49] [INFO ] Flatten gal took : 9 ms
[2023-03-12 00:28:49] [INFO ] Applying decomposition
[2023-03-12 00:28:49] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13057675244383326276.txt' '-o' '/tmp/graph13057675244383326276.bin' '-w' '/tmp/graph13057675244383326276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13057675244383326276.bin' '-l' '-1' '-v' '-w' '/tmp/graph13057675244383326276.weights' '-q' '0' '-e' '0.001'
[2023-03-12 00:28:49] [INFO ] Decomposing Gal with order
[2023-03-12 00:28:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-12 00:28:49] [INFO ] Removed a total of 166 redundant transitions.
[2023-03-12 00:28:49] [INFO ] Flatten gal took : 24 ms
[2023-03-12 00:28:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 10 ms.
[2023-03-12 00:28:49] [INFO ] Time to serialize gal into /tmp/LTL13912174641855916217.gal : 5 ms
[2023-03-12 00:28:49] [INFO ] Time to serialize properties into /tmp/LTL15458952949204775649.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13912174641855916217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15458952949204775649.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((!("((i1.i0.u0.newmsg11>=1)&&(i1.i0.u0.election_10_0_1_to_right_10>=1))"))U((G("(i1.i0.u0.rcv_left_election_25_4_11_11>=1)"))U(X("(...227
Formula 0 simplified : "((i1.i0.u0.newmsg11>=1)&&(i1.i0.u0.election_10_0_1_to_right_10>=1))" R (F!"(i1.i0.u0.rcv_left_election_25_4_11_11>=1)" R X!"((i1.i0...217
Reverse transition relation is NOT exact ! Due to transitions t35_t36, t71_t72, t79_t80, t95_t96, t112_t113, t229_t230, t423_t424, i1.t9, i1.i0.t10, i1.i0....545
Computing Next relation with stutter on 2.14577e+18 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
588 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,5.93699,182016,1,0,324813,939,4787,1.11409e+06,287,4105,324615
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-25-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property HirschbergSinclair-PT-25-LTLFireability-14 finished in 97229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(((X(F(p1))&&G(!p0))||G(F(p1)))))))'
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 502/502 transitions.
Reduce places removed 24 places and 24 transitions.
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 508 transition count 274
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 304 transition count 274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 413 place count 299 transition count 269
Iterating global reduction 2 with 5 rules applied. Total rules applied 418 place count 299 transition count 269
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 421 place count 299 transition count 266
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 424 place count 296 transition count 266
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 425 place count 295 transition count 265
Iterating global reduction 4 with 1 rules applied. Total rules applied 426 place count 295 transition count 265
Applied a total of 426 rules in 42 ms. Remains 295 /532 variables (removed 237) and now considering 265/502 (removed 237) transitions.
// Phase 1: matrix 265 rows 295 cols
[2023-03-12 00:28:56] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-12 00:28:56] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-12 00:28:56] [INFO ] Invariant cache hit.
[2023-03-12 00:28:57] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
[2023-03-12 00:28:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 00:28:57] [INFO ] Invariant cache hit.
[2023-03-12 00:28:57] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 295/532 places, 265/502 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1592 ms. Remains : 295/532 places, 265/502 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s25 1) (GEQ s86 1)), p1:(LT s224 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1120 reset in 338 ms.
Product exploration explored 100000 steps with 1120 reset in 379 ms.
Computed a total of 295 stabilizing places and 265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 295 transition count 265
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 p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 98 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2023-03-12 00:28:59] [INFO ] Invariant cache hit.
[2023-03-12 00:28:59] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 65 ms returned sat
[2023-03-12 00:28:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:29:00] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2023-03-12 00:29:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:29:00] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 82 ms returned sat
[2023-03-12 00:29:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:29:01] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2023-03-12 00:29:01] [INFO ] Computed and/alt/rep : 205/210/205 causal constraints (skipped 13 transitions) in 16 ms.
[2023-03-12 00:29:01] [INFO ] Added : 13 causal constraints over 3 iterations in 138 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 295 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 : 295/295 places, 265/265 transitions.
Applied a total of 0 rules in 19 ms. Remains 295 /295 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2023-03-12 00:29:01] [INFO ] Invariant cache hit.
[2023-03-12 00:29:02] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-12 00:29:02] [INFO ] Invariant cache hit.
[2023-03-12 00:29:02] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
[2023-03-12 00:29:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 00:29:02] [INFO ] Invariant cache hit.
[2023-03-12 00:29:03] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1512 ms. Remains : 295/295 places, 265/265 transitions.
Computed a total of 295 stabilizing places and 265 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 295 transition count 265
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 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
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 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2023-03-12 00:29:03] [INFO ] Invariant cache hit.
[2023-03-12 00:29:04] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 65 ms returned sat
[2023-03-12 00:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:29:04] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2023-03-12 00:29:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:29:05] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 134 ms returned sat
[2023-03-12 00:29:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:29:05] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2023-03-12 00:29:05] [INFO ] Computed and/alt/rep : 205/210/205 causal constraints (skipped 13 transitions) in 18 ms.
[2023-03-12 00:29:06] [INFO ] Added : 13 causal constraints over 3 iterations in 141 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1121 reset in 557 ms.
Product exploration explored 100000 steps with 1121 reset in 387 ms.
Built C files in :
/tmp/ltsmin16830241897621675302
[2023-03-12 00:29:07] [INFO ] Computing symmetric may disable matrix : 265 transitions.
[2023-03-12 00:29:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:29:07] [INFO ] Computing symmetric may enable matrix : 265 transitions.
[2023-03-12 00:29:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:29:07] [INFO ] Computing Do-Not-Accords matrix : 265 transitions.
[2023-03-12 00:29:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:29:07] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16830241897621675302
Running compilation step : cd /tmp/ltsmin16830241897621675302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 878 ms.
Running link step : cd /tmp/ltsmin16830241897621675302;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16830241897621675302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased772874206491632876.hoa' '--buchi-type=spotba'
LTSmin run took 3341 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-25-LTLFireability-15 finished in 15174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U (p2||X(p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2023-03-12 00:29:11] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10725170884399465158
[2023-03-12 00:29:11] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2023-03-12 00:29:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:29:11] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2023-03-12 00:29:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:29:11] [INFO ] Applying decomposition
[2023-03-12 00:29:11] [INFO ] Flatten gal took : 16 ms
[2023-03-12 00:29:11] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2023-03-12 00:29:11] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-12 00:29:11] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10725170884399465158
Running compilation step : cd /tmp/ltsmin10725170884399465158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1166172076744929106.txt' '-o' '/tmp/graph1166172076744929106.bin' '-w' '/tmp/graph1166172076744929106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1166172076744929106.bin' '-l' '-1' '-v' '-w' '/tmp/graph1166172076744929106.weights' '-q' '0' '-e' '0.001'
[2023-03-12 00:29:11] [INFO ] Decomposing Gal with order
[2023-03-12 00:29:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-12 00:29:11] [INFO ] Removed a total of 61 redundant transitions.
[2023-03-12 00:29:11] [INFO ] Flatten gal took : 38 ms
[2023-03-12 00:29:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-12 00:29:11] [INFO ] Time to serialize gal into /tmp/LTLFireability10895838584014909067.gal : 10 ms
[2023-03-12 00:29:11] [INFO ] Time to serialize properties into /tmp/LTLFireability8776268626002842192.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10895838584014909067.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8776268626002842192.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((("((i9.i1.u30.newmsg21>=1)&&(i9.i0.u31.reply_21_0_to_right_20>=1))")||(F("((i0.u0.newmsg1>=1)&&(i0.u43.reply_25_3_to_left_2>=1))")...279
Formula 0 simplified : (!"((i9.i1.u30.newmsg21>=1)&&(i9.i0.u31.reply_21_0_to_right_20>=1))" & G!"((i0.u0.newmsg1>=1)&&(i0.u43.reply_25_3_to_left_2>=1))") R...272
Compilation finished in 1738 ms.
Running link step : cd /tmp/ltsmin10725170884399465158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10725170884399465158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true)||<>((LTLAPp1==true))) U ((LTLAPp2==true)||X((LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 18278 ms.
FORMULA HirschbergSinclair-PT-25-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin10725170884399465158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp3==true))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t5, t8, t9, t12, t14, t16, t19, t22, t24, t34, t501, i0.u0.t30, i0.u1.t28, i1.t38...936
Computing Next relation with stutter on 3.78204e+18 deadlock states
Detected timeout of ITS tools.
[2023-03-12 00:51:51] [INFO ] Flatten gal took : 89 ms
[2023-03-12 00:51:51] [INFO ] Time to serialize gal into /tmp/LTLFireability2201265303687451805.gal : 3 ms
[2023-03-12 00:51:51] [INFO ] Time to serialize properties into /tmp/LTLFireability6121949432718713515.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2201265303687451805.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6121949432718713515.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F("((newmsg10>=1)&&(elected_25_to_left_11>=1))")))
Formula 0 simplified : G!"((newmsg10>=1)&&(elected_25_to_left_11>=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...542
Computing Next relation with stutter on 3.78204e+18 deadlock states
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin10725170884399465158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp3==true))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin10725170884399465158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp3==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-12 01:14:30] [INFO ] Flatten gal took : 50 ms
[2023-03-12 01:14:30] [INFO ] Input system was already deterministic with 502 transitions.
[2023-03-12 01:14:30] [INFO ] Transformed 532 places.
[2023-03-12 01:14:30] [INFO ] Transformed 502 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-12 01:14:31] [INFO ] Time to serialize gal into /tmp/LTLFireability7837445554538442105.gal : 3 ms
[2023-03-12 01:14:31] [INFO ] Time to serialize properties into /tmp/LTLFireability12429138695994366430.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7837445554538442105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12429138695994366430.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F("((newmsg10>=1)&&(elected_25_to_left_11>=1))")))
Formula 0 simplified : G!"((newmsg10>=1)&&(elected_25_to_left_11>=1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11053552 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16033860 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-25"
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-5348"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-25, 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 r197-smll-167840344300460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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