Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 12K Apr 29 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 29 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 29 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 9 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 284K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652744818068

Running Version 202205111006
[2022-05-16 23:46:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 23:47:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 23:47:00] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2022-05-16 23:47:00] [INFO ] Transformed 530 places.
[2022-05-16 23:47:00] [INFO ] Transformed 485 transitions.
[2022-05-16 23:47:00] [INFO ] Parsed PT model containing 530 places and 485 transitions in 333 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-20-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 530 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 485/485 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 510 transition count 485
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 37 place count 493 transition count 468
Iterating global reduction 1 with 17 rules applied. Total rules applied 54 place count 493 transition count 468
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 68 place count 479 transition count 454
Iterating global reduction 1 with 14 rules applied. Total rules applied 82 place count 479 transition count 454
Applied a total of 82 rules in 154 ms. Remains 479 /530 variables (removed 51) and now considering 454/485 (removed 31) transitions.
// Phase 1: matrix 454 rows 479 cols
[2022-05-16 23:47:00] [INFO ] Computed 25 place invariants in 40 ms
[2022-05-16 23:47:01] [INFO ] Implicit Places using invariants in 603 ms returned []
// Phase 1: matrix 454 rows 479 cols
[2022-05-16 23:47:01] [INFO ] Computed 25 place invariants in 8 ms
[2022-05-16 23:47:02] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
// Phase 1: matrix 454 rows 479 cols
[2022-05-16 23:47:02] [INFO ] Computed 25 place invariants in 9 ms
[2022-05-16 23:47:02] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 479/530 places, 454/485 transitions.
Finished structural reductions, in 1 iterations. Remains : 479/530 places, 454/485 transitions.
Support contains 50 out of 479 places after structural reductions.
[2022-05-16 23:47:03] [INFO ] Flatten gal took : 105 ms
[2022-05-16 23:47:03] [INFO ] Flatten gal took : 53 ms
[2022-05-16 23:47:03] [INFO ] Input system was already deterministic with 454 transitions.
Finished random walk after 474 steps, including 0 resets, run visited all 34 properties in 139 ms. (steps per millisecond=3 )
FORMULA HirschbergSinclair-PT-20-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 479 stabilizing places and 454 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 479 transition count 454
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((!(G(X(p0)) U G(p0))||F(G(p1)))))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Reduce places removed 19 places and 19 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 190 place count 460 transition count 245
Reduce places removed 190 places and 0 transitions.
Iterating post reduction 1 with 190 rules applied. Total rules applied 380 place count 270 transition count 245
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 385 place count 265 transition count 240
Iterating global reduction 2 with 5 rules applied. Total rules applied 390 place count 265 transition count 240
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 393 place count 265 transition count 237
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 396 place count 262 transition count 237
Applied a total of 396 rules in 66 ms. Remains 262 /479 variables (removed 217) and now considering 237/454 (removed 217) transitions.
// Phase 1: matrix 237 rows 262 cols
[2022-05-16 23:47:04] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:47:04] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 237 rows 262 cols
[2022-05-16 23:47:04] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-16 23:47:05] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2022-05-16 23:47:05] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 237 rows 262 cols
[2022-05-16 23:47:05] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:47:05] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 262/479 places, 237/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 262/479 places, 237/454 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s241 1), p0:(AND (GEQ s9 1) (GEQ s209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33326 reset in 773 ms.
Product exploration explored 100000 steps with 33125 reset in 646 ms.
Computed a total of 262 stabilizing places and 237 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 262 transition count 237
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 (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 7 factoid took 200 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-20-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-00 finished in 3272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&p1)))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Reduce places removed 17 places and 17 transitions.
Drop transitions removed 183 transitions
Trivial Post-agglo rules discarded 183 transitions
Performed 183 trivial Post agglomeration. Transition count delta: 183
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 462 transition count 254
Reduce places removed 183 places and 0 transitions.
Iterating post reduction 1 with 183 rules applied. Total rules applied 366 place count 279 transition count 254
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 372 place count 273 transition count 248
Iterating global reduction 2 with 6 rules applied. Total rules applied 378 place count 273 transition count 248
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 381 place count 273 transition count 245
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 384 place count 270 transition count 245
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 385 place count 269 transition count 244
Iterating global reduction 4 with 1 rules applied. Total rules applied 386 place count 269 transition count 244
Applied a total of 386 rules in 55 ms. Remains 269 /479 variables (removed 210) and now considering 244/454 (removed 210) transitions.
// Phase 1: matrix 244 rows 269 cols
[2022-05-16 23:47:07] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:47:07] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 244 rows 269 cols
[2022-05-16 23:47:07] [INFO ] Computed 25 place invariants in 10 ms
[2022-05-16 23:47:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 23:47:08] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2022-05-16 23:47:08] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 244 rows 269 cols
[2022-05-16 23:47:08] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-16 23:47:08] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 269/479 places, 244/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/479 places, 244/454 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s10 1) (LT s258 1)), p0:(OR (LT s12 1) (LT s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 376 reset in 378 ms.
Product exploration explored 100000 steps with 376 reset in 307 ms.
Computed a total of 269 stabilizing places and 244 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 269 transition count 244
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 424 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 244 rows 269 cols
[2022-05-16 23:47:10] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:47:10] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 46 ms returned sat
[2022-05-16 23:47:10] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p0)), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (AND p1 (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 542 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 244/244 transitions.
Applied a total of 0 rules in 23 ms. Remains 269 /269 variables (removed 0) and now considering 244/244 (removed 0) transitions.
// Phase 1: matrix 244 rows 269 cols
[2022-05-16 23:47:11] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:47:11] [INFO ] Implicit Places using invariants in 437 ms returned []
// Phase 1: matrix 244 rows 269 cols
[2022-05-16 23:47:11] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:47:12] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 23:47:12] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
[2022-05-16 23:47:12] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 244 rows 269 cols
[2022-05-16 23:47:12] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:47:13] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 244/244 transitions.
Computed a total of 269 stabilizing places and 244 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 269 transition count 244
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), true, (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 209 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-20-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-01 finished in 6059 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((F(p0)&&F(p1))))||G(p2)))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 473 transition count 448
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 473 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 470 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 71 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:13] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:47:14] [INFO ] Implicit Places using invariants in 415 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:14] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-16 23:47:16] [INFO ] Implicit Places using invariants and state equation in 2103 ms returned []
Implicit Place search using SMT with State Equation took 2528 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:16] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-16 23:47:16] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=p2, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(GEQ s409 1), p0:(LT s172 1), p2:(AND (GEQ s11 1) (GEQ s227 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17512 steps with 37 reset in 45 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-02 finished in 3448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((X(p1)&&p2))))'
Support contains 6 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 475 transition count 450
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 475 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 473 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 473 transition count 448
Applied a total of 12 rules in 44 ms. Remains 473 /479 variables (removed 6) and now considering 448/454 (removed 6) transitions.
// Phase 1: matrix 448 rows 473 cols
[2022-05-16 23:47:17] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:47:17] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 448 rows 473 cols
[2022-05-16 23:47:17] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-16 23:47:19] [INFO ] Implicit Places using invariants and state equation in 1851 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
// Phase 1: matrix 448 rows 473 cols
[2022-05-16 23:47:19] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-16 23:47:19] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/479 places, 448/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 473/479 places, 448/454 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s292 1), p0:(OR (GEQ s80 1) (AND (GEQ s39 1) (GEQ s124 1))), p1:(AND (GEQ s11 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 485 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-04 finished in 2805 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F(p1)))))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 473 transition count 448
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 473 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 470 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 42 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:19] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:47:20] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:20] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:47:21] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2115 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:21] [INFO ] Computed 25 place invariants in 7 ms
[2022-05-16 23:47:22] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s209 1)), p1:(OR (LT s35 1) (LT s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-05 finished in 2915 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Reduce places removed 18 places and 18 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 190 place count 461 transition count 246
Reduce places removed 190 places and 0 transitions.
Iterating post reduction 1 with 190 rules applied. Total rules applied 380 place count 271 transition count 246
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 386 place count 265 transition count 240
Iterating global reduction 2 with 6 rules applied. Total rules applied 392 place count 265 transition count 240
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 395 place count 265 transition count 237
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 398 place count 262 transition count 237
Applied a total of 398 rules in 33 ms. Remains 262 /479 variables (removed 217) and now considering 237/454 (removed 217) transitions.
// Phase 1: matrix 237 rows 262 cols
[2022-05-16 23:47:22] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:47:23] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 237 rows 262 cols
[2022-05-16 23:47:23] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:47:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 23:47:23] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2022-05-16 23:47:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 237 rows 262 cols
[2022-05-16 23:47:24] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:47:24] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 262/479 places, 237/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 262/479 places, 237/454 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15829 steps with 462 reset in 91 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-06 finished in 1773 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((G(p0) U p1)&&F(G(F(!p0)))))))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 473 transition count 448
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 473 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 472 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 472 transition count 447
Applied a total of 14 rules in 60 ms. Remains 472 /479 variables (removed 7) and now considering 447/454 (removed 7) transitions.
// Phase 1: matrix 447 rows 472 cols
[2022-05-16 23:47:24] [INFO ] Computed 25 place invariants in 6 ms
[2022-05-16 23:47:24] [INFO ] Implicit Places using invariants in 397 ms returned []
// Phase 1: matrix 447 rows 472 cols
[2022-05-16 23:47:24] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:47:26] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
// Phase 1: matrix 447 rows 472 cols
[2022-05-16 23:47:26] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-16 23:47:27] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 472/479 places, 447/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/479 places, 447/454 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), true, p0, (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s39 1) (GEQ s451 1)), p1:(AND (GEQ s23 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-07 finished in 2876 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 473 transition count 448
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 473 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 470 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 67 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:27] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:47:27] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:27] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:47:29] [INFO ] Implicit Places using invariants and state equation in 1752 ms returned []
Implicit Place search using SMT with State Equation took 2144 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:29] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:47:30] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LT s162 1), p0:(OR (LT s33 1) (LT s376 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 206 reset in 244 ms.
Product exploration explored 100000 steps with 206 reset in 311 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 463 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 392 steps, including 0 resets, run visited all 4 properties in 11 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 550 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 445/445 transitions.
Applied a total of 0 rules in 12 ms. Remains 470 /470 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:32] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:47:32] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:32] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-16 23:47:34] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 2159 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:34] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-16 23:47:34] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 470/470 places, 445/445 transitions.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 474 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 391 steps, including 0 resets, run visited all 4 properties in 10 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 575 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 206 reset in 224 ms.
Product exploration explored 100000 steps with 206 reset in 281 ms.
Built C files in :
/tmp/ltsmin17021588180884708473
[2022-05-16 23:47:37] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17021588180884708473
Running compilation step : cd /tmp/ltsmin17021588180884708473;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1352 ms.
Running link step : cd /tmp/ltsmin17021588180884708473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin17021588180884708473;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1438505216060115551.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 445/445 transitions.
Applied a total of 0 rules in 12 ms. Remains 470 /470 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:52] [INFO ] Computed 25 place invariants in 6 ms
[2022-05-16 23:47:52] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:52] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:47:54] [INFO ] Implicit Places using invariants and state equation in 1794 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:47:54] [INFO ] Computed 25 place invariants in 7 ms
[2022-05-16 23:47:55] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 470/470 places, 445/445 transitions.
Built C files in :
/tmp/ltsmin2925272159032602610
[2022-05-16 23:47:55] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2925272159032602610
Running compilation step : cd /tmp/ltsmin2925272159032602610;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1210 ms.
Running link step : cd /tmp/ltsmin2925272159032602610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin2925272159032602610;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10391069052269865581.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 23:48:10] [INFO ] Flatten gal took : 42 ms
[2022-05-16 23:48:10] [INFO ] Flatten gal took : 41 ms
[2022-05-16 23:48:10] [INFO ] Time to serialize gal into /tmp/LTL2522104064596255784.gal : 7 ms
[2022-05-16 23:48:10] [INFO ] Time to serialize properties into /tmp/LTL5499082995915195570.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2522104064596255784.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5499082995915195570.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2522104...266
Read 1 LTL properties
Checking formula 0 : !((G((X("((newmsg17<1)||(election_20_5_3_to_left_18<1))"))||("(rcv_left_election_20_2_2_2<1)"))))
Formula 0 simplified : !G("(rcv_left_election_20_2_2_2<1)" | X"((newmsg17<1)||(election_20_5_3_to_left_18<1))")
Detected timeout of ITS tools.
[2022-05-16 23:48:25] [INFO ] Flatten gal took : 34 ms
[2022-05-16 23:48:25] [INFO ] Applying decomposition
[2022-05-16 23:48:25] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12739441124137891121.txt' '-o' '/tmp/graph12739441124137891121.bin' '-w' '/tmp/graph12739441124137891121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12739441124137891121.bin' '-l' '-1' '-v' '-w' '/tmp/graph12739441124137891121.weights' '-q' '0' '-e' '0.001'
[2022-05-16 23:48:25] [INFO ] Decomposing Gal with order
[2022-05-16 23:48:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 23:48:25] [INFO ] Removed a total of 40 redundant transitions.
[2022-05-16 23:48:25] [INFO ] Flatten gal took : 123 ms
[2022-05-16 23:48:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-16 23:48:25] [INFO ] Time to serialize gal into /tmp/LTL5514404573165191825.gal : 12 ms
[2022-05-16 23:48:25] [INFO ] Time to serialize properties into /tmp/LTL5410266809289404818.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5514404573165191825.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5410266809289404818.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5514404...245
Read 1 LTL properties
Checking formula 0 : !((G((X("((i6.u14.newmsg17<1)||(i8.i0.u38.election_20_5_3_to_left_18<1))"))||("(i0.u1.rcv_left_election_20_2_2_2<1)"))))
Formula 0 simplified : !G("(i0.u1.rcv_left_election_20_2_2_2<1)" | X"((i6.u14.newmsg17<1)||(i8.i0.u38.election_20_5_3_to_left_18<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6548480934639211592
[2022-05-16 23:48:40] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6548480934639211592
Running compilation step : cd /tmp/ltsmin6548480934639211592;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1026 ms.
Running link step : cd /tmp/ltsmin6548480934639211592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6548480934639211592;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-20-LTLFireability-08 finished in 88689 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)||G(X(p2))))'
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 474 transition count 449
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 474 transition count 449
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 471 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 471 transition count 446
Applied a total of 16 rules in 50 ms. Remains 471 /479 variables (removed 8) and now considering 446/454 (removed 8) transitions.
// Phase 1: matrix 446 rows 471 cols
[2022-05-16 23:48:56] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:48:56] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 446 rows 471 cols
[2022-05-16 23:48:56] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:48:58] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 471 cols
[2022-05-16 23:48:58] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:48:58] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 471/479 places, 446/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 471/479 places, 446/454 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s15 1) (GEQ s66 1)), p1:(AND (GEQ s39 1) (GEQ s207 1)), p2:(GEQ s137 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3187 reset in 695 ms.
Product exploration explored 100000 steps with 3189 reset in 684 ms.
Computed a total of 471 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 471 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 411 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p0)]
Knowledge based reduction with 7 factoid took 417 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 446 rows 471 cols
[2022-05-16 23:49:01] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:49:01] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 79 ms returned sat
[2022-05-16 23:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:49:08] [INFO ] [Real]Absence check using state equation in 6400 ms returned sat
[2022-05-16 23:49:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:49:08] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 93 ms returned sat
[2022-05-16 23:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:49:10] [INFO ] [Nat]Absence check using state equation in 2149 ms returned sat
[2022-05-16 23:49:11] [INFO ] Computed and/alt/rep : 205/211/205 causal constraints (skipped 221 transitions) in 61 ms.
[2022-05-16 23:49:12] [INFO ] Added : 91 causal constraints over 19 iterations in 1865 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 471 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 : 471/471 places, 446/446 transitions.
Reduce places removed 17 places and 17 transitions.
Drop transitions removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 177 rules applied. Total rules applied 177 place count 454 transition count 252
Reduce places removed 177 places and 0 transitions.
Iterating post reduction 1 with 177 rules applied. Total rules applied 354 place count 277 transition count 252
Applied a total of 354 rules in 23 ms. Remains 277 /471 variables (removed 194) and now considering 252/446 (removed 194) transitions.
// Phase 1: matrix 252 rows 277 cols
[2022-05-16 23:49:12] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:49:13] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 252 rows 277 cols
[2022-05-16 23:49:13] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:49:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 23:49:14] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2022-05-16 23:49:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 252 rows 277 cols
[2022-05-16 23:49:14] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:49:14] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/471 places, 252/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 277/471 places, 252/446 transitions.
Computed a total of 277 stabilizing places and 252 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 277 transition count 252
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 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
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 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 252 rows 277 cols
[2022-05-16 23:49:14] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:49:15] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 47 ms returned sat
[2022-05-16 23:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:49:18] [INFO ] [Real]Absence check using state equation in 3412 ms returned sat
[2022-05-16 23:49:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:49:18] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 54 ms returned sat
[2022-05-16 23:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:49:19] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2022-05-16 23:49:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-16 23:49:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 13 ms returned sat
[2022-05-16 23:49:19] [INFO ] Computed and/alt/rep : 195/212/195 causal constraints (skipped 24 transitions) in 26 ms.
[2022-05-16 23:49:20] [INFO ] Added : 90 causal constraints over 18 iterations in 574 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3076 reset in 365 ms.
Product exploration explored 100000 steps with 3064 reset in 390 ms.
Built C files in :
/tmp/ltsmin8119655288976499194
[2022-05-16 23:49:20] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2022-05-16 23:49:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:49:20] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2022-05-16 23:49:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:49:20] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2022-05-16 23:49:20] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:49:20] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8119655288976499194
Running compilation step : cd /tmp/ltsmin8119655288976499194;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 755 ms.
Running link step : cd /tmp/ltsmin8119655288976499194;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8119655288976499194;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased372632591529537571.hoa' '--buchi-type=spotba'
LTSmin run took 10477 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-20-LTLFireability-09 finished in 36096 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F(p1)))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 473 transition count 448
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 473 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 470 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 39 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:49:32] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:49:32] [INFO ] Implicit Places using invariants in 323 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:49:32] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:49:34] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 2250 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:49:34] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:49:34] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s37 1) (GEQ s114 1)), p0:(AND (GEQ s11 1) (GEQ s317 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][false, false]]
Product exploration explored 100000 steps with 3252 reset in 394 ms.
Product exploration explored 100000 steps with 3230 reset in 430 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
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))), (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)))))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT 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))))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:49:36] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:49:37] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 94 ms returned sat
[2022-05-16 23:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:49:42] [INFO ] [Real]Absence check using state equation in 5074 ms returned sat
[2022-05-16 23:49:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:49:42] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 101 ms returned sat
[2022-05-16 23:49:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:49:48] [INFO ] [Nat]Absence check using state equation in 5973 ms returned sat
[2022-05-16 23:49:48] [INFO ] Computed and/alt/rep : 205/210/205 causal constraints (skipped 220 transitions) in 36 ms.
[2022-05-16 23:49:50] [INFO ] Added : 38 causal constraints over 8 iterations in 1347 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 445/445 transitions.
Reduce places removed 17 places and 17 transitions.
Drop transitions removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 177 rules applied. Total rules applied 177 place count 453 transition count 251
Reduce places removed 177 places and 0 transitions.
Iterating post reduction 1 with 177 rules applied. Total rules applied 354 place count 276 transition count 251
Applied a total of 354 rules in 24 ms. Remains 276 /470 variables (removed 194) and now considering 251/445 (removed 194) transitions.
// Phase 1: matrix 251 rows 276 cols
[2022-05-16 23:49:50] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:49:50] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 251 rows 276 cols
[2022-05-16 23:49:50] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:49:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 23:49:51] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2022-05-16 23:49:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 251 rows 276 cols
[2022-05-16 23:49:51] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:49:51] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 276/470 places, 251/445 transitions.
Finished structural reductions, in 1 iterations. Remains : 276/470 places, 251/445 transitions.
Computed a total of 276 stabilizing places and 251 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 276 transition count 251
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))), (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)))))]
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT 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))))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p0))]
// Phase 1: matrix 251 rows 276 cols
[2022-05-16 23:49:52] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:49:52] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 62 ms returned sat
[2022-05-16 23:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:49:53] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2022-05-16 23:49:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:49:53] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 67 ms returned sat
[2022-05-16 23:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:49:54] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2022-05-16 23:49:54] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 23:49:54] [INFO ] [Nat]Added 12 Read/Feed constraints in 19 ms returned sat
[2022-05-16 23:49:54] [INFO ] Computed and/alt/rep : 194/213/194 causal constraints (skipped 24 transitions) in 20 ms.
[2022-05-16 23:49:55] [INFO ] Added : 88 causal constraints over 18 iterations in 654 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3088 reset in 396 ms.
Product exploration explored 100000 steps with 3011 reset in 408 ms.
Built C files in :
/tmp/ltsmin40066399644320331
[2022-05-16 23:49:55] [INFO ] Computing symmetric may disable matrix : 251 transitions.
[2022-05-16 23:49:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:49:55] [INFO ] Computing symmetric may enable matrix : 251 transitions.
[2022-05-16 23:49:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:49:55] [INFO ] Computing Do-Not-Accords matrix : 251 transitions.
[2022-05-16 23:49:55] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:49:55] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin40066399644320331
Running compilation step : cd /tmp/ltsmin40066399644320331;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 744 ms.
Running link step : cd /tmp/ltsmin40066399644320331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin40066399644320331;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17008535987159089229.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 251/251 transitions.
Applied a total of 0 rules in 16 ms. Remains 276 /276 variables (removed 0) and now considering 251/251 (removed 0) transitions.
// Phase 1: matrix 251 rows 276 cols
[2022-05-16 23:50:11] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:50:11] [INFO ] Implicit Places using invariants in 388 ms returned []
// Phase 1: matrix 251 rows 276 cols
[2022-05-16 23:50:11] [INFO ] Computed 25 place invariants in 5 ms
[2022-05-16 23:50:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-16 23:50:12] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
[2022-05-16 23:50:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 251 rows 276 cols
[2022-05-16 23:50:12] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:50:12] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 251/251 transitions.
Built C files in :
/tmp/ltsmin5898346101741084209
[2022-05-16 23:50:12] [INFO ] Computing symmetric may disable matrix : 251 transitions.
[2022-05-16 23:50:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:50:12] [INFO ] Computing symmetric may enable matrix : 251 transitions.
[2022-05-16 23:50:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:50:12] [INFO ] Computing Do-Not-Accords matrix : 251 transitions.
[2022-05-16 23:50:12] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:50:12] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5898346101741084209
Running compilation step : cd /tmp/ltsmin5898346101741084209;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 699 ms.
Running link step : cd /tmp/ltsmin5898346101741084209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5898346101741084209;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7398444469772789771.hoa' '--buchi-type=spotba'
LTSmin run took 13966 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-20-LTLFireability-10 finished in 55538 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U X(!p0))))'
Support contains 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 473 transition count 448
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 473 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 470 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 42 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:50:27] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:50:27] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:50:28] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-16 23:50:29] [INFO ] Implicit Places using invariants and state equation in 1682 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:50:29] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:50:30] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s293 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][false, false]]
Product exploration explored 100000 steps with 278 reset in 236 ms.
Product exploration explored 100000 steps with 279 reset in 262 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[p0]
Finished random walk after 371 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=185 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:50:31] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:50:31] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 74 ms returned sat
[2022-05-16 23:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:50:32] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2022-05-16 23:50:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:50:32] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 83 ms returned sat
[2022-05-16 23:50:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:50:32] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2022-05-16 23:50:32] [INFO ] Computed and/alt/rep : 205/210/205 causal constraints (skipped 220 transitions) in 37 ms.
[2022-05-16 23:50:34] [INFO ] Added : 158 causal constraints over 32 iterations in 1291 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 445/445 transitions.
Reduce places removed 20 places and 20 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 450 transition count 226
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 251 transition count 226
Applied a total of 398 rules in 19 ms. Remains 251 /470 variables (removed 219) and now considering 226/445 (removed 219) transitions.
// Phase 1: matrix 226 rows 251 cols
[2022-05-16 23:50:34] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-16 23:50:34] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 226 rows 251 cols
[2022-05-16 23:50:34] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:50:34] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2022-05-16 23:50:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 226 rows 251 cols
[2022-05-16 23:50:34] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:50:35] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/470 places, 226/445 transitions.
Finished structural reductions, in 1 iterations. Remains : 251/470 places, 226/445 transitions.
Computed a total of 251 stabilizing places and 226 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 251 transition count 226
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 278 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[p0]
Finished random walk after 173 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=86 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
// Phase 1: matrix 226 rows 251 cols
[2022-05-16 23:50:35] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:50:36] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 37 ms returned sat
[2022-05-16 23:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:50:36] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2022-05-16 23:50:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:50:36] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 51 ms returned sat
[2022-05-16 23:50:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:50:36] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2022-05-16 23:50:36] [INFO ] Computed and/alt/rep : 187/193/187 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-16 23:50:37] [INFO ] Added : 119 causal constraints over 24 iterations in 510 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 43 ms :[p0]
Product exploration explored 100000 steps with 581 reset in 183 ms.
Product exploration explored 100000 steps with 582 reset in 206 ms.
Built C files in :
/tmp/ltsmin5285579642131151816
[2022-05-16 23:50:37] [INFO ] Computing symmetric may disable matrix : 226 transitions.
[2022-05-16 23:50:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:50:37] [INFO ] Computing symmetric may enable matrix : 226 transitions.
[2022-05-16 23:50:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:50:37] [INFO ] Computing Do-Not-Accords matrix : 226 transitions.
[2022-05-16 23:50:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:50:37] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5285579642131151816
Running compilation step : cd /tmp/ltsmin5285579642131151816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 735 ms.
Running link step : cd /tmp/ltsmin5285579642131151816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5285579642131151816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6892778648408940.hoa' '--buchi-type=spotba'
LTSmin run took 1507 ms.
FORMULA HirschbergSinclair-PT-20-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-20-LTLFireability-11 finished in 12396 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(p1)||G(p2))))'
Support contains 5 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Reduce places removed 18 places and 18 transitions.
Drop transitions removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 177 rules applied. Total rules applied 177 place count 461 transition count 259
Reduce places removed 177 places and 0 transitions.
Iterating post reduction 1 with 177 rules applied. Total rules applied 354 place count 284 transition count 259
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 360 place count 278 transition count 253
Iterating global reduction 2 with 6 rules applied. Total rules applied 366 place count 278 transition count 253
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 369 place count 278 transition count 250
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 372 place count 275 transition count 250
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 373 place count 274 transition count 249
Iterating global reduction 4 with 1 rules applied. Total rules applied 374 place count 274 transition count 249
Applied a total of 374 rules in 42 ms. Remains 274 /479 variables (removed 205) and now considering 249/454 (removed 205) transitions.
// Phase 1: matrix 249 rows 274 cols
[2022-05-16 23:50:40] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:50:40] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 249 rows 274 cols
[2022-05-16 23:50:40] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:50:41] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
[2022-05-16 23:50:41] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 249 rows 274 cols
[2022-05-16 23:50:41] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:50:41] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 274/479 places, 249/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 274/479 places, 249/454 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s20 1) (GEQ s73 1)), p2:(AND (GEQ s11 1) (GEQ s262 1)), p0:(GEQ s99 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1066 reset in 328 ms.
Product exploration explored 100000 steps with 1066 reset in 278 ms.
Computed a total of 274 stabilizing places and 249 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 274 transition count 249
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 p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1107 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 35 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 249 rows 274 cols
[2022-05-16 23:50:44] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:50:44] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 51 ms returned sat
[2022-05-16 23:50:44] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (G (NOT (AND p1 p2))), (G (NOT (AND p1 (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2)), (F p0)]
Knowledge based reduction with 24 factoid took 1162 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p1 p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p1 p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2)]
// Phase 1: matrix 249 rows 274 cols
[2022-05-16 23:50:45] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:50:46] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 43 ms returned sat
[2022-05-16 23:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:50:52] [INFO ] [Real]Absence check using state equation in 5962 ms returned sat
[2022-05-16 23:50:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:50:52] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 55 ms returned sat
[2022-05-16 23:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:50:55] [INFO ] [Nat]Absence check using state equation in 3131 ms returned sat
[2022-05-16 23:50:55] [INFO ] Computed and/alt/rep : 195/218/195 causal constraints (skipped 20 transitions) in 18 ms.
[2022-05-16 23:51:01] [INFO ] Added : 173 causal constraints over 35 iterations in 5586 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 249/249 transitions.
Applied a total of 0 rules in 12 ms. Remains 274 /274 variables (removed 0) and now considering 249/249 (removed 0) transitions.
// Phase 1: matrix 249 rows 274 cols
[2022-05-16 23:51:01] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:51:01] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 249 rows 274 cols
[2022-05-16 23:51:01] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:51:02] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
[2022-05-16 23:51:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 249 rows 274 cols
[2022-05-16 23:51:02] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:51:02] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 274/274 places, 249/249 transitions.
Computed a total of 274 stabilizing places and 249 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 274 transition count 249
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 p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (OR (AND (NOT p1) (NOT p2)) (AND p1 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 753 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p1 p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2)]
Finished random walk after 258 steps, including 0 resets, run visited all 7 properties in 10 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (OR (AND (NOT p1) (NOT p2)) (AND p1 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F p0), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p2)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND p1 p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 18 factoid took 1053 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p1 p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p1 p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2)]
// Phase 1: matrix 249 rows 274 cols
[2022-05-16 23:51:04] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:51:05] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 67 ms returned sat
[2022-05-16 23:51:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 23:51:11] [INFO ] [Real]Absence check using state equation in 6253 ms returned sat
[2022-05-16 23:51:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 23:51:11] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 57 ms returned sat
[2022-05-16 23:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 23:51:14] [INFO ] [Nat]Absence check using state equation in 3164 ms returned sat
[2022-05-16 23:51:14] [INFO ] Computed and/alt/rep : 195/218/195 causal constraints (skipped 20 transitions) in 19 ms.
[2022-05-16 23:51:20] [INFO ] Added : 173 causal constraints over 35 iterations in 5572 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p1 p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 1068 reset in 252 ms.
Product exploration explored 100000 steps with 1066 reset in 285 ms.
Built C files in :
/tmp/ltsmin15529301977657748760
[2022-05-16 23:51:21] [INFO ] Computing symmetric may disable matrix : 249 transitions.
[2022-05-16 23:51:21] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:51:21] [INFO ] Computing symmetric may enable matrix : 249 transitions.
[2022-05-16 23:51:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:51:21] [INFO ] Computing Do-Not-Accords matrix : 249 transitions.
[2022-05-16 23:51:21] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:51:21] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15529301977657748760
Running compilation step : cd /tmp/ltsmin15529301977657748760;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 738 ms.
Running link step : cd /tmp/ltsmin15529301977657748760;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15529301977657748760;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15393270904725764123.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 249/249 transitions.
Applied a total of 0 rules in 12 ms. Remains 274 /274 variables (removed 0) and now considering 249/249 (removed 0) transitions.
// Phase 1: matrix 249 rows 274 cols
[2022-05-16 23:51:36] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:51:36] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 249 rows 274 cols
[2022-05-16 23:51:36] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-16 23:51:37] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
[2022-05-16 23:51:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 249 rows 274 cols
[2022-05-16 23:51:37] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:51:37] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 274/274 places, 249/249 transitions.
Built C files in :
/tmp/ltsmin1770645061023326672
[2022-05-16 23:51:37] [INFO ] Computing symmetric may disable matrix : 249 transitions.
[2022-05-16 23:51:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:51:37] [INFO ] Computing symmetric may enable matrix : 249 transitions.
[2022-05-16 23:51:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:51:37] [INFO ] Computing Do-Not-Accords matrix : 249 transitions.
[2022-05-16 23:51:37] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:51:37] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1770645061023326672
Running compilation step : cd /tmp/ltsmin1770645061023326672;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 712 ms.
Running link step : cd /tmp/ltsmin1770645061023326672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1770645061023326672;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16960912838239330416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 23:51:52] [INFO ] Flatten gal took : 16 ms
[2022-05-16 23:51:52] [INFO ] Flatten gal took : 15 ms
[2022-05-16 23:51:52] [INFO ] Time to serialize gal into /tmp/LTL11386666173448085737.gal : 3 ms
[2022-05-16 23:51:52] [INFO ] Time to serialize properties into /tmp/LTL11707128172895113748.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11386666173448085737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11707128172895113748.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1138666...268
Read 1 LTL properties
Checking formula 0 : !(((F("(rcv_right_reply_20_2_2>=1)"))U((G("((newmsg19>=1)&&(reply_20_1_to_right_18>=1))"))||(G("((newmsg11>=1)&&(elected_20_to_left_12...166
Formula 0 simplified : !(F"(rcv_right_reply_20_2_2>=1)" U (G"((newmsg19>=1)&&(reply_20_1_to_right_18>=1))" | G"((newmsg11>=1)&&(elected_20_to_left_12>=1))"...157
Reverse transition relation is NOT exact ! Due to transitions t10, t18, t20.t21, t22.t23, t26.t27, t30.t31, t34.t35, t38.t39, t43.t44, t47.t48, t52.t53, t5...376
Computing Next relation with stutter on 4.57764e+14 deadlock states
61 unique states visited
61 strongly connected components in search stack
61 transitions explored
61 items max in DFS search stack
925 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.29663,241748,1,0,692,981568,547,510,8271,769368,1799
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HirschbergSinclair-PT-20-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HirschbergSinclair-PT-20-LTLFireability-13 finished in 83148 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 473 transition count 448
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 473 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 470 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 37 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:52:03] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:52:03] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:52:03] [INFO ] Computed 25 place invariants in 6 ms
[2022-05-16 23:52:05] [INFO ] Implicit Places using invariants and state equation in 1655 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:52:05] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:52:05] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-14 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 s129 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-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-20-LTLFireability-14 finished in 2585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(X(!(p1 U (p2 U X(p3)))))||p0))))'
Support contains 8 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 473 transition count 448
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 473 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 470 transition count 445
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 470 transition count 445
Applied a total of 18 rules in 42 ms. Remains 470 /479 variables (removed 9) and now considering 445/454 (removed 9) transitions.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:52:05] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:52:06] [INFO ] Implicit Places using invariants in 343 ms returned []
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:52:06] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:52:07] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned []
Implicit Place search using SMT with State Equation took 1790 ms to find 0 implicit places.
// Phase 1: matrix 445 rows 470 cols
[2022-05-16 23:52:07] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:52:08] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 445/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 470/479 places, 445/454 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3), p3, p3, false]
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p1 p2) (AND p2 (NOT p3))), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s29 1) (LT s454 1)), p1:(AND (GEQ s15 1) (GEQ s321 1)), p2:(AND (GEQ s39 1) (GEQ s369 1)), p3:(AND (GEQ s7 1) (GEQ s361 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 211 reset in 233 ms.
Product exploration explored 100000 steps with 211 reset in 245 ms.
Computed a total of 470 stabilizing places and 445 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 470 transition count 445
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p0), true, (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p3)))
Knowledge based reduction with 10 factoid took 290 ms. Reduced automaton from 5 states, 11 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-20-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-20-LTLFireability-15 finished in 3428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Found a SL insensitive property : HirschbergSinclair-PT-20-LTLFireability-08
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 479/479 places, 454/454 transitions.
Reduce places removed 19 places and 19 transitions.
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 460 transition count 247
Reduce places removed 188 places and 0 transitions.
Iterating post reduction 1 with 188 rules applied. Total rules applied 376 place count 272 transition count 247
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 382 place count 266 transition count 241
Iterating global reduction 2 with 6 rules applied. Total rules applied 388 place count 266 transition count 241
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 391 place count 266 transition count 238
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 394 place count 263 transition count 238
Applied a total of 394 rules in 24 ms. Remains 263 /479 variables (removed 216) and now considering 238/454 (removed 216) transitions.
// Phase 1: matrix 238 rows 263 cols
[2022-05-16 23:52:09] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:52:09] [INFO ] Implicit Places using invariants in 316 ms returned []
// Phase 1: matrix 238 rows 263 cols
[2022-05-16 23:52:09] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:52:10] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
// Phase 1: matrix 238 rows 263 cols
[2022-05-16 23:52:10] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:52:10] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 263/479 places, 238/454 transitions.
Finished structural reductions, in 1 iterations. Remains : 263/479 places, 238/454 transitions.
Running random walk in product with property : HirschbergSinclair-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LT s89 1), p0:(OR (LT s17 1) (LT s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 386 reset in 290 ms.
Product exploration explored 100000 steps with 386 reset in 194 ms.
Computed a total of 263 stabilizing places and 238 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 263 transition count 238
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 494 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 211 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 700 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 238/238 transitions.
Applied a total of 0 rules in 7 ms. Remains 263 /263 variables (removed 0) and now considering 238/238 (removed 0) transitions.
// Phase 1: matrix 238 rows 263 cols
[2022-05-16 23:52:12] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:52:13] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 238 rows 263 cols
[2022-05-16 23:52:13] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:52:14] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
// Phase 1: matrix 238 rows 263 cols
[2022-05-16 23:52:14] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-16 23:52:14] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 263/263 places, 238/238 transitions.
Computed a total of 263 stabilizing places and 238 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 263 transition count 238
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 466 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 209 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p0)), true, (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT p0))]
Knowledge based reduction with 12 factoid took 532 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 386 reset in 303 ms.
Product exploration explored 100000 steps with 386 reset in 324 ms.
Built C files in :
/tmp/ltsmin15221283665826979611
[2022-05-16 23:52:16] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15221283665826979611
Running compilation step : cd /tmp/ltsmin15221283665826979611;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 717 ms.
Running link step : cd /tmp/ltsmin15221283665826979611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15221283665826979611;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8734842545065871127.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 238/238 transitions.
Applied a total of 0 rules in 5 ms. Remains 263 /263 variables (removed 0) and now considering 238/238 (removed 0) transitions.
// Phase 1: matrix 238 rows 263 cols
[2022-05-16 23:52:31] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-16 23:52:32] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 238 rows 263 cols
[2022-05-16 23:52:32] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:52:33] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
// Phase 1: matrix 238 rows 263 cols
[2022-05-16 23:52:33] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-16 23:52:33] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 263/263 places, 238/238 transitions.
Built C files in :
/tmp/ltsmin13517630909030638107
[2022-05-16 23:52:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13517630909030638107
Running compilation step : cd /tmp/ltsmin13517630909030638107;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 575 ms.
Running link step : cd /tmp/ltsmin13517630909030638107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13517630909030638107;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5052661779149011515.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 23:52:48] [INFO ] Flatten gal took : 14 ms
[2022-05-16 23:52:48] [INFO ] Flatten gal took : 14 ms
[2022-05-16 23:52:48] [INFO ] Time to serialize gal into /tmp/LTL11987393429805020313.gal : 3 ms
[2022-05-16 23:52:48] [INFO ] Time to serialize properties into /tmp/LTL14046254983491249397.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11987393429805020313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14046254983491249397.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1198739...268
Read 1 LTL properties
Checking formula 0 : !((G((X("((newmsg17<1)||(election_20_5_3_to_left_18<1))"))||("(rcv_left_election_20_2_2_2<1)"))))
Formula 0 simplified : !G("(rcv_left_election_20_2_2_2<1)" | X"((newmsg17<1)||(election_20_5_3_to_left_18<1))")
Reverse transition relation is NOT exact ! Due to transitions t16, t22.t23, t26.t27, t30.t31, t34.t35, t38.t39, t43.t44, t47.t48, t52.t53, t56.t57, t60.t61...361
Computing Next relation with stutter on 4.57764e+14 deadlock states
Detected timeout of ITS tools.
[2022-05-16 23:53:03] [INFO ] Flatten gal took : 14 ms
[2022-05-16 23:53:03] [INFO ] Applying decomposition
[2022-05-16 23:53:03] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11041674737077855648.txt' '-o' '/tmp/graph11041674737077855648.bin' '-w' '/tmp/graph11041674737077855648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11041674737077855648.bin' '-l' '-1' '-v' '-w' '/tmp/graph11041674737077855648.weights' '-q' '0' '-e' '0.001'
[2022-05-16 23:53:03] [INFO ] Decomposing Gal with order
[2022-05-16 23:53:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 23:53:03] [INFO ] Removed a total of 151 redundant transitions.
[2022-05-16 23:53:03] [INFO ] Flatten gal took : 34 ms
[2022-05-16 23:53:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 14 ms.
[2022-05-16 23:53:03] [INFO ] Time to serialize gal into /tmp/LTL3272491739885437719.gal : 5 ms
[2022-05-16 23:53:03] [INFO ] Time to serialize properties into /tmp/LTL2003178110612517185.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3272491739885437719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2003178110612517185.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3272491...245
Read 1 LTL properties
Checking formula 0 : !((G((X("((i3.u0.newmsg17<1)||(i1.u78.election_20_5_3_to_left_18<1))"))||("(i2.i0.i1.u30.rcv_left_election_20_2_2_2<1)"))))
Formula 0 simplified : !G("(i2.i0.i1.u30.rcv_left_election_20_2_2_2<1)" | X"((i3.u0.newmsg17<1)||(i1.u78.election_20_5_3_to_left_18<1))")
Reverse transition relation is NOT exact ! Due to transitions t56_t57, t81_t82, t93_t94, t390_t391, t404_t405, i1.t430_t431, i1.t97_t98, i2.t120_t121, i2.i...438
Computing Next relation with stutter on 4.57764e+14 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8650721608161893028
[2022-05-16 23:53:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8650721608161893028
Running compilation step : cd /tmp/ltsmin8650721608161893028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 560 ms.
Running link step : cd /tmp/ltsmin8650721608161893028;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8650721608161893028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-20-LTLFireability-08 finished in 84595 ms.
[2022-05-16 23:53:33] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13158486887694906017
[2022-05-16 23:53:33] [INFO ] Computing symmetric may disable matrix : 454 transitions.
[2022-05-16 23:53:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:53:33] [INFO ] Computing symmetric may enable matrix : 454 transitions.
[2022-05-16 23:53:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:53:33] [INFO ] Applying decomposition
[2022-05-16 23:53:33] [INFO ] Flatten gal took : 25 ms
[2022-05-16 23:53:33] [INFO ] Computing Do-Not-Accords matrix : 454 transitions.
[2022-05-16 23:53:33] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 23:53:33] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13158486887694906017
Running compilation step : cd /tmp/ltsmin13158486887694906017;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1108845892906300442.txt' '-o' '/tmp/graph1108845892906300442.bin' '-w' '/tmp/graph1108845892906300442.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1108845892906300442.bin' '-l' '-1' '-v' '-w' '/tmp/graph1108845892906300442.weights' '-q' '0' '-e' '0.001'
[2022-05-16 23:53:33] [INFO ] Decomposing Gal with order
[2022-05-16 23:53:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 23:53:34] [INFO ] Removed a total of 56 redundant transitions.
[2022-05-16 23:53:34] [INFO ] Flatten gal took : 65 ms
[2022-05-16 23:53:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-16 23:53:34] [INFO ] Time to serialize gal into /tmp/LTLFireability6068501824811362044.gal : 6 ms
[2022-05-16 23:53:34] [INFO ] Time to serialize properties into /tmp/LTLFireability11417312151796141634.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6068501824811362044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11417312151796141634.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((G((X("((i5.i1.u15.newmsg17<1)||(i5.i1.u15.election_20_5_3_to_left_18<1))"))||("(i1.u1.rcv_left_election_20_2_2_2<1)"))))
Formula 0 simplified : !G("(i1.u1.rcv_left_election_20_2_2_2<1)" | X"((i5.i1.u15.newmsg17<1)||(i5.i1.u15.election_20_5_3_to_left_18<1))")
Compilation finished in 1519 ms.
Running link step : cd /tmp/ltsmin13158486887694906017;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin13158486887694906017;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t7, t8, t10, t11, t14, t17, t18, t19, t55, t453, i0.t0, i0.u0.t25, i0.u18.t21, i0...794
Computing Next relation with stutter on 1.16754e+15 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: LTL layer: formula: []((X((LTLAPp0==true))||(LTLAPp1==true)))
pins2lts-mc-linux64( 4/ 8), 0.009: "[]((X((LTLAPp0==true))||(LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.016: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.057: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.135: DFS-FIFO for weak LTL, using special progress label 457
pins2lts-mc-linux64( 0/ 8), 0.135: There are 458 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.135: State length is 480, there are 460 groups
pins2lts-mc-linux64( 0/ 8), 0.136: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.136: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.136: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.136: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.435: ~1 levels ~960 states ~17264 transitions
pins2lts-mc-linux64( 6/ 8), 0.556: ~1 levels ~1920 states ~34208 transitions
pins2lts-mc-linux64( 6/ 8), 0.843: ~1 levels ~3840 states ~68432 transitions
pins2lts-mc-linux64( 6/ 8), 1.250: ~1 levels ~7680 states ~135576 transitions
pins2lts-mc-linux64( 6/ 8), 1.996: ~1 levels ~15360 states ~272464 transitions
pins2lts-mc-linux64( 7/ 8), 3.096: ~1 levels ~30720 states ~539352 transitions
pins2lts-mc-linux64( 6/ 8), 5.276: ~1 levels ~61440 states ~1085040 transitions
pins2lts-mc-linux64( 3/ 8), 8.816: ~1 levels ~122880 states ~2167504 transitions
pins2lts-mc-linux64( 3/ 8), 14.988: ~1 levels ~245760 states ~4355552 transitions
pins2lts-mc-linux64( 2/ 8), 32.444: ~1 levels ~491520 states ~8772344 transitions
pins2lts-mc-linux64( 0/ 8), 62.589: ~1 levels ~983040 states ~17701144 transitions
pins2lts-mc-linux64( 3/ 8), 115.802: ~1 levels ~1966080 states ~35300760 transitions
pins2lts-mc-linux64( 2/ 8), 229.637: ~1 levels ~3932160 states ~72130968 transitions
pins2lts-mc-linux64( 3/ 8), 266.147: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 266.878:
pins2lts-mc-linux64( 0/ 8), 266.878: mean standard work distribution: 2.0% (states) 2.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 266.878:
pins2lts-mc-linux64( 0/ 8), 266.878: Explored 4247092 states 77038459 transitions, fanout: 18.139
pins2lts-mc-linux64( 0/ 8), 266.878: Total exploration time 266.670 sec (266.000 sec minimum, 266.211 sec on average)
pins2lts-mc-linux64( 0/ 8), 266.878: States per second: 15926, Transitions per second: 288891
pins2lts-mc-linux64( 0/ 8), 266.878:
pins2lts-mc-linux64( 0/ 8), 266.878: Progress states detected: 13352171
pins2lts-mc-linux64( 0/ 8), 266.878: Redundant explorations: -68.1924
pins2lts-mc-linux64( 0/ 8), 266.878:
pins2lts-mc-linux64( 0/ 8), 266.878: Queue width: 8B, total height: 16336319, memory: 124.64MB
pins2lts-mc-linux64( 0/ 8), 266.878: Tree memory: 357.9MB, 28.1 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 266.878: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 266.878: Stored 456 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 266.878: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 266.878: Est. total memory use: 482.5MB (~1148.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13158486887694906017;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13158486887694906017;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp0==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-17 00:15:45] [INFO ] Flatten gal took : 19 ms
[2022-05-17 00:15:45] [INFO ] Time to serialize gal into /tmp/LTLFireability8708774516854827126.gal : 4 ms
[2022-05-17 00:15:45] [INFO ] Time to serialize properties into /tmp/LTLFireability14529482524412229320.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8708774516854827126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14529482524412229320.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((G((X("((newmsg17<1)||(election_20_5_3_to_left_18<1))"))||("(rcv_left_election_20_2_2_2<1)"))))
Formula 0 simplified : !G("(rcv_left_election_20_2_2_2<1)" | X"((newmsg17<1)||(election_20_5_3_to_left_18<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, t21...456
Computing Next relation with stutter on 1.16754e+15 deadlock states
Detected timeout of ITS tools.
[2022-05-17 00:37:56] [INFO ] Flatten gal took : 19 ms
[2022-05-17 00:37:56] [INFO ] Input system was already deterministic with 454 transitions.
[2022-05-17 00:37:56] [INFO ] Transformed 479 places.
[2022-05-17 00:37:56] [INFO ] Transformed 454 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 00:37:56] [INFO ] Time to serialize gal into /tmp/LTLFireability14244608697523261103.gal : 5 ms
[2022-05-17 00:37:56] [INFO ] Time to serialize properties into /tmp/LTLFireability1834761374922153117.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14244608697523261103.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1834761374922153117.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((X("((newmsg17<1)||(election_20_5_3_to_left_18<1))"))||("(rcv_left_election_20_2_2_2<1)"))))
Formula 0 simplified : !G("(rcv_left_election_20_2_2_2<1)" | X"((newmsg17<1)||(election_20_5_3_to_left_18<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, t21...456
Computing Next relation with stutter on 1.16754e+15 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-165264477500292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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