Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r219-smll-171649597800067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is HirschbergSinclair-PT-35, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649597800067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 03:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 03:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 03:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 544K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716646742576

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-35
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 14:19:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 14:19:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:19:05] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2024-05-25 14:19:05] [INFO ] Transformed 998 places.
[2024-05-25 14:19:05] [INFO ] Transformed 922 transitions.
[2024-05-25 14:19:05] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 922/922 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 963 transition count 922
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 64 place count 934 transition count 893
Iterating global reduction 1 with 29 rules applied. Total rules applied 93 place count 934 transition count 893
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 121 place count 906 transition count 865
Iterating global reduction 1 with 28 rules applied. Total rules applied 149 place count 906 transition count 865
Applied a total of 149 rules in 649 ms. Remains 906 /998 variables (removed 92) and now considering 865/922 (removed 57) transitions.
// Phase 1: matrix 865 rows 906 cols
[2024-05-25 14:19:06] [INFO ] Computed 41 invariants in 46 ms
[2024-05-25 14:19:07] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-25 14:19:07] [INFO ] Invariant cache hit.
[2024-05-25 14:19:10] [INFO ] Implicit Places using invariants and state equation in 3275 ms returned []
Implicit Place search using SMT with State Equation took 4270 ms to find 0 implicit places.
[2024-05-25 14:19:10] [INFO ] Invariant cache hit.
[2024-05-25 14:19:11] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 906/998 places, 865/922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5983 ms. Remains : 906/998 places, 865/922 transitions.
Support contains 48 out of 906 places after structural reductions.
[2024-05-25 14:19:12] [INFO ] Flatten gal took : 166 ms
[2024-05-25 14:19:12] [INFO ] Flatten gal took : 83 ms
[2024-05-25 14:19:12] [INFO ] Input system was already deterministic with 865 transitions.
Support contains 46 out of 906 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 804 ms. (steps per millisecond=12 ) properties (out of 28) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-25 14:19:13] [INFO ] Invariant cache hit.
[2024-05-25 14:19:14] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 184 ms returned sat
[2024-05-25 14:19:14] [INFO ] After 712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 14:19:14] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 183 ms returned sat
[2024-05-25 14:19:15] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :1
[2024-05-25 14:19:16] [INFO ] After 1125ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2024-05-25 14:19:16] [INFO ] After 1953ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :1
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 906 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 906/906 places, 865/865 transitions.
Graph (complete) has 1734 edges and 906 vertex of which 874 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.5 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 379 transitions
Trivial Post-agglo rules discarded 379 transitions
Performed 379 trivial Post agglomeration. Transition count delta: 379
Iterating post reduction 0 with 411 rules applied. Total rules applied 412 place count 874 transition count 454
Reduce places removed 379 places and 0 transitions.
Graph (complete) has 874 edges and 495 vertex of which 427 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.2 ms
Discarding 68 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 380 rules applied. Total rules applied 792 place count 427 transition count 454
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 860 place count 427 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 862 place count 425 transition count 384
Iterating global reduction 3 with 2 rules applied. Total rules applied 864 place count 425 transition count 384
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 865 place count 425 transition count 383
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 744 edges and 424 vertex of which 422 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 867 place count 422 transition count 383
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 869 place count 422 transition count 381
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 870 place count 421 transition count 380
Iterating global reduction 6 with 1 rules applied. Total rules applied 871 place count 421 transition count 380
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 873 place count 421 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 875 place count 419 transition count 378
Reduce places removed 34 places and 34 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 909 place count 385 transition count 344
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 7 with 281 rules applied. Total rules applied 1190 place count 354 transition count 94
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 8 with 250 rules applied. Total rules applied 1440 place count 104 transition count 94
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 27 Pre rules applied. Total rules applied 1440 place count 104 transition count 67
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 9 with 54 rules applied. Total rules applied 1494 place count 77 transition count 67
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 1495 place count 76 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1495 place count 76 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1497 place count 75 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1503 place count 72 transition count 63
Applied a total of 1503 rules in 195 ms. Remains 72 /906 variables (removed 834) and now considering 63/865 (removed 802) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 72/906 places, 63/865 transitions.
Finished random walk after 128 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=128 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 906 stabilizing places and 865 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 906 transition count 865
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-35-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 871 transition count 440
Reduce places removed 390 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 391 rules applied. Total rules applied 781 place count 481 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 782 place count 480 transition count 439
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 789 place count 473 transition count 432
Iterating global reduction 3 with 7 rules applied. Total rules applied 796 place count 473 transition count 432
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 797 place count 473 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 798 place count 472 transition count 431
Applied a total of 798 rules in 97 ms. Remains 472 /906 variables (removed 434) and now considering 431/865 (removed 434) transitions.
// Phase 1: matrix 431 rows 472 cols
[2024-05-25 14:19:16] [INFO ] Computed 41 invariants in 8 ms
[2024-05-25 14:19:17] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-25 14:19:17] [INFO ] Invariant cache hit.
[2024-05-25 14:19:19] [INFO ] Implicit Places using invariants and state equation in 2150 ms returned []
Implicit Place search using SMT with State Equation took 2753 ms to find 0 implicit places.
[2024-05-25 14:19:19] [INFO ] Redundant transitions in 34 ms returned []
[2024-05-25 14:19:19] [INFO ] Invariant cache hit.
[2024-05-25 14:19:20] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 472/906 places, 431/865 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3406 ms. Remains : 472/906 places, 431/865 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 197 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s238 s418)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 425 reset in 636 ms.
Product exploration explored 100000 steps with 425 reset in 518 ms.
Computed a total of 472 stabilizing places and 431 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 472 transition count 431
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 237 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 248 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-25 14:19:22] [INFO ] Invariant cache hit.
[2024-05-25 14:19:22] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 151 ms returned sat
[2024-05-25 14:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:37] [INFO ] [Real]Absence check using state equation in 14399 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 431/431 transitions.
Applied a total of 0 rules in 45 ms. Remains 472 /472 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-05-25 14:19:37] [INFO ] Invariant cache hit.
[2024-05-25 14:19:38] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-25 14:19:38] [INFO ] Invariant cache hit.
[2024-05-25 14:19:40] [INFO ] Implicit Places using invariants and state equation in 2413 ms returned []
Implicit Place search using SMT with State Equation took 3059 ms to find 0 implicit places.
[2024-05-25 14:19:40] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-25 14:19:40] [INFO ] Invariant cache hit.
[2024-05-25 14:19:41] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3757 ms. Remains : 472/472 places, 431/431 transitions.
Computed a total of 472 stabilizing places and 431 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 472 transition count 431
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 253 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=84 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-25 14:19:41] [INFO ] Invariant cache hit.
[2024-05-25 14:19:42] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 154 ms returned sat
[2024-05-25 14:19:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:56] [INFO ] [Real]Absence check using state equation in 14410 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 425 reset in 381 ms.
Product exploration explored 100000 steps with 425 reset in 419 ms.
Built C files in :
/tmp/ltsmin5320439097317086728
[2024-05-25 14:19:57] [INFO ] Computing symmetric may disable matrix : 431 transitions.
[2024-05-25 14:19:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:19:57] [INFO ] Computing symmetric may enable matrix : 431 transitions.
[2024-05-25 14:19:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:19:57] [INFO ] Computing Do-Not-Accords matrix : 431 transitions.
[2024-05-25 14:19:57] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:19:57] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5320439097317086728
Running compilation step : cd /tmp/ltsmin5320439097317086728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1615 ms.
Running link step : cd /tmp/ltsmin5320439097317086728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin5320439097317086728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1811531878266342809.hoa' '--buchi-type=spotba'
LTSmin run took 5205 ms.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-01 finished in 47783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(G(p1))||p0) U p2)))'
Support contains 6 out of 906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 901 transition count 860
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 901 transition count 860
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 897 transition count 856
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 897 transition count 856
Applied a total of 18 rules in 187 ms. Remains 897 /906 variables (removed 9) and now considering 856/865 (removed 9) transitions.
// Phase 1: matrix 856 rows 897 cols
[2024-05-25 14:20:04] [INFO ] Computed 41 invariants in 14 ms
[2024-05-25 14:20:05] [INFO ] Implicit Places using invariants in 617 ms returned []
[2024-05-25 14:20:05] [INFO ] Invariant cache hit.
[2024-05-25 14:20:08] [INFO ] Implicit Places using invariants and state equation in 3272 ms returned []
Implicit Place search using SMT with State Equation took 3894 ms to find 0 implicit places.
[2024-05-25 14:20:08] [INFO ] Invariant cache hit.
[2024-05-25 14:20:09] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 897/906 places, 856/865 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5128 ms. Remains : 897/906 places, 856/865 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p1), (NOT p2), true]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s99 s535), p0:(OR (LEQ s129 s159) (LEQ s99 s535) (LEQ 1 s337)), p1:(GT 1 s365)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 695 steps with 4 reset in 6 ms.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-02 finished in 5329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (G(F(p1))||G(p2)))))'
Support contains 6 out of 906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 899 transition count 858
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 899 transition count 858
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 893 transition count 852
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 893 transition count 852
Applied a total of 26 rules in 129 ms. Remains 893 /906 variables (removed 13) and now considering 852/865 (removed 13) transitions.
// Phase 1: matrix 852 rows 893 cols
[2024-05-25 14:20:09] [INFO ] Computed 41 invariants in 8 ms
[2024-05-25 14:20:10] [INFO ] Implicit Places using invariants in 670 ms returned []
[2024-05-25 14:20:10] [INFO ] Invariant cache hit.
[2024-05-25 14:20:13] [INFO ] Implicit Places using invariants and state equation in 3249 ms returned []
Implicit Place search using SMT with State Equation took 3923 ms to find 0 implicit places.
[2024-05-25 14:20:13] [INFO ] Invariant cache hit.
[2024-05-25 14:20:14] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/906 places, 852/865 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4921 ms. Remains : 893/906 places, 852/865 transitions.
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p2 p0), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GT s872 s646), p1:(LEQ s883 s630), p2:(LEQ s829 s63)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 108 reset in 415 ms.
Product exploration explored 100000 steps with 108 reset in 405 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 3217 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 14:20:19] [INFO ] Invariant cache hit.
[2024-05-25 14:20:20] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 14:20:20] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 176 ms returned sat
[2024-05-25 14:20:21] [INFO ] After 785ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 14:20:21] [INFO ] After 1007ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-05-25 14:20:21] [INFO ] After 1494ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 893 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 893/893 places, 852/852 transitions.
Graph (complete) has 1715 edges and 893 vertex of which 861 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 374 transitions
Trivial Post-agglo rules discarded 374 transitions
Performed 374 trivial Post agglomeration. Transition count delta: 374
Iterating post reduction 0 with 406 rules applied. Total rules applied 407 place count 861 transition count 446
Reduce places removed 374 places and 0 transitions.
Graph (complete) has 870 edges and 487 vertex of which 423 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.0 ms
Discarding 64 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 375 rules applied. Total rules applied 782 place count 423 transition count 446
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 846 place count 423 transition count 382
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 847 place count 422 transition count 381
Iterating global reduction 3 with 1 rules applied. Total rules applied 848 place count 422 transition count 381
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 849 place count 421 transition count 380
Iterating global reduction 3 with 1 rules applied. Total rules applied 850 place count 421 transition count 380
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 852 place count 421 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 854 place count 419 transition count 378
Reduce places removed 34 places and 34 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 888 place count 385 transition count 344
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 4 with 281 rules applied. Total rules applied 1169 place count 354 transition count 94
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 5 with 250 rules applied. Total rules applied 1419 place count 104 transition count 94
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 27 Pre rules applied. Total rules applied 1419 place count 104 transition count 67
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 1473 place count 77 transition count 67
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 1474 place count 76 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1474 place count 76 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1476 place count 75 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1482 place count 72 transition count 63
Applied a total of 1482 rules in 103 ms. Remains 72 /893 variables (removed 821) and now considering 63/852 (removed 789) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 72/893 places, 63/852 transitions.
Finished random walk after 457 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=228 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 24 factoid took 5878 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 893 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 : 893/893 places, 852/852 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 372 transitions
Trivial Post-agglo rules discarded 372 transitions
Performed 372 trivial Post agglomeration. Transition count delta: 372
Iterating post reduction 0 with 372 rules applied. Total rules applied 372 place count 859 transition count 446
Reduce places removed 372 places and 0 transitions.
Iterating post reduction 1 with 372 rules applied. Total rules applied 744 place count 487 transition count 446
Applied a total of 744 rules in 34 ms. Remains 487 /893 variables (removed 406) and now considering 446/852 (removed 406) transitions.
// Phase 1: matrix 446 rows 487 cols
[2024-05-25 14:20:27] [INFO ] Computed 41 invariants in 3 ms
[2024-05-25 14:20:28] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-25 14:20:28] [INFO ] Invariant cache hit.
[2024-05-25 14:20:30] [INFO ] Implicit Places using invariants and state equation in 2262 ms returned []
Implicit Place search using SMT with State Equation took 2811 ms to find 0 implicit places.
[2024-05-25 14:20:30] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-25 14:20:30] [INFO ] Invariant cache hit.
[2024-05-25 14:20:31] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/893 places, 446/852 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3472 ms. Remains : 487/893 places, 446/852 transitions.
Computed a total of 487 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 487 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 p2 p1), (X p2), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 188 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 14:20:31] [INFO ] Invariant cache hit.
[2024-05-25 14:20:32] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:20:32] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 99 ms returned sat
[2024-05-25 14:20:32] [INFO ] After 455ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X p2), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 318 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 207 reset in 281 ms.
Product exploration explored 100000 steps with 207 reset in 317 ms.
Built C files in :
/tmp/ltsmin4926445244700449186
[2024-05-25 14:20:33] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2024-05-25 14:20:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:20:33] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2024-05-25 14:20:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:20:33] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2024-05-25 14:20:33] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:20:33] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4926445244700449186
Running compilation step : cd /tmp/ltsmin4926445244700449186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1484 ms.
Running link step : cd /tmp/ltsmin4926445244700449186;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4926445244700449186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2853246166795851729.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 446/446 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 487 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 486 transition count 445
Applied a total of 2 rules in 32 ms. Remains 486 /487 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 486 cols
[2024-05-25 14:20:49] [INFO ] Computed 41 invariants in 3 ms
[2024-05-25 14:20:49] [INFO ] Implicit Places using invariants in 616 ms returned []
[2024-05-25 14:20:49] [INFO ] Invariant cache hit.
[2024-05-25 14:20:52] [INFO ] Implicit Places using invariants and state equation in 2405 ms returned []
Implicit Place search using SMT with State Equation took 3027 ms to find 0 implicit places.
[2024-05-25 14:20:52] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 14:20:52] [INFO ] Invariant cache hit.
[2024-05-25 14:20:52] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 486/487 places, 445/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3657 ms. Remains : 486/487 places, 445/446 transitions.
Built C files in :
/tmp/ltsmin11600076434926987146
[2024-05-25 14:20:52] [INFO ] Computing symmetric may disable matrix : 445 transitions.
[2024-05-25 14:20:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:20:52] [INFO ] Computing symmetric may enable matrix : 445 transitions.
[2024-05-25 14:20:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:20:52] [INFO ] Computing Do-Not-Accords matrix : 445 transitions.
[2024-05-25 14:20:52] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:20:52] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11600076434926987146
Running compilation step : cd /tmp/ltsmin11600076434926987146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1518 ms.
Running link step : cd /tmp/ltsmin11600076434926987146;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11600076434926987146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7747270730620016216.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 14:21:07] [INFO ] Flatten gal took : 30 ms
[2024-05-25 14:21:07] [INFO ] Flatten gal took : 29 ms
[2024-05-25 14:21:07] [INFO ] Time to serialize gal into /tmp/LTL18406183138789764617.gal : 6 ms
[2024-05-25 14:21:07] [INFO ] Time to serialize properties into /tmp/LTL726402813789690420.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18406183138789764617.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8871368264496359868.hoa' '-atoms' '/tmp/LTL726402813789690420.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL726402813789690420.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8871368264496359868.hoa
Detected timeout of ITS tools.
[2024-05-25 14:21:23] [INFO ] Flatten gal took : 31 ms
[2024-05-25 14:21:23] [INFO ] Flatten gal took : 24 ms
[2024-05-25 14:21:23] [INFO ] Time to serialize gal into /tmp/LTL11865864254928555106.gal : 3 ms
[2024-05-25 14:21:23] [INFO ] Time to serialize properties into /tmp/LTL3962224451951939009.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11865864254928555106.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3962224451951939009.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(elected_35_to_left_21>rcv_left_election_35_5_28_28)"))U((G(F("(elected_35_to_left_10<=rcv_left_election_35_5_20_20)")))||(G(...203
Formula 0 simplified : X(F!"(elected_35_to_left_21>rcv_left_election_35_5_28_28)" R (FG!"(elected_35_to_left_10<=rcv_left_election_35_5_20_20)" & F!"(rcv_l...192
Detected timeout of ITS tools.
[2024-05-25 14:21:38] [INFO ] Flatten gal took : 22 ms
[2024-05-25 14:21:38] [INFO ] Applying decomposition
[2024-05-25 14:21:38] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3850471506406773878.txt' '-o' '/tmp/graph3850471506406773878.bin' '-w' '/tmp/graph3850471506406773878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3850471506406773878.bin' '-l' '-1' '-v' '-w' '/tmp/graph3850471506406773878.weights' '-q' '0' '-e' '0.001'
[2024-05-25 14:21:38] [INFO ] Decomposing Gal with order
[2024-05-25 14:21:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 14:21:38] [INFO ] Removed a total of 333 redundant transitions.
[2024-05-25 14:21:38] [INFO ] Flatten gal took : 111 ms
[2024-05-25 14:21:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 38 ms.
[2024-05-25 14:21:38] [INFO ] Time to serialize gal into /tmp/LTL2767039433899948673.gal : 13 ms
[2024-05-25 14:21:38] [INFO ] Time to serialize properties into /tmp/LTL4309381548652036169.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2767039433899948673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4309381548652036169.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("(gu137.elected_35_to_left_21>gu137.rcv_left_election_35_5_28_28)"))U((G(F("(gu194.elected_35_to_left_10<=gu194.rcv_left_elect...239
Formula 0 simplified : X(F!"(gu137.elected_35_to_left_21>gu137.rcv_left_election_35_5_28_28)" R (FG!"(gu194.elected_35_to_left_10<=gu194.rcv_left_election_...228
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16259508023046771001
[2024-05-25 14:21:53] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16259508023046771001
Running compilation step : cd /tmp/ltsmin16259508023046771001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1131 ms.
Running link step : cd /tmp/ltsmin16259508023046771001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16259508023046771001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true)) U ([](<>((LTLAPp1==true)))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-09 finished in 119271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 871 transition count 438
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 1 with 392 rules applied. Total rules applied 784 place count 479 transition count 438
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 790 place count 473 transition count 432
Iterating global reduction 2 with 6 rules applied. Total rules applied 796 place count 473 transition count 432
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 797 place count 473 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 472 transition count 431
Applied a total of 798 rules in 57 ms. Remains 472 /906 variables (removed 434) and now considering 431/865 (removed 434) transitions.
// Phase 1: matrix 431 rows 472 cols
[2024-05-25 14:22:09] [INFO ] Computed 41 invariants in 3 ms
[2024-05-25 14:22:09] [INFO ] Implicit Places using invariants in 630 ms returned []
[2024-05-25 14:22:09] [INFO ] Invariant cache hit.
[2024-05-25 14:22:11] [INFO ] Implicit Places using invariants and state equation in 2132 ms returned []
Implicit Place search using SMT with State Equation took 2762 ms to find 0 implicit places.
[2024-05-25 14:22:11] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 14:22:11] [INFO ] Invariant cache hit.
[2024-05-25 14:22:12] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 472/906 places, 431/865 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3442 ms. Remains : 472/906 places, 431/865 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-10 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:(GT 1 s61)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1208 reset in 625 ms.
Product exploration explored 100000 steps with 1218 reset in 645 ms.
Computed a total of 472 stabilizing places and 431 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 472 transition count 431
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, (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-10 finished in 5021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Support contains 4 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 872 transition count 441
Reduce places removed 390 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 391 rules applied. Total rules applied 781 place count 482 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 782 place count 481 transition count 440
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 788 place count 475 transition count 434
Iterating global reduction 3 with 6 rules applied. Total rules applied 794 place count 475 transition count 434
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 796 place count 474 transition count 433
Applied a total of 796 rules in 61 ms. Remains 474 /906 variables (removed 432) and now considering 433/865 (removed 432) transitions.
// Phase 1: matrix 433 rows 474 cols
[2024-05-25 14:22:14] [INFO ] Computed 41 invariants in 3 ms
[2024-05-25 14:22:14] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-25 14:22:14] [INFO ] Invariant cache hit.
[2024-05-25 14:22:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 14:22:16] [INFO ] Implicit Places using invariants and state equation in 2213 ms returned []
Implicit Place search using SMT with State Equation took 2785 ms to find 0 implicit places.
[2024-05-25 14:22:16] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 14:22:16] [INFO ] Invariant cache hit.
[2024-05-25 14:22:17] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 474/906 places, 433/865 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3369 ms. Remains : 474/906 places, 433/865 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s146 s400), p1:(LEQ s93 s446)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 214 reset in 269 ms.
Product exploration explored 100000 steps with 214 reset in 311 ms.
Computed a total of 474 stabilizing places and 433 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 474 transition count 433
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 405893 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 405893 steps, saw 127684 distinct states, run finished after 3002 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 14:22:21] [INFO ] Invariant cache hit.
[2024-05-25 14:22:21] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:22:21] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 95 ms returned sat
[2024-05-25 14:22:22] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 14:22:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 14:22:22] [INFO ] After 85ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 14:22:22] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-25 14:22:22] [INFO ] After 656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 74 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 229 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 433/433 transitions.
Applied a total of 0 rules in 19 ms. Remains 474 /474 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2024-05-25 14:22:22] [INFO ] Invariant cache hit.
[2024-05-25 14:22:23] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-05-25 14:22:23] [INFO ] Invariant cache hit.
[2024-05-25 14:22:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 14:22:25] [INFO ] Implicit Places using invariants and state equation in 2286 ms returned []
Implicit Place search using SMT with State Equation took 3018 ms to find 0 implicit places.
[2024-05-25 14:22:25] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 14:22:25] [INFO ] Invariant cache hit.
[2024-05-25 14:22:26] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3602 ms. Remains : 474/474 places, 433/433 transitions.
Computed a total of 474 stabilizing places and 433 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 474 transition count 433
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 420584 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 420584 steps, saw 130753 distinct states, run finished after 3004 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 14:22:30] [INFO ] Invariant cache hit.
[2024-05-25 14:22:30] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 14:22:30] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 94 ms returned sat
[2024-05-25 14:22:30] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 14:22:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 14:22:30] [INFO ] After 81ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 14:22:30] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-25 14:22:30] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 62 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 214 reset in 259 ms.
Product exploration explored 100000 steps with 214 reset in 312 ms.
Built C files in :
/tmp/ltsmin4797553576789556292
[2024-05-25 14:22:31] [INFO ] Computing symmetric may disable matrix : 433 transitions.
[2024-05-25 14:22:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:22:31] [INFO ] Computing symmetric may enable matrix : 433 transitions.
[2024-05-25 14:22:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:22:31] [INFO ] Computing Do-Not-Accords matrix : 433 transitions.
[2024-05-25 14:22:31] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:22:31] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4797553576789556292
Running compilation step : cd /tmp/ltsmin4797553576789556292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1440 ms.
Running link step : cd /tmp/ltsmin4797553576789556292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4797553576789556292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18187309183350300476.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 433/433 transitions.
Applied a total of 0 rules in 26 ms. Remains 474 /474 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2024-05-25 14:22:46] [INFO ] Invariant cache hit.
[2024-05-25 14:22:47] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-25 14:22:47] [INFO ] Invariant cache hit.
[2024-05-25 14:22:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-25 14:22:49] [INFO ] Implicit Places using invariants and state equation in 2174 ms returned []
Implicit Place search using SMT with State Equation took 2826 ms to find 0 implicit places.
[2024-05-25 14:22:49] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 14:22:49] [INFO ] Invariant cache hit.
[2024-05-25 14:22:50] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3306 ms. Remains : 474/474 places, 433/433 transitions.
Built C files in :
/tmp/ltsmin805818360371852871
[2024-05-25 14:22:50] [INFO ] Computing symmetric may disable matrix : 433 transitions.
[2024-05-25 14:22:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:22:50] [INFO ] Computing symmetric may enable matrix : 433 transitions.
[2024-05-25 14:22:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:22:50] [INFO ] Computing Do-Not-Accords matrix : 433 transitions.
[2024-05-25 14:22:50] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:22:50] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin805818360371852871
Running compilation step : cd /tmp/ltsmin805818360371852871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1487 ms.
Running link step : cd /tmp/ltsmin805818360371852871;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin805818360371852871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11268395818697881564.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 14:23:05] [INFO ] Flatten gal took : 27 ms
[2024-05-25 14:23:05] [INFO ] Flatten gal took : 24 ms
[2024-05-25 14:23:05] [INFO ] Time to serialize gal into /tmp/LTL14650000285754906815.gal : 4 ms
[2024-05-25 14:23:05] [INFO ] Time to serialize properties into /tmp/LTL16801885857963408573.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14650000285754906815.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3476449894434269545.hoa' '-atoms' '/tmp/LTL16801885857963408573.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16801885857963408573.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3476449894434269545.hoa
Detected timeout of ITS tools.
[2024-05-25 14:23:20] [INFO ] Flatten gal took : 16 ms
[2024-05-25 14:23:20] [INFO ] Flatten gal took : 19 ms
[2024-05-25 14:23:20] [INFO ] Time to serialize gal into /tmp/LTL14635793493828279652.gal : 4 ms
[2024-05-25 14:23:20] [INFO ] Time to serialize properties into /tmp/LTL12206029608199539419.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14635793493828279652.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12206029608199539419.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(election_35_3_8_to_left_28<=rcv_right_election_35_6_31_4)")||(G(F("(election_29_0_1_to_right_29<=elected_35_to_left_28)"))))...158
Formula 0 simplified : FG(!"(election_29_0_1_to_right_29<=elected_35_to_left_28)" & !"(election_35_3_8_to_left_28<=rcv_right_election_35_6_31_4)")
Detected timeout of ITS tools.
[2024-05-25 14:23:35] [INFO ] Flatten gal took : 21 ms
[2024-05-25 14:23:35] [INFO ] Applying decomposition
[2024-05-25 14:23:35] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10396424992331108923.txt' '-o' '/tmp/graph10396424992331108923.bin' '-w' '/tmp/graph10396424992331108923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10396424992331108923.bin' '-l' '-1' '-v' '-w' '/tmp/graph10396424992331108923.weights' '-q' '0' '-e' '0.001'
[2024-05-25 14:23:35] [INFO ] Decomposing Gal with order
[2024-05-25 14:23:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 14:23:35] [INFO ] Removed a total of 318 redundant transitions.
[2024-05-25 14:23:35] [INFO ] Flatten gal took : 44 ms
[2024-05-25 14:23:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 13 ms.
[2024-05-25 14:23:35] [INFO ] Time to serialize gal into /tmp/LTL1010290606549051072.gal : 8 ms
[2024-05-25 14:23:35] [INFO ] Time to serialize properties into /tmp/LTL3548683158215906044.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1010290606549051072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3548683158215906044.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gu161.election_35_3_8_to_left_28<=gu161.rcv_right_election_35_6_31_4)")||(G(F("(gu30.election_29_0_1_to_right_29<=gu30.elect...180
Formula 0 simplified : FG(!"(gu30.election_29_0_1_to_right_29<=gu30.elected_35_to_left_28)" & !"(gu161.election_35_3_8_to_left_28<=gu161.rcv_right_election...168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12271321717359915182
[2024-05-25 14:23:51] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12271321717359915182
Running compilation step : cd /tmp/ltsmin12271321717359915182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1123 ms.
Running link step : cd /tmp/ltsmin12271321717359915182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12271321717359915182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-11 finished in 111989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))||X(p1)))'
Support contains 4 out of 906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 899 transition count 858
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 899 transition count 858
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 893 transition count 852
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 893 transition count 852
Applied a total of 26 rules in 123 ms. Remains 893 /906 variables (removed 13) and now considering 852/865 (removed 13) transitions.
// Phase 1: matrix 852 rows 893 cols
[2024-05-25 14:24:06] [INFO ] Computed 41 invariants in 6 ms
[2024-05-25 14:24:06] [INFO ] Implicit Places using invariants in 586 ms returned []
[2024-05-25 14:24:06] [INFO ] Invariant cache hit.
[2024-05-25 14:24:10] [INFO ] Implicit Places using invariants and state equation in 3337 ms returned []
Implicit Place search using SMT with State Equation took 3925 ms to find 0 implicit places.
[2024-05-25 14:24:10] [INFO ] Invariant cache hit.
[2024-05-25 14:24:10] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 893/906 places, 852/865 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4821 ms. Remains : 893/906 places, 852/865 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s202 s686), p1:(LEQ s246 s696)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 953 ms.
Product exploration explored 100000 steps with 50000 reset in 957 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-12 finished in 7318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 871 transition count 439
Reduce places removed 391 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 392 rules applied. Total rules applied 783 place count 480 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 784 place count 479 transition count 438
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 791 place count 472 transition count 431
Iterating global reduction 3 with 7 rules applied. Total rules applied 798 place count 472 transition count 431
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 799 place count 472 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 800 place count 471 transition count 430
Applied a total of 800 rules in 45 ms. Remains 471 /906 variables (removed 435) and now considering 430/865 (removed 435) transitions.
// Phase 1: matrix 430 rows 471 cols
[2024-05-25 14:24:13] [INFO ] Computed 41 invariants in 2 ms
[2024-05-25 14:24:14] [INFO ] Implicit Places using invariants in 763 ms returned []
[2024-05-25 14:24:14] [INFO ] Invariant cache hit.
[2024-05-25 14:24:16] [INFO ] Implicit Places using invariants and state equation in 2221 ms returned []
Implicit Place search using SMT with State Equation took 2986 ms to find 0 implicit places.
[2024-05-25 14:24:16] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 14:24:16] [INFO ] Invariant cache hit.
[2024-05-25 14:24:17] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 471/906 places, 430/865 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3627 ms. Remains : 471/906 places, 430/865 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s230 s118) (GT 2 s444))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 465 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-13 finished in 3682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p0 U (p1||G(p0)))))))'
Support contains 2 out of 906 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 : 906/906 places, 865/865 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 871 transition count 441
Reduce places removed 389 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 390 rules applied. Total rules applied 779 place count 482 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 780 place count 481 transition count 440
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 785 place count 476 transition count 435
Iterating global reduction 3 with 5 rules applied. Total rules applied 790 place count 476 transition count 435
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 791 place count 476 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 792 place count 475 transition count 434
Applied a total of 792 rules in 44 ms. Remains 475 /906 variables (removed 431) and now considering 434/865 (removed 431) transitions.
// Phase 1: matrix 434 rows 475 cols
[2024-05-25 14:24:17] [INFO ] Computed 41 invariants in 2 ms
[2024-05-25 14:24:17] [INFO ] Implicit Places using invariants in 706 ms returned []
[2024-05-25 14:24:17] [INFO ] Invariant cache hit.
[2024-05-25 14:24:20] [INFO ] Implicit Places using invariants and state equation in 2218 ms returned []
Implicit Place search using SMT with State Equation took 2926 ms to find 0 implicit places.
[2024-05-25 14:24:20] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 14:24:20] [INFO ] Invariant cache hit.
[2024-05-25 14:24:20] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 475/906 places, 434/865 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3564 ms. Remains : 475/906 places, 434/865 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s91 s259)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 465 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-35-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-15 finished in 3623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (G(F(p1))||G(p2)))))'
Found a Lengthening insensitive property : HirschbergSinclair-PT-35-LTLCardinality-09
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 906 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 906/906 places, 865/865 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions removed 377 transitions
Trivial Post-agglo rules discarded 377 transitions
Performed 377 trivial Post agglomeration. Transition count delta: 377
Iterating post reduction 0 with 377 rules applied. Total rules applied 377 place count 872 transition count 454
Reduce places removed 377 places and 0 transitions.
Iterating post reduction 1 with 377 rules applied. Total rules applied 754 place count 495 transition count 454
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 761 place count 488 transition count 447
Iterating global reduction 2 with 7 rules applied. Total rules applied 768 place count 488 transition count 447
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 769 place count 488 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 770 place count 487 transition count 446
Applied a total of 770 rules in 43 ms. Remains 487 /906 variables (removed 419) and now considering 446/865 (removed 419) transitions.
// Phase 1: matrix 446 rows 487 cols
[2024-05-25 14:24:21] [INFO ] Computed 41 invariants in 2 ms
[2024-05-25 14:24:22] [INFO ] Implicit Places using invariants in 677 ms returned []
[2024-05-25 14:24:22] [INFO ] Invariant cache hit.
[2024-05-25 14:24:24] [INFO ] Implicit Places using invariants and state equation in 2356 ms returned []
Implicit Place search using SMT with State Equation took 3036 ms to find 0 implicit places.
[2024-05-25 14:24:24] [INFO ] Invariant cache hit.
[2024-05-25 14:24:25] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 487/906 places, 446/865 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3733 ms. Remains : 487/906 places, 446/865 transitions.
Running random walk in product with property : HirschbergSinclair-PT-35-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p2 p0), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GT s466 s341), p1:(LEQ s477 s332), p2:(LEQ s436 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 208 reset in 285 ms.
Product exploration explored 100000 steps with 207 reset in 326 ms.
Computed a total of 487 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 487 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) p1 p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 3379 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 14:24:29] [INFO ] Invariant cache hit.
[2024-05-25 14:24:29] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 14:24:30] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 100 ms returned sat
[2024-05-25 14:24:30] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 14:24:30] [INFO ] After 408ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2024-05-25 14:24:30] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 446/446 transitions.
Graph (complete) has 836 edges and 487 vertex of which 391 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.1 ms
Discarding 96 places :
Also discarding 0 output transitions
Drop transitions removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 391 transition count 348
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 1 with 283 rules applied. Total rules applied 382 place count 358 transition count 98
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 2 with 250 rules applied. Total rules applied 632 place count 108 transition count 98
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 632 place count 108 transition count 71
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 686 place count 81 transition count 71
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 687 place count 80 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 687 place count 80 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 689 place count 79 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 690 place count 78 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 691 place count 78 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 692 place count 77 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 693 place count 77 transition count 68
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 699 place count 74 transition count 65
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 701 place count 74 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 703 place count 72 transition count 63
Applied a total of 703 rules in 23 ms. Remains 72 /487 variables (removed 415) and now considering 63/446 (removed 383) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 72/487 places, 63/446 transitions.
Finished random walk after 59 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p2) p0))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 24 factoid took 6120 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 487 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 : 487/487 places, 446/446 transitions.
Applied a total of 0 rules in 17 ms. Remains 487 /487 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-25 14:24:36] [INFO ] Invariant cache hit.
[2024-05-25 14:24:37] [INFO ] Implicit Places using invariants in 693 ms returned []
[2024-05-25 14:24:37] [INFO ] Invariant cache hit.
[2024-05-25 14:24:39] [INFO ] Implicit Places using invariants and state equation in 2225 ms returned []
Implicit Place search using SMT with State Equation took 2922 ms to find 0 implicit places.
[2024-05-25 14:24:39] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 14:24:39] [INFO ] Invariant cache hit.
[2024-05-25 14:24:40] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3591 ms. Remains : 487/487 places, 446/446 transitions.
Computed a total of 487 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 487 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 p2 p1), (X p2), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 186 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 20 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 14:24:41] [INFO ] Invariant cache hit.
[2024-05-25 14:24:41] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 14:24:41] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 98 ms returned sat
[2024-05-25 14:24:41] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-25 14:24:41] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-25 14:24:42] [INFO ] After 719ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 446/446 transitions.
Graph (complete) has 836 edges and 487 vertex of which 391 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.0 ms
Discarding 96 places :
Also discarding 0 output transitions
Drop transitions removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 391 transition count 348
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 1 with 283 rules applied. Total rules applied 382 place count 358 transition count 98
Reduce places removed 250 places and 0 transitions.
Iterating post reduction 2 with 250 rules applied. Total rules applied 632 place count 108 transition count 98
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 632 place count 108 transition count 71
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 686 place count 81 transition count 71
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 687 place count 80 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 687 place count 80 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 689 place count 79 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 690 place count 78 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 691 place count 78 transition count 69
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 692 place count 77 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 693 place count 77 transition count 68
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 699 place count 74 transition count 65
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 701 place count 74 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 703 place count 72 transition count 63
Applied a total of 703 rules in 15 ms. Remains 72 /487 variables (removed 415) and now considering 63/446 (removed 383) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 72/487 places, 63/446 transitions.
Finished random walk after 62 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X p2), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), true, (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 312 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 208 reset in 284 ms.
Product exploration explored 100000 steps with 208 reset in 323 ms.
Built C files in :
/tmp/ltsmin16257594381629541968
[2024-05-25 14:24:43] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2024-05-25 14:24:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:24:43] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2024-05-25 14:24:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:24:43] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
[2024-05-25 14:24:43] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:24:43] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16257594381629541968
Running compilation step : cd /tmp/ltsmin16257594381629541968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1567 ms.
Running link step : cd /tmp/ltsmin16257594381629541968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16257594381629541968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2734967859545684838.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 446/446 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 487 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 486 transition count 445
Applied a total of 2 rules in 21 ms. Remains 486 /487 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 486 cols
[2024-05-25 14:24:58] [INFO ] Computed 41 invariants in 3 ms
[2024-05-25 14:24:59] [INFO ] Implicit Places using invariants in 746 ms returned []
[2024-05-25 14:24:59] [INFO ] Invariant cache hit.
[2024-05-25 14:25:01] [INFO ] Implicit Places using invariants and state equation in 2303 ms returned []
Implicit Place search using SMT with State Equation took 3059 ms to find 0 implicit places.
[2024-05-25 14:25:01] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 14:25:01] [INFO ] Invariant cache hit.
[2024-05-25 14:25:02] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 486/487 places, 445/446 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3701 ms. Remains : 486/487 places, 445/446 transitions.
Built C files in :
/tmp/ltsmin8360169807151326697
[2024-05-25 14:25:02] [INFO ] Computing symmetric may disable matrix : 445 transitions.
[2024-05-25 14:25:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:25:02] [INFO ] Computing symmetric may enable matrix : 445 transitions.
[2024-05-25 14:25:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:25:02] [INFO ] Computing Do-Not-Accords matrix : 445 transitions.
[2024-05-25 14:25:02] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:25:02] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8360169807151326697
Running compilation step : cd /tmp/ltsmin8360169807151326697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1514 ms.
Running link step : cd /tmp/ltsmin8360169807151326697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8360169807151326697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2159926835191492177.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 14:25:17] [INFO ] Flatten gal took : 16 ms
[2024-05-25 14:25:17] [INFO ] Flatten gal took : 16 ms
[2024-05-25 14:25:17] [INFO ] Time to serialize gal into /tmp/LTL10316267413848154305.gal : 5 ms
[2024-05-25 14:25:17] [INFO ] Time to serialize properties into /tmp/LTL4221897572309921077.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10316267413848154305.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1192796703205385502.hoa' '-atoms' '/tmp/LTL4221897572309921077.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4221897572309921077.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1192796703205385502.hoa
Detected timeout of ITS tools.
[2024-05-25 14:25:32] [INFO ] Flatten gal took : 16 ms
[2024-05-25 14:25:32] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:25:32] [INFO ] Time to serialize gal into /tmp/LTL6698330204975370882.gal : 5 ms
[2024-05-25 14:25:32] [INFO ] Time to serialize properties into /tmp/LTL10839629010614778781.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6698330204975370882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10839629010614778781.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(elected_35_to_left_21>rcv_left_election_35_5_28_28)"))U((G(F("(elected_35_to_left_10<=rcv_left_election_35_5_20_20)")))||(G(...203
Formula 0 simplified : X(F!"(elected_35_to_left_21>rcv_left_election_35_5_28_28)" R (FG!"(elected_35_to_left_10<=rcv_left_election_35_5_20_20)" & F!"(rcv_l...192
Detected timeout of ITS tools.
[2024-05-25 14:25:47] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:25:47] [INFO ] Applying decomposition
[2024-05-25 14:25:47] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3296865571305352048.txt' '-o' '/tmp/graph3296865571305352048.bin' '-w' '/tmp/graph3296865571305352048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3296865571305352048.bin' '-l' '-1' '-v' '-w' '/tmp/graph3296865571305352048.weights' '-q' '0' '-e' '0.001'
[2024-05-25 14:25:47] [INFO ] Decomposing Gal with order
[2024-05-25 14:25:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 14:25:47] [INFO ] Removed a total of 330 redundant transitions.
[2024-05-25 14:25:47] [INFO ] Flatten gal took : 34 ms
[2024-05-25 14:25:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 20 ms.
[2024-05-25 14:25:47] [INFO ] Time to serialize gal into /tmp/LTL3857784679374667770.gal : 12 ms
[2024-05-25 14:25:47] [INFO ] Time to serialize properties into /tmp/LTL8868360963029913154.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3857784679374667770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8868360963029913154.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("(gu190.elected_35_to_left_21>gu190.rcv_left_election_35_5_28_28)"))U((G(F("(gu196.elected_35_to_left_10<=gu196.rcv_left_elect...239
Formula 0 simplified : X(F!"(gu190.elected_35_to_left_21>gu190.rcv_left_election_35_5_28_28)" R (FG!"(gu196.elected_35_to_left_10<=gu196.rcv_left_election_...228
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8334716430496212200
[2024-05-25 14:26:03] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8334716430496212200
Running compilation step : cd /tmp/ltsmin8334716430496212200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1113 ms.
Running link step : cd /tmp/ltsmin8334716430496212200;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8334716430496212200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true)) U ([](<>((LTLAPp1==true)))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-35-LTLCardinality-09 finished in 117397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
[2024-05-25 14:26:18] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12299970467889758708
[2024-05-25 14:26:18] [INFO ] Computing symmetric may disable matrix : 865 transitions.
[2024-05-25 14:26:18] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:26:18] [INFO ] Computing symmetric may enable matrix : 865 transitions.
[2024-05-25 14:26:18] [INFO ] Applying decomposition
[2024-05-25 14:26:18] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:26:18] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14362461051645169624.txt' '-o' '/tmp/graph14362461051645169624.bin' '-w' '/tmp/graph14362461051645169624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14362461051645169624.bin' '-l' '-1' '-v' '-w' '/tmp/graph14362461051645169624.weights' '-q' '0' '-e' '0.001'
[2024-05-25 14:26:18] [INFO ] Decomposing Gal with order
[2024-05-25 14:26:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 14:26:18] [INFO ] Computing Do-Not-Accords matrix : 865 transitions.
[2024-05-25 14:26:18] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 14:26:18] [INFO ] Built C files in 207ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12299970467889758708
Running compilation step : cd /tmp/ltsmin12299970467889758708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 14:26:18] [INFO ] Removed a total of 110 redundant transitions.
[2024-05-25 14:26:18] [INFO ] Flatten gal took : 65 ms
[2024-05-25 14:26:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 23 ms.
[2024-05-25 14:26:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality2400374570758435894.gal : 12 ms
[2024-05-25 14:26:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality7490792542286680396.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2400374570758435894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7490792542286680396.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((X((G("(gu81.elected_35_to_left_21>gu81.rcv_left_election_35_5_28_28)"))U((G(F("(gu79.elected_35_to_left_10<=gu79.rcv_left_election_...233
Formula 0 simplified : X(F!"(gu81.elected_35_to_left_21>gu81.rcv_left_election_35_5_28_28)" R (FG!"(gu79.elected_35_to_left_10<=gu79.rcv_left_election_35_5...222
Compilation finished in 3897 ms.
Running link step : cd /tmp/ltsmin12299970467889758708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin12299970467889758708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true)) U ([](<>((LTLAPp1==true)))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gu93.t171, gi0.gi0.gi0.gi0.gu13.t106, gi0.gi0.gi0.gi0.gu42.t110, gi0.gi0.gi0.gi0.gu42.t114, g...2281
Computing Next relation with stutter on 8.75988e+25 deadlock states
Detected timeout of ITS tools.
[2024-05-25 14:48:43] [INFO ] Flatten gal took : 117 ms
[2024-05-25 14:48:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality14948852646781130075.gal : 23 ms
[2024-05-25 14:48:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality13364943011778502419.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14948852646781130075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13364943011778502419.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((X((G("(elected_35_to_left_21>rcv_left_election_35_5_28_28)"))U((G(F("(elected_35_to_left_10<=rcv_left_election_35_5_20_20)")))||(G(...203
Formula 0 simplified : X(F!"(elected_35_to_left_21>rcv_left_election_35_5_28_28)" R (FG!"(elected_35_to_left_10<=rcv_left_election_35_5_20_20)" & F!"(rcv_l...192
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin12299970467889758708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true)) U ([](<>((LTLAPp1==true)))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12299970467889758708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp3==true)||[](<>((LTLAPp4==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...718
Computing Next relation with stutter on 8.75988e+25 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:11:09] [INFO ] Flatten gal took : 99 ms
[2024-05-25 15:11:09] [INFO ] Input system was already deterministic with 865 transitions.
[2024-05-25 15:11:09] [INFO ] Transformed 906 places.
[2024-05-25 15:11:09] [INFO ] Transformed 865 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 15:11:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality9419417869449970814.gal : 11 ms
[2024-05-25 15:11:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality6178720126149427377.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9419417869449970814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6178720126149427377.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G("(elected_35_to_left_21>rcv_left_election_35_5_28_28)"))U((G(F("(elected_35_to_left_10<=rcv_left_election_35_5_20_20)")))||(G(...203
Formula 0 simplified : X(F!"(elected_35_to_left_21>rcv_left_election_35_5_28_28)" R (FG!"(elected_35_to_left_10<=rcv_left_election_35_5_20_20)" & F!"(rcv_l...192
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11285544 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16037080 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is HirschbergSinclair-PT-35, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r219-smll-171649597800067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-35.tgz
mv HirschbergSinclair-PT-35 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;